Zhichen Xu
Sung-Ju Lee
ABSTRACT
Application-level multicast networks overlaid on unicast IP networks are increasingly gaining in importance. While there have been several proposals for overlay multicast networks, very few of them focus on the stringent requirements of real-time applications such as streaming media. We propose RITA (Receiver Initiated Timely Adaptation) framework for an efficient overlay multicast infrastructure. RITA is based on a combination of landmark clustering and RTT measurements, and is particularly suitable for multimedia real-time applications. Our goal is to balance the network-oriented goals of building an efficient multicast tree with the application-oriented goals of providing good QoS with minimal disruptions. Using accurate global soft state information tables, our approach promptly constructs and reconfigures high quality trees. A distinguishing feature of our approach is that the tree reconfiguration is initiated just-in-time by the application client at the receiver when the media quality falls below a specific threshold. The goal is to achieve dynamic tree reconfiguration with very low switching delay such that end users do not perceive any application performance degradation.
- W. Ashmawi, R. Guerin, S. Wolf, and M. H. Pinson. On the i pact of policing and rate guarantees in Diff -- Serv networks: A video streaming application perspective. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 83--95, San Diego, CA, August 2001. Google Scholar
Digital Library
- S. Banerjee, B. Bhattacharjee, and C. Kommareddy. Scalable application layer ulticast. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 205--220, Pittsburgh, PA, August 2002. Google ScholarDigital Library
- S. Banerjee, J. Brassil, A. Dalal, S. - J. Lee, E. Perry, P. Sharma, and A. Thomas. CDNs for personal broadcasting and individualized reception. In Proceedings of 7th International Workshop on Web Content Caching and Distribution (WCW), pages 279--284, Boulder, CO, August 2002.Google Scholar
- S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller. Construction of an efficient overlay ulticast infrastructure for real-time applications. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), San Francisco, CA, April 2003.Google Scholar
- K. Calvert, M. Doar, and E. W. Zegura. Modeling internet topology. IEEE Communications Magazine 35(6): 160--163, June 1997. Google ScholarDigital Library
- M. Castro, P. Druschel, Y. Hu, and A. Rowstron. Exploiting network proximity in distributed hash tables. In Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy, June 2002.Google Scholar
- M. Castro, P. Druschel, A. - M. Kermarrec, and A. I. T. Rowstron. SCRIBE: A large-scale and decentralized application-level ulticast infrastructure. IEEE Journal on Selected Areas in Communications 20(8): 1489--1499, October 2002. Google ScholarDigital Library
- Y. Chawathe. Scattercast: An adaptive broadcast distribution framework. ACM Multimedia Systems Journal 2002. Google ScholarDigital Library
- Y. Chu, S. G. Rao, S. Seshan, and H. Zhang. A case for end system ulticast. IEEE Journal on Selected Areas in Communications 20(8): 1456--1471, October 2002. Google ScholarDigital Library
- P. Francis. Yoid: Your Own Internet Distribution, March 2001. http://www.isi.edi/div7/yoid/.Google Scholar
- P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. IDMaps: A global internet host distance estimation service. IEEE/ACM Transactions on Networking 9(5): 525--540, October 2001. Google ScholarDigital Library
- K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating latency between arbitrary internet end hosts. In Proceedings of the Second ACM SIGCOMM Internet Measurement Workshop (IMW), pages 5--18, Marseille, France, November 2002. Google ScholarDigital Library
- Ion Stoica and Robert Morris and David Karger and M. Frans Kaashoek and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 149--160, San Diego, CA, August 2001. Google ScholarDigital Library
- J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole, Jr. Overcast: Reliable ulticasting with an overlay network. In Proceedings of the 4th USENIX Symposium on Operating System Design and Implementation (OSDI), San Diego, CA, October 2000. Google ScholarDigital Library
- D. Kostic, A. Rodriguez, J. Albrecht, A. Bhirud, and A. M. Vahdat. Using rando subsets to build scalable network services. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems Seattle, WA, March 2003. Google ScholarDigital Library
- J. Liebeherr, M. Nahas, and W. Si. Application-layer ulticasting with delaunay triangulation overlays. IEEE Journal on Selected Areas in Communications 20(8): 1472--1488, October 2002. Google ScholarDigital Library
- T. S. E. Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), New York, NY, June 2002.Google ScholarCross Ref
- V. N. Padmanabhan, H. J. Wang, P. A. Chou, and K. Sripanidkulchai. Distributing streaming media content using cooperative networking. In Proceedings of 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), Miami, FL, May 2002. Google ScholarDigital Library
- D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. ALMI: An application level ulticast infrastructure. In Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems San Francisco, CA, March 2001. Google ScholarDigital Library
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 161--172, San Diego, CA, August 2001. Google ScholarDigital Library
- S. Ratnaswamy, M. Handley, R. Karp, and S. Shenker. Application-level ulticast using content-addressable networks. In Proceedings of the Third International Workshop on Networked Group Communication (NGC), pages 14--29, London, UK, November 2001. Google ScholarDigital Library
- S. Ratnaswamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), NewYork, NY, June 2002.Google ScholarCross Ref
- A. I. T. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer sysstems. In Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nove ber 2001. Google ScholarDigital Library
- S. Roy, B. Shen, V. Sundaram, and R. Kumar. Application level hand-off support for mobile media transcoding sessions. In Proceedings of 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), Miami, FL, May 2002. Google ScholarDigital Library
- L. Subramanian, I. Stoica, H. Balakrishnan, and R. Katz. OverQoS: Offering QoS using Overlays. In Proceedings of the ACM SIGCOMM First Workshop on Hot Topics in Networks (HotNets- I), Princeton, NJ, October 2002.Google Scholar
- D. A. Tran, K. A. Hua, and T. Do. ZIGZAG: An efficient peer-to-peer scheme for edia streaming. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), San Francisco, CA, April 2003.Google Scholar
- Z. Xu, M. Mahalinga, and M. Karlsson. Turning heterogeneity into an advantage in overlay routing. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), San Francisco, CA, April 2003.Google ScholarCross Ref
- Z. Xu, C. Tang, and Z. Zhang. Building topology-aware overlays using global soft-state. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS), Providence, RI, May 2003. Google ScholarDigital Library
- B. Zhang, S. Jamin, and L. Zhang. Host ulticast: A framework for delivering ulticast to end users. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), New York, NY, June 2002.Google Scholar
- B. Y. Zhao, L. Huang, S. C. Rhea, J. Stribling, A. D. Joseph, and J. D. Kubiatowicz. Tapestry: A global-scale overlay for rapid service deployment. IEEE Journal on Selected Areas in Communications 2003, to appear. Google ScholarDigital Library
- S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Proceedings of the 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video Port Jefferson, NY, June 2001. Google ScholarDigital Library
Index Terms
- RITA: receiver initiated just-in-time tree adaptation for rich media distribution
Recommendations
MULTI+: A robust and topology-aware peer-to-peer multicast service
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper, we present MULTI+, an application-level Multicast protocol for content distribution over ...
mDHT: multicast-augmented DHT architecture for high availability and immunity to churn
CCNC'09: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking ConferenceThis paper presents mDHT, a novel architectural enhancement to DHT using multicast service discovery. In mDHT, a group of host computers in a subnet participate in a DHT overlay as a single node. A query is routed from subnet to subnet until it reaches ...
Multicast algorithms in service overlay networks
Overlay routing enhances the reliability and performance of IP networks since it can bypass network congestion and transient outages by forwarding traffic through one or more intermediate overlay nodes. In this paper, two algorithms for multicast ...
Comments