A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A hierarchical characterization of a live streaming media workload
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
PROMISE: peer-to-peer media streaming using CollectCast
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Multimedia Systems
A framework for architecting peer-to-peer receiver-driven overlays
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
On the impact of playout scheduling on the performance of peer-to-peer live streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In peer-to-peer streaming applications such as IP television and live shows, a key problem is how to construct an overlay network to provide high-quality, almost real-time media relay in an efficient and scalable manner. Much work has focused on the construction of tree and graph network topology, often based on the inference of network characteristics such as delay and bandwidth. Less attention has been paid to improving the liveness of media delivery, and to exploiting the flexibility of applications to construct better overlay networks. We propose the NSYNC, an ongoing work on constructing low-latency overlay networks for live streaming. It aims at solving the following problems. In typical applications, peers must buffer a portion of a real-time event, e.g., for at least a few seconds, to limit the impact of adversary network conditions. Thus, it introduces both (1) delay, especially long delay for peers that are many hops away from the origin servers, and (2) partial ordering between the peers. With NSYNC, the application media players can slightly increase or decrease the speed of playing media. Thus, the peers in a network can be synchronized to achieve two effects. First, late peers can catch early peers and the origin server such that the entire peer networks improve liveness. Second, the client/server roles between a pair of neighboring peers can be reversed, allowing opportunities for constructing more efficient overlay networks. NSYNC can be used in various peer-to-peer streaming systems.