Browse > Article

Rosary : Topology-Aware Structured P2P Overlay Network for CDN System  

Shin Soo-Young (국민대학교 비즈니스 IT학부 비즈니스 정보통신연구실)
Namgoong Jung-ll (국민대학교 비즈니스 IT학부 비즈니스 정보통신연구실)
Park Soo-Hyun (국민대학교 비즈니스 IT학부 비즈니스 정보통신연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.30, no.12B, 2005 , pp. 818-830 More about this Journal
Abstract
Recently, Peer-to-Peer (P2P) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. Content Delivery Network (CDN) is an intermediate layer of infrastructure that helps to efficiently deliver the multimedia content from content providers to clients. In this paper, We propose a topology-aware P2P overlay network for CDN, Rosary, in which CDN servers perform Intra-Pastry and Inter-Pastry routing based on a two-level structured overlay network. This proposed system extends pastry by adapting itself to CDN environments, where a semi-hashing based scheme for Intra-Pastry routing is introduced, and dynamic landmark technology is used to construct the topology-aware overlay network. Through simulations on NS-2, it is shown that Rosary is scalable, efficient, and flexible.
Keywords
CDN( Contents Delivery Network); P2P network; Pastry; Overlay network;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Bjurefors, F., Larzon, L.A., and Gold, R., 'Performance of Pastry in a heterogeneous system,' Peer-to-Peer Computing Proceed­ings, Fourth International Conference, 25-27 Aug. 2004
2 Freenet Website. http://freenet.sourceforge.net
3 Napster Website. http://www.napster.com
4 Morpheus Website. http://www.musiccity.com
5 Kazaa Website. http://www.kazaa.com
6 E. Zegura, K. Calvert, and S. Bhattacharjee, 'How to model an internetwork,' INFOCOM 96, 1996
7 A. Rowstron and P. Druschel, 'Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,' 18th IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, Nov. 2001
8 Q. He, M. Ammar, G. Riley, H. Raj, and R. Fujimoto, 'Mapping Peer Behavior to Packet-level Details: A Framework for Packet-level Simulation of Peer-to-Peer Systems', MASCOTS, 2003
9 NS-2 http://www.isi.edu/nsnam/ns
10 B. Zhao, J. Kubiatowicz, and A. Joseph, 'Tapestry: An infrastructure for fault-tolerant wide-area location and routing,' Univ. California, Berkeley, CA, TR UCB/CSD-01-­1141, Apr. 2001
11 Z. Ge, D. R. Fiegueiredo, S. Jaiswal, J. Kurose, and D. Towsley, 'Modeling peer­peer file sharing systems,' INFOCOM, 2003
12 Swart, G., 'Spreading the load using consistent hashing: a preliminary report,' Models and Tools for Parallel Computing on Heterogeneous Networks, Third Interna­tional Symposium, 5-7 July 2004
13 S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, 'A scalable content­addressable network,' ACM SIGCOMM, San Diego, CA, Aug. 2001
14 Miguel Castro, Peter Druschel, Y. Charlie Hu and Antony Rowstron, 'Topology-Aware Routing in Structured peer-to-peer overlay networks,' Microsoft Research Technical Report MSR-TR-2002-82
15 GT-ITM http://www.cc.gatech.edu/projects/gtitm
16 Gnutella Website. http://gnutella.wego.com
17 I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, 'Chord: A scalable peer-to-peer lookup service for in­ternet applications,' ACM SIGCOMM, San Diego, CA, Aug. 2001