基于P2P的VOD服务体系研究
|
摘要
在Internet上提供大规模的VoD(Video on Demand)服务是一项具有挑战性的工作。传统的视频流播放方式是基于Client／Server(C／S)集中式网络模式，面临网络带宽受限的问题，表现在媒体服务器负担过重，支持客户数目有限，节目播放效果较差。P2P技术打破了传统的C／S模式，在网络中的每个结点的地位都是对等的。每个结点既充当服务器，为其他结点提供服务，同时也享用其他结点提供的服务，很好地解决了网络带宽瓶颈问题。P2P技术以其可扩展性、高容错性、健壮性等特点已得到迅猛的发展，并逐步应用到视频技术领域。
本文提出了一种基于P2P(peer to peer)方法的VoD服务体系PeerVoD，它能够以较小的服务器代价实现大规模的VoD应用。中的每个节点均使用定长的FIFO缓存队列来保存其最近所接收到的数据，以便为后续到达的节点提供服务。它具有如下特点：1)采用分布式控制协议以支持节点的加入和离开，系统具有良好的可扩展性。通过在每个节点上维护有限个其他节点的状态信息，使得当节点加入时，能够在短时间内找到合适的父节点；而当节点上发生离开或者失效行为时，子节点能够通过其所维护的状态信息快速而准确地找到新的父节点；2)节点的失效或离开一般不涉及到服务器，从而减轻了服务器的负载；3)服务被中断的节点在进行中断恢复时，考虑了节点对目标节目接收的完整性；4)考虑了节点在网络带宽等资源方面所体现出来的异构性。
仿真实验表明：PeerVoD体系具有良好的性价比。同等条件下，与同类体系P2VOD比较，PeerVoD体系在服务器负载、节点加入时被拒绝的概率、网络资源利用率以及节目完整性等性能指标上，均优于同类体系P2VoD。
Providing video on demand service over the Internet in a scalable way is achallenging problem. The traditional play mode of video frequency is based onClient/Server (C/S) concentrated network mode, facing the problems of restrainednetwork bandwidth. For example, the overbalance of the media server stress, therestrained number of the clients, the worse playing effect of the programs. Thetechnology of P2P breaks the traditional C/S mode, each node in the net is peer topeer. Each node acts as server which provide service for other nodes, as well asregales on service which other nodes offered, which commendably resolve thebottle-neck problem of the network bandwidth. Resorts to its expansibility and highresilience to failure and haleness, the technology of P2P has developed swiftly andviolently, and gradually applies to the field of video frequency technology.
This paper proposes an architecture for video on demand streaming inpeer-to-peer environment, which is able to implement the large-scale VoDapplications with the lesser cost of server. In PeerVoD each peer node has a fixed-sizeFIFO buffer to cache the most recent content of the video stream it receives and canprovide service to subsequent reached proper peer nodes. It has the followingproperties: 1) It utilizes a distributed control protocol to support the joining andleaving processes of peer nodes in a scalable way, the system has favorableexpansibility. By maintaining the status messages of restricted other nodes, it can findthe appropriate father node when peer nodes join; when peer nodes leave or abate, thechild nodes can find the new father nodes fleetly and exactly by the status messages itmaintained. 2) The invalidation and departure of the nodes currently don't come downto the servers, so that it can alleviate the server stress. 3) It considers the issue ofintegrity of the received program in service recovering process of the interruptednodes. 4) Take into account the isomerous nature of the network bandwidth resources.
Performance studies based on simulation are carried out, the results show that thesystem architecture outperforms a recently proposed system architecture P2VoD in a number of important performance metrics such as the server's load, client joinrejection probability, network resource usage ratio, program integrity ratio and so on.
本文提出了一种基于P2P(peer to peer)方法的VoD服务体系PeerVoD，它能够以较小的服务器代价实现大规模的VoD应用。中的每个节点均使用定长的FIFO缓存队列来保存其最近所接收到的数据，以便为后续到达的节点提供服务。它具有如下特点：1)采用分布式控制协议以支持节点的加入和离开，系统具有良好的可扩展性。通过在每个节点上维护有限个其他节点的状态信息，使得当节点加入时，能够在短时间内找到合适的父节点；而当节点上发生离开或者失效行为时，子节点能够通过其所维护的状态信息快速而准确地找到新的父节点；2)节点的失效或离开一般不涉及到服务器，从而减轻了服务器的负载；3)服务被中断的节点在进行中断恢复时，考虑了节点对目标节目接收的完整性；4)考虑了节点在网络带宽等资源方面所体现出来的异构性。
仿真实验表明：PeerVoD体系具有良好的性价比。同等条件下，与同类体系P2VOD比较，PeerVoD体系在服务器负载、节点加入时被拒绝的概率、网络资源利用率以及节目完整性等性能指标上，均优于同类体系P2VoD。
Providing video on demand service over the Internet in a scalable way is achallenging problem. The traditional play mode of video frequency is based onClient/Server (C/S) concentrated network mode, facing the problems of restrainednetwork bandwidth. For example, the overbalance of the media server stress, therestrained number of the clients, the worse playing effect of the programs. Thetechnology of P2P breaks the traditional C/S mode, each node in the net is peer topeer. Each node acts as server which provide service for other nodes, as well asregales on service which other nodes offered, which commendably resolve thebottle-neck problem of the network bandwidth. Resorts to its expansibility and highresilience to failure and haleness, the technology of P2P has developed swiftly andviolently, and gradually applies to the field of video frequency technology.
This paper proposes an architecture for video on demand streaming inpeer-to-peer environment, which is able to implement the large-scale VoDapplications with the lesser cost of server. In PeerVoD each peer node has a fixed-sizeFIFO buffer to cache the most recent content of the video stream it receives and canprovide service to subsequent reached proper peer nodes. It has the followingproperties: 1) It utilizes a distributed control protocol to support the joining andleaving processes of peer nodes in a scalable way, the system has favorableexpansibility. By maintaining the status messages of restricted other nodes, it can findthe appropriate father node when peer nodes join; when peer nodes leave or abate, thechild nodes can find the new father nodes fleetly and exactly by the status messages itmaintained. 2) The invalidation and departure of the nodes currently don't come downto the servers, so that it can alleviate the server stress. 3) It considers the issue ofintegrity of the received program in service recovering process of the interruptednodes. 4) Take into account the isomerous nature of the network bandwidth resources.
Performance studies based on simulation are carried out, the results show that thesystem architecture outperforms a recently proposed system architecture P2VoD in a number of important performance metrics such as the server's load, client joinrejection probability, network resource usage ratio, program integrity ratio and so on.
引文
[1] 周继茂．视频点播技术综述[J]．有线电视技术．2004年第19期．
[2] 罗杰文．Peer to Peer(P2P)综述[DB／OL]．2005-11-3．http://blog.csdn.net/anqiongdy/archive/2006/10/13/1333568.aspx.
[3] D. Xu, M. Hefeeda, S. Hambrusch, and B. Bharava, On peer-to-peer media streaming[J], IEEE ICDCS, 2002, 2: 363-371.
[4] Lee M, Habib A, Botev B, Bhargava DB. PROMISE: A Frame of distributed video-on-demand system Based on peer-to-peer[J]. In: Proc. of the ACM Multimedia 2003. New York: ACM Press, 2003. 45-54.
[5] 白霜，范学峰．基于协作缓存的分布式VOD组播调度[J]．计算机应用研究，2005年第5期．
[6] 李翠莲，马允胜，任久春．一种基于网格的跨集群VOD系统及其仿真实现[J]．复旦学报：自然科学版．第43卷，第1期，2004年2月．
[7] 孙顺强，范学峰．基于对等网络模式的视频点播系统设计[J]．计算机应用．第24卷，第9期，2004年9月．
[8] 李纲，岑雄鹰，陈叶芳．一种基于P2P点组技术的流媒体协作计算[J]．计算机应用与软件，第23卷，第2期，2006年2月．
[9] 彭玮，谷清范，吴介．一基于主动P2P网络架构的视频点播系统设计[J]．计算机技术与发展．第16卷，第5期，2006年5月．
[10] 魏苏林，乐红兵．基于P2P模式的新型视频点播系统．微计算机信息[J]．2005年，第21卷，第3期．
[11] 易光华，傅光轩．基于对等网络的VOD模型研究．网络安全技术与应用[J]．2005年2月．
[12] Cai Y Hua KA, Vu K. Optimizing patching performance. In: Dilip D, ed. Proc. of the MMCN'99. Washington: SPIE Press, 1999. 204-216.
[13] Gao L, Towsley D. Threshold-Based multicast for continuous media delivery. IEEE Trans. on Multimedia, 2001, 3(4): 405-414.
[14] Hu A. Video-on-Demand broadcasting protocols: A comprehensive study. In: Sengupta B, ed. Proc. of the IEEE INFOCOM 2001. New York: IEEE Computer and Communications Societies, 2001. 508-517.
[15] Hua KA, Sheu S. Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems. Computer Communication Review, 1997,27(4):89-100.
[16] Deshpande H, Bawa M, Garcia-Molina H. Streaming live media over a peer-to-peer network. Technical Report, CS-2001-31, Stanford University, 2001.
[17] Rejaie R, Ortega A. PALS: Peer-to-Peer adaptive layered streaming. In: Christos P, Kevin CA, eds. Proc. of the ACM NOSSDAV 2003. New York: ACM Press, 2003. 153-161.
[18] Guo Y, Suh K, Kurose J, Towsley D. P2Cast: P2P patching scheme for VOD service. In: Proc. of the WWW 2003. New York: ACM Press, 2003. 301-309.
[19] Guo Y, Suh K, Kurose J, Towsley D. A peer-to-peer on-demand streaming service and its performance evaluation. In: Proc. of the IEEE ICME 2003. Maryland: IEEE Computer Society, 2003.649-652.
[20] Do T, Hua K, Tantaoui M. P2VOD: Providing fault tolerant video-on-demand streaming in peer-to-peer environment. In: Proc. of the IEEE ICC 2004. Paris: IEEE Communications Society, 2004. 1467-1472.
[21] B. T. Loo, R. Huebsch, I. Stoica, and J. Hellerstein. The Case for a Hyrid P2P Search Infrastructure. In IPTPS 2004.
[22] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. MakingGnutella-like P2P Systems Scalable. In Proceedings of ACM SIGCOMM 2003,Karlsruhe, Germany, August 2003.
[23] 董晓健，王银江，周强，凌力．基于对等网络的流媒体点播系统的研究与实现[J]．计算机应用与软件．2006年4月．第23卷第4期
[24] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. (Middleware 2001). November 2001.
[25] J.C. Lin and S. Paul, "A reliable multicast transport protocol," in Proc. Of IEEE INFOCOM'96, 1996, pp. 1414-1424.
[26] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM 2001 . August 2001.
[27] M. Russopoulos, and M. Baker. "CUP: Controlled Update Propagation in Peer-to-Peer Networks." USENIX 2003 Annual Technical Conference, San Antonio TX, Jun 2003.
[28] M. Naor, U. Wieder, Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds, In Proceedings of IPTPS'04, San Diego, USA, Feb 2004.
[29] I. Csisza'r, "Information Theoretic Methods in Probability and Statistics," Information Theory Soc. Rev. articles.
[30] Mudhakar S., Bugra G. and Ling L. "Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies" Proceeding of ICPADS 2004.
[31] S. Deering and D. Cheriton, "Multicast Routing in Datagram Internetworks and Extended LANs," ACM Transactions on Computer Systems, vol. 8, no. 2, May 1990.
[32] S. E. Deering, Multicast Routing in a Datagram Internetwork, Ph.D. thesis, Stanford University, Dec 1991.
[33] S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L.Wei, "The PIM Architecture for Wide-Area Multicast Routing," IEEE/ACM Transactions on Networking, vol. 4, no. 2, April 1996.
[34] J. H. Saltzer, D. P. Reed, and D. D. Clark, "End-to-end arguments in system design," ACM Transactions on Computer Systems, vol. 2, no. 4, pp. 277-288, Nov. 1984.
[35] K.P. Birman, M. Hayden, O.Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, "Bimodal multicast," ACM Transactions on Computer Systems, vol. 17, no. 2, pp. 41-88, May 1999.
[36] Patrick Eugster, Sidath Handurukande, Rachid Guerraoui, Anne-Marie Kermarrec,and Petr Kouznetsov, "Lightweight probabilistic broadcast," in Proceedings of The International Conference on Dependable Systems and Networks (DSN 2001), Gothenburg, Sweden, July 2001.
[37] Calvert K, Doar M, Zegura E. Modeling internet topology. IEEE Communication Magazine, 1997,35(6):160—163
[38] Mudhakar S., Bugra G. and Ling L. "Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies" Proceeding of ICPADS 2004.
[39] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. MakingGnutella-like P2P Systems Scalable. In Proceedings of ACM SIGCOMM 2003,Karlsruhe, Germany, August 2003.
[40] E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proc. of IEEE Infocom'96, CA, May 1996.
[41] Amin Vahdat, Ken Yocum, Kevin Walsh, Priya Mahadevan,Dejan Kostic, Jeff Chase, and David Becker. Scalability and Accuracy in a Large-Scale Network Emulator. In ACM OSDI'02, 2002.
[42] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. Annual Conference of the Special Interest Group on Data Communication (SIGCOMM 2001). August 2001.
[43] C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the ACM SPAA (Newport, Rhode Island, June 1997), pp. 311-320.
[44] J. Jannotti, D. K. Gifford, and K. L. Johnson, "Overcast: Reliable multicasting with an overlay network," in USENIX Symposium on Operating System Design and Implementation, San Diego, CA, October 2000.
[45] Shelly Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, and John Kubiatowicz, "Bayeux: An Architecture for Scalable and Faulttolerant Wide-Area Data Dissemination," in Proc. of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001), Port Jefferson, NY, June 2001.
[46] Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrecht, Amin Vahdat: Bullet: high bandwidth data dissemination using an overlay mesh. In Proceedings of the 19~(th) ACM Symposium on Operating System Principles, October 2003. 282-297.
[47] Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Animesh Nandi, Antony Rowstron, and Atul Singh. Splitstream: High-bandwidth ContentDistribution in Cooperative Environments. In Proceedings of the 19th ACM Symposium on Operating System Principles, October 2003.
[48] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE JSAC, 20(8), Oct. 2002.
[49] Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou. Resilient Peer-to-Peer Streaming. In 11th IEEE International Conference on Network Protocols (ICNP'03) November 04 - 07, 2003 Atlanta, Georgia
[50] K. Lai and M. Baker, "Nettimer: A tool for measuring bottleneck link bandwidth," in Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, Mar. 2001.
[51] S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based Congestion Control for Unicast Applications. In Proceedings of the ACM SIGCOMM, August 2000.
[52] M. Naor, U. Wieder, Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds, In Proceedings of IPTPS'04, San Diego, USA, Feb 2004.
[2] 罗杰文．Peer to Peer(P2P)综述[DB／OL]．2005-11-3．http://blog.csdn.net/anqiongdy/archive/2006/10/13/1333568.aspx.
[3] D. Xu, M. Hefeeda, S. Hambrusch, and B. Bharava, On peer-to-peer media streaming[J], IEEE ICDCS, 2002, 2: 363-371.
[4] Lee M, Habib A, Botev B, Bhargava DB. PROMISE: A Frame of distributed video-on-demand system Based on peer-to-peer[J]. In: Proc. of the ACM Multimedia 2003. New York: ACM Press, 2003. 45-54.
[5] 白霜，范学峰．基于协作缓存的分布式VOD组播调度[J]．计算机应用研究，2005年第5期．
[6] 李翠莲，马允胜，任久春．一种基于网格的跨集群VOD系统及其仿真实现[J]．复旦学报：自然科学版．第43卷，第1期，2004年2月．
[7] 孙顺强，范学峰．基于对等网络模式的视频点播系统设计[J]．计算机应用．第24卷，第9期，2004年9月．
[8] 李纲，岑雄鹰，陈叶芳．一种基于P2P点组技术的流媒体协作计算[J]．计算机应用与软件，第23卷，第2期，2006年2月．
[9] 彭玮，谷清范，吴介．一基于主动P2P网络架构的视频点播系统设计[J]．计算机技术与发展．第16卷，第5期，2006年5月．
[10] 魏苏林，乐红兵．基于P2P模式的新型视频点播系统．微计算机信息[J]．2005年，第21卷，第3期．
[11] 易光华，傅光轩．基于对等网络的VOD模型研究．网络安全技术与应用[J]．2005年2月．
[12] Cai Y Hua KA, Vu K. Optimizing patching performance. In: Dilip D, ed. Proc. of the MMCN'99. Washington: SPIE Press, 1999. 204-216.
[13] Gao L, Towsley D. Threshold-Based multicast for continuous media delivery. IEEE Trans. on Multimedia, 2001, 3(4): 405-414.
[14] Hu A. Video-on-Demand broadcasting protocols: A comprehensive study. In: Sengupta B, ed. Proc. of the IEEE INFOCOM 2001. New York: IEEE Computer and Communications Societies, 2001. 508-517.
[15] Hua KA, Sheu S. Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems. Computer Communication Review, 1997,27(4):89-100.
[16] Deshpande H, Bawa M, Garcia-Molina H. Streaming live media over a peer-to-peer network. Technical Report, CS-2001-31, Stanford University, 2001.
[17] Rejaie R, Ortega A. PALS: Peer-to-Peer adaptive layered streaming. In: Christos P, Kevin CA, eds. Proc. of the ACM NOSSDAV 2003. New York: ACM Press, 2003. 153-161.
[18] Guo Y, Suh K, Kurose J, Towsley D. P2Cast: P2P patching scheme for VOD service. In: Proc. of the WWW 2003. New York: ACM Press, 2003. 301-309.
[19] Guo Y, Suh K, Kurose J, Towsley D. A peer-to-peer on-demand streaming service and its performance evaluation. In: Proc. of the IEEE ICME 2003. Maryland: IEEE Computer Society, 2003.649-652.
[20] Do T, Hua K, Tantaoui M. P2VOD: Providing fault tolerant video-on-demand streaming in peer-to-peer environment. In: Proc. of the IEEE ICC 2004. Paris: IEEE Communications Society, 2004. 1467-1472.
[21] B. T. Loo, R. Huebsch, I. Stoica, and J. Hellerstein. The Case for a Hyrid P2P Search Infrastructure. In IPTPS 2004.
[22] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. MakingGnutella-like P2P Systems Scalable. In Proceedings of ACM SIGCOMM 2003,Karlsruhe, Germany, August 2003.
[23] 董晓健，王银江，周强，凌力．基于对等网络的流媒体点播系统的研究与实现[J]．计算机应用与软件．2006年4月．第23卷第4期
[24] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. (Middleware 2001). November 2001.
[25] J.C. Lin and S. Paul, "A reliable multicast transport protocol," in Proc. Of IEEE INFOCOM'96, 1996, pp. 1414-1424.
[26] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM 2001 . August 2001.
[27] M. Russopoulos, and M. Baker. "CUP: Controlled Update Propagation in Peer-to-Peer Networks." USENIX 2003 Annual Technical Conference, San Antonio TX, Jun 2003.
[28] M. Naor, U. Wieder, Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds, In Proceedings of IPTPS'04, San Diego, USA, Feb 2004.
[29] I. Csisza'r, "Information Theoretic Methods in Probability and Statistics," Information Theory Soc. Rev. articles.
[30] Mudhakar S., Bugra G. and Ling L. "Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies" Proceeding of ICPADS 2004.
[31] S. Deering and D. Cheriton, "Multicast Routing in Datagram Internetworks and Extended LANs," ACM Transactions on Computer Systems, vol. 8, no. 2, May 1990.
[32] S. E. Deering, Multicast Routing in a Datagram Internetwork, Ph.D. thesis, Stanford University, Dec 1991.
[33] S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L.Wei, "The PIM Architecture for Wide-Area Multicast Routing," IEEE/ACM Transactions on Networking, vol. 4, no. 2, April 1996.
[34] J. H. Saltzer, D. P. Reed, and D. D. Clark, "End-to-end arguments in system design," ACM Transactions on Computer Systems, vol. 2, no. 4, pp. 277-288, Nov. 1984.
[35] K.P. Birman, M. Hayden, O.Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, "Bimodal multicast," ACM Transactions on Computer Systems, vol. 17, no. 2, pp. 41-88, May 1999.
[36] Patrick Eugster, Sidath Handurukande, Rachid Guerraoui, Anne-Marie Kermarrec,and Petr Kouznetsov, "Lightweight probabilistic broadcast," in Proceedings of The International Conference on Dependable Systems and Networks (DSN 2001), Gothenburg, Sweden, July 2001.
[37] Calvert K, Doar M, Zegura E. Modeling internet topology. IEEE Communication Magazine, 1997,35(6):160—163
[38] Mudhakar S., Bugra G. and Ling L. "Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies" Proceeding of ICPADS 2004.
[39] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. MakingGnutella-like P2P Systems Scalable. In Proceedings of ACM SIGCOMM 2003,Karlsruhe, Germany, August 2003.
[40] E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proc. of IEEE Infocom'96, CA, May 1996.
[41] Amin Vahdat, Ken Yocum, Kevin Walsh, Priya Mahadevan,Dejan Kostic, Jeff Chase, and David Becker. Scalability and Accuracy in a Large-Scale Network Emulator. In ACM OSDI'02, 2002.
[42] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. Annual Conference of the Special Interest Group on Data Communication (SIGCOMM 2001). August 2001.
[43] C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the ACM SPAA (Newport, Rhode Island, June 1997), pp. 311-320.
[44] J. Jannotti, D. K. Gifford, and K. L. Johnson, "Overcast: Reliable multicasting with an overlay network," in USENIX Symposium on Operating System Design and Implementation, San Diego, CA, October 2000.
[45] Shelly Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, and John Kubiatowicz, "Bayeux: An Architecture for Scalable and Faulttolerant Wide-Area Data Dissemination," in Proc. of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001), Port Jefferson, NY, June 2001.
[46] Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrecht, Amin Vahdat: Bullet: high bandwidth data dissemination using an overlay mesh. In Proceedings of the 19~(th) ACM Symposium on Operating System Principles, October 2003. 282-297.
[47] Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Animesh Nandi, Antony Rowstron, and Atul Singh. Splitstream: High-bandwidth ContentDistribution in Cooperative Environments. In Proceedings of the 19th ACM Symposium on Operating System Principles, October 2003.
[48] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE JSAC, 20(8), Oct. 2002.
[49] Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou. Resilient Peer-to-Peer Streaming. In 11th IEEE International Conference on Network Protocols (ICNP'03) November 04 - 07, 2003 Atlanta, Georgia
[50] K. Lai and M. Baker, "Nettimer: A tool for measuring bottleneck link bandwidth," in Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, Mar. 2001.
[51] S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based Congestion Control for Unicast Applications. In Proceedings of the ACM SIGCOMM, August 2000.
[52] M. Naor, U. Wieder, Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds, In Proceedings of IPTPS'04, San Diego, USA, Feb 2004.