An efficient update algorithm for supporting mobility in structured P2P systems

Boxuan Gu, Hu Wang, Zongming Fei

Producción científica: Conference contributionrevisión exhaustiva

Resumen

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.

Idioma originalEnglish
Título de la publicación alojadaProceedings of the 2006 International Conference on Communications in Computing, CIC 2006
Páginas135-141
Número de páginas7
EstadoPublished - 2006
Evento2006 International Conference on Communications in Computing, CIC 2006 - Las Vegas, NV, United States
Duración: jun 26 2006jun 29 2006

Serie de la publicación

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

Conference

Conference2006 International Conference on Communications in Computing, CIC 2006
País/TerritorioUnited States
CiudadLas Vegas, NV
Período6/26/066/29/06

ASJC Scopus subject areas

  • Computer Networks and Communications

Huella

Profundice en los temas de investigación de 'An efficient update algorithm for supporting mobility in structured P2P systems'. En conjunto forman una huella única.

Citar esto