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


Vol. 30,  No. 12, pp. 818-830, Dec.  2005


PDF
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Shin, J. Namgoong, S. Park, "Rosary : Topology-Aware Structured P2P Overlay Network for CDN System," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 12, pp. 818-830, 2005. DOI: .

[ACM Style]

Soo-Young Shin, Jung-Il Namgoong, and Soo-Hyun Park. 2005. Rosary : Topology-Aware Structured P2P Overlay Network for CDN System. The Journal of Korean Institute of Communications and Information Sciences, 30, 12, (2005), 818-830. DOI: .

[KICS Style]

Soo-Young Shin, Jung-Il Namgoong, Soo-Hyun Park, "Rosary : Topology-Aware Structured P2P Overlay Network for CDN System," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 12, pp. 818-830, 12. 2005.