Abstract
In this paper, we propose an efficient overlay network for P2P (peer-to-peer) content sharing by incorporating network identifier of each peer in the construction of CAN (content addressable network)-variant DHT (distributed hash table)-based overlay. The network identifier that partially reflects the locality of each peer within the global Internet can help us to aggregate distributed peers towards more structured set of virtual peers. Through myns-based simulations coupled with GT-ITM topology, the improved efficiency of the proposed overlay construction is verified. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Park, C., & Kim, J. W. (2004). Efficient overlay network for P2P content sharing based on network identifier. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3332, 373–380. https://doi.org/10.1007/978-3-540-30542-2_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
