Design and analysis of arrangement graph-based overlay systems for information sharing

Author

Lu, Ssu-Hsuan ; Lai, Kuan-Chou ; Li, Kuan-Ching ; Chung, Yeh-Ching

Author_Institution

Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan

fYear

2011

fDate

5-9 Dec. 2011

Firstpage

668

Lastpage

672

Abstract

With the continuous innovation of advanced Internet technology, Peer-to-Peer (P2P) system emerges as an important information-sharing system for the widespread exchange of resources and information among thousands of users. In this study, we applied properties of arrangement graphs to design a newly structured overlay system, named as Arrangement Graph-based Overlay (AGO). In such an overlay, the IDs between the two adjacent nodes differ only one digit and thus, the joining and leaving processes are easy while keeping the low maintenance cost. Furthermore, the searching performance in the AGO system is efficient, adaptive and scalable. Analyses of experimental results show that the establishment of the system and the node searching could achieve better performance than those obtained in the Chord system.

Keywords

Internet; graph theory; overlay networks; peer-to-peer computing; Internet technology; P2P system; arrangement graph-based overlay systems analysis; arrangement graph-based overlay systems design; information exchange; information-sharing system; joining process; leaving process; peer-to-peer system; resources exchange; Bandwidth; Educational institutions; IP networks; Internet; Peer to peer computing; USA Councils; Weibull distribution; Peer-to-Peer; arrangement graph; overlay; overlay networks;

fLanguage

English

Publisher

ieee

Conference_Titel

GLOBECOM Workshops (GC Wkshps), 2011 IEEE

Conference_Location

Houston, TX

Print_ISBN

978-1-4673-0039-1

Electronic_ISBN

978-1-4673-0038-4

Type

conf

DOI

10.1109/GLOCOMW.2011.6162536

Filename

6162536