Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Introduction to Algorithms
Dynamic parallel access to replicated content in the internet
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Generalized Hypercube-Connected-Cycle: An Efficient Network Topology
HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
PROMISE: peer-to-peer media streaming using CollectCast
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Failure recovery for structured P2P networks: protocol design and performance evaluation
Proceedings of the joint international conference on Measurement and modeling of computer systems
Routing Algorithms on the Bus-Based Hypercube Network
IEEE Transactions on Parallel and Distributed Systems
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Broadcast Trees for Heterogeneous Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Maintaining high bandwidth under dynamic network conditions
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Shark: scaling file servers via cooperative caching
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
FastReplica: efficient large file distribution within content delivery networks
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Scale and performance in the CoBlitz large-file distribution service
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
IEEE Communications Magazine
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Constructing an optimal server set in structured peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Parallel video streaming optimizing network throughput
Computer Communications
Efficient opportunistic network creation in the context of future internet
The future internet
Optimum Object Selection Made Easy
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In this paper, we investigate the issue of server selection for parallel download in overlay content-distribution networks. To achieve high performance and resilience to failures, a receiver can make connections with multiple servers simultaneously and receive different portions of the data from the servers in parallel. Prior studies mostly focus on the user-centric performance objectives, such as reducing the round-trip time (RTT) or the completion time of individual download, but tend to ignore the congestion caused by the concurrent connections from different servers or the total network resource usage. The latter performance concerns are important for the service providers who operate content-distribution networks. In this paper, we present a node-selection scheme in a hypercube-like overlay network that generates the optimal server set with respect to the worst-case link stress (WLS) criterion. The algorithm allows scaling to a large system because it is very efficient and does not require network measurement or collection of topology or routing information. It has performance advantages in a number of areas, particularly against the random selection scheme. First, it minimizes the level of congestion at the bottleneck link. This is equivalent to maximizing the achievable throughput. Second, it consumes less network resources in terms of the total number of links used and the total bandwidth usage. Third, it often leads to low average round-trip time to selected servers, hence, allowing nearby nodes to exchange more data, an objective sought by many content-distribution systems.