An efficient update algorithm for supporting mobility in structured P2P systems

Boxuan Gu, Hu Wang, Zongming Fei

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Structured peer to peer (P2P) systems organize a large number of nodes in well-defined structures and provide efficient and scalable search functionalities. They have been used as a basis to implement many network services and applications. As more and more computers have wireless connections and can move from one place to another, supporting mobility in the structured P2P systems becomes an important issue. In this paper, we present an algorithm called Range based Updating AlgorithM (RUAM) to efficiently support mobile nodes in structured P2P systems. RUAM allows a mobile node to actively update information stored in other nodes when it changes its address. Hence, the outdated routing information in the system can be greatly decreased. The simulation results show that RUAM is efficient in updating stale states caused by mobile nodes and greatly improves the lookup performance.

Original languageEnglish
Title of host publicationProceedings of the 2006 International Conference on Communications in Computing, CIC 2006
Pages135-141
Number of pages7
StatePublished - 2006
Event2006 International Conference on Communications in Computing, CIC 2006 - Las Vegas, NV, United States
Duration: Jun 26 2006Jun 29 2006

Publication series

NameProceedings of the 2006 International Conference on Communications in Computing, CIC 2006

Conference

Conference2006 International Conference on Communications in Computing, CIC 2006
Country/TerritoryUnited States
CityLas Vegas, NV
Period6/26/066/29/06

Keywords

  • DHT
  • Mobility
  • Overlay networks
  • Peer to peer

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'An efficient update algorithm for supporting mobility in structured P2P systems'. Together they form a unique fingerprint.

Cite this