Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(9)
Combinatorial Optimization Problem
Distributed Protocol
Heuristic Algorithm
Objective Function
Overlay Network
Parallel Computer
Peertopeer Overlay Networks
Spanning Tree
Structured Overlay Network
Subscribe
Academic
Publications
Structured Overlay Network for File Distribution
Structured Overlay Network for File Distribution,10.1007/9783642174612_24,Hongbing Fan,YuLiang Wu
Edit
Structured Overlay Network for File Distribution
BibTex

RIS

RefWorks
Download
Hongbing Fan
,
YuLiang Wu
The file distribution from a source node to n sink nodes along a
structured overlay network
can be done in time Θ(logn). In this paper, we model the problem of finding an optimal
overlay network
for file distribution as a
combinatorial optimization
problem, i.e., finding a weighted
spanning tree
which connects the source node and sink nodes and has the minimum file distribution time. We use an edgebased file distribution protocol, in which after a node receives a file it then transfers the file to its neighbor nodes one after another in a sequential order. We give the formulation of file distribution time, and use it as the objective function. The corresponding
combinatorial optimization problem
is NPhard in general. We present a
heuristic algorithm
which derives an
overlay network
with file distribution time Θ(logn) and show that the derived
overlay network
is optimal if the file transfer delays between all pairs of nodes are the same.
Conference:
Conference on Combinatorial Optimization and Applications  COCOA
, pp. 292302, 2010
DOI:
10.1007/9783642174612_24
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
(
adsabs.harvard.edu
)
More »
References
(7)
Broadcasting in Bounded Degree Graphs
(
Citations: 29
)
Jeanclaude Bermond
,
Pavol Hell
,
Arthur L. Liestman
,
Joseph G. Peters
Journal:
Siam Journal on Discrete Mathematics  SIAMDM
, vol. 5, no. 1, pp. 1024, 1992
The design tradeoffs of BitTorrentlike file sharing protocols
(
Citations: 15
)
Bin Fan
,
John C. S. Lui
,
Dahming Chiu
Journal:
IEEE/ACM Transactions on Networking  TON
, vol. 17, no. 2, pp. 365376, 2009
Modeling PeerPeer File Sharing Systems
(
Citations: 182
)
Zihui Ge
,
Daniel R. Figueiredo
,
Sharad Jaiswal
,
James F. Kurose
,
Donald F. Towsley
Conference:
IEEE INFOCOM  INFOCOM
, vol. 3, pp. 21882198 vol.3, 2003
More Broadcast Graphs
(
Citations: 7
)
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Journal:
Discrete Applied Mathematics  DAM
, vol. 98, no. 12, pp. 81102, 1999
kBroadcasting in trees
(
Citations: 3
)
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Journal:
Networks
, vol. 38, no. 3, pp. 163168, 2001