The topology aware file distribution problem

Authors:
Shawn T. O'neil;Amitabh Chaudhary;Danny Z. Chen;Haitao Wang
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 21
Cited 0

Multicasting in heterogeneous networks

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
MagPIe: MPI's collective communication operations for clustered wide area systems

Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Adaptive protocols for information dissemination in wireless sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to algorithms

Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
TOPOMON: A Monitoring Tool for Grid Network Topology

ICCS '02 Proceedings of the International Conference on Computational Science-Part II
A Secure Routing Protocol for Ad Hoc Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Topology Discovery in Ad Hoc Wireless Networks Using Mobile Agents

MATA '00 Proceedings of the Second International Workshop on Mobile Agents for Telecommunication Applications
File and Object Replication in Data Grids

HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Merging logical topologies using end-to-end measurements

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Modeling and performance analysis of BitTorrent-like peer-to-peer networks

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Co-operative Downloading in Vehicular Ad-Hoc Wireless Networks

WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Sublogarithmic approximation for telephone multicast

Journal of Computer and System Sciences
Analyzing the performance and fairness of BitTorrent-like networks using a general fluid model

Computer Communications
Overlay architectures for file distribution: Fundamental performance analysis for homogeneous and heterogeneous cases

Computer Networks: The International Journal of Computer and Telecommunications Networking
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
A fast topology inference: a building block for network-aware parallel processing

Proceedings of the 16th international symposium on High performance distributed computing
Biocompute: towards a collaborative workspace for data intensive bio-science

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
A survey and comparison of peer-to-peer overlay network schemes

IEEE Communications Surveys & Tutorials
Peer-to-peer based multimedia distribution service

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present theoretical results for large-file distribution on general networks of known topology (known link bandwidths and router locations). We show that the problem of distributing a file in minimum time is NP-hard in this model, and we give an O(logn) approximation algorithm, where n is the number of workstations that require the file. We also characterize our method as optimal amongst the class of "no-link-sharing" algorithms.