Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Selecting among replicated batching video-on-demand servers
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Strategic Replication of Video Files in a Distributed Environment
Multimedia Tools and Applications
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
P2Cast: peer-to-peer patching scheme for VoD service
WWW '03 Proceedings of the 12th international conference on World Wide Web
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
Generic file sharing P2P applications have gained high popularity in the past few years. In particular, P2P streaming architectures have also attracted attention. Many of them consider many-to-one streaming or high-level multicast techniques. In contrast to these models, we propose techniques and algorithms for point-to-point streaming in autonomous systems as it might occur in large companies, a campus or even in large hotels. Our major aim is to create a replica situation that inter-subnetwork RSVP streams are reduced to a minimum. Therefore, we introduce the architecture of an overlay network for interconnecting subnetworks. Each subnetwork contains a so-called local active rendezvous server (LARS), which not only acts as directory server but also controls availability of movie content in its subnetwork. Owing to this, we consider data placement strategies depending on restrictions of network bandwidth, peer capabilities, as well as the movies' access frequency.