Quality of Service in Heterogeneous Networks. 6th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2009 and 3rd International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications, AAA-IDEA 2009, Las Palmas, Gran Canaria, November 23-25, 2009 Proceedings

Research Article

A Topologically-Aware Overlay Tree for Efficient and Low-Latency Media Streaming

Download74 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-10625-5_24,
        author={Paris Carbone and Vana Kalogeraki},
        title={A Topologically-Aware Overlay Tree for Efficient and Low-Latency Media Streaming},
        proceedings={Quality of Service in Heterogeneous Networks. 6th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2009 and 3rd International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications, AAA-IDEA 2009, Las Palmas, Gran Canaria, November 23-25, 2009 Proceedings},
        proceedings_a={QSHINE},
        year={2012},
        month={10},
        keywords={Overlay Networks Multimedia Streaming},
        doi={10.1007/978-3-642-10625-5_24}
    }
    
  • Paris Carbone
    Vana Kalogeraki
    Year: 2012
    A Topologically-Aware Overlay Tree for Efficient and Low-Latency Media Streaming
    QSHINE
    Springer
    DOI: 10.1007/978-3-642-10625-5_24
Paris Carbone1, Vana Kalogeraki
  • 1: Athens University of Economics and Business

Abstract

Streaming a live music concert over the Internet is a challenging task as it requires real-time, high-quality data delivery over a large number of geographically distributed nodes. In this paper we propose MusiCast, a real-time peer-to-peer multicast system for streaming midi events and compressed audio data. We present a scalable and distributed tree construction algorithm where nodes across the Internet self-organize into a low-latency tree. Our system is built ontop of the pastry DHT and takes advantage of the DHT’s properties to construct an end-to-end low-latency dissemination tree using topology oriented information. The benefit of our scheme is that it is completely decentralized, allowing nodes to connect to each other using local information only, and achieves good performance by considering latency information when constructing the tree. Our experimental results illustrate the benefits of our approach.