A novel state cache scheme in structured P2P systems

Hailong Cai, Jun Wang, Dong Li, Jitender S Deogun

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Current structured overlays do not identify well the rhythm in the dynamic activities, thus resulting in high maintenance overhead. In this paper, we present a new state cache system, called SCS, that solves the problem by exploiting the access patterns of dynamic activities in P2P systems. SCS partitions the whole P2P network into clusters and dynamically chooses a "super" node in each cluster to selectively record and maintain the routing information for departed nodes most likely to arrive back in the near future. The cached routing information enables SCS to simplify self-organization, reduce system maintenance overhead and provide high quality routing service. The experimental results show that SCS reduces the maintenance overhead by up to 66% while delivering much better routing performance, as compared to current structured P2P systems.

Original languageEnglish (US)
Pages (from-to)154-168
Number of pages15
JournalJournal of Parallel and Distributed Computing
Volume65
Issue number2
DOIs
StatePublished - Feb 1 2005

Fingerprint

P2P Systems
Cache
Routing
Maintenance
Large scale systems
P2P Network
Self-organization
Large-scale Systems
Vertex of a graph
Overlay
Simplify
Choose
Likely
Partition
Experimental Results

Keywords

  • Maintenance overhead
  • Peer-to-peer
  • Routing performance
  • SCS
  • State cache
  • Structured

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

A novel state cache scheme in structured P2P systems. / Cai, Hailong; Wang, Jun; Li, Dong; Deogun, Jitender S.

In: Journal of Parallel and Distributed Computing, Vol. 65, No. 2, 01.02.2005, p. 154-168.

Research output: Contribution to journalArticle

Cai, Hailong ; Wang, Jun ; Li, Dong ; Deogun, Jitender S. / A novel state cache scheme in structured P2P systems. In: Journal of Parallel and Distributed Computing. 2005 ; Vol. 65, No. 2. pp. 154-168.
@article{ccf5084f3b4e4e53a9eb045243a64cf4,
title = "A novel state cache scheme in structured P2P systems",
abstract = "Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Current structured overlays do not identify well the rhythm in the dynamic activities, thus resulting in high maintenance overhead. In this paper, we present a new state cache system, called SCS, that solves the problem by exploiting the access patterns of dynamic activities in P2P systems. SCS partitions the whole P2P network into clusters and dynamically chooses a {"}super{"} node in each cluster to selectively record and maintain the routing information for departed nodes most likely to arrive back in the near future. The cached routing information enables SCS to simplify self-organization, reduce system maintenance overhead and provide high quality routing service. The experimental results show that SCS reduces the maintenance overhead by up to 66{\%} while delivering much better routing performance, as compared to current structured P2P systems.",
keywords = "Maintenance overhead, Peer-to-peer, Routing performance, SCS, State cache, Structured",
author = "Hailong Cai and Jun Wang and Dong Li and Deogun, {Jitender S}",
year = "2005",
month = "2",
day = "1",
doi = "10.1016/j.jpdc.2004.09.005",
language = "English (US)",
volume = "65",
pages = "154--168",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - A novel state cache scheme in structured P2P systems

AU - Cai, Hailong

AU - Wang, Jun

AU - Li, Dong

AU - Deogun, Jitender S

PY - 2005/2/1

Y1 - 2005/2/1

N2 - Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Current structured overlays do not identify well the rhythm in the dynamic activities, thus resulting in high maintenance overhead. In this paper, we present a new state cache system, called SCS, that solves the problem by exploiting the access patterns of dynamic activities in P2P systems. SCS partitions the whole P2P network into clusters and dynamically chooses a "super" node in each cluster to selectively record and maintain the routing information for departed nodes most likely to arrive back in the near future. The cached routing information enables SCS to simplify self-organization, reduce system maintenance overhead and provide high quality routing service. The experimental results show that SCS reduces the maintenance overhead by up to 66% while delivering much better routing performance, as compared to current structured P2P systems.

AB - Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Current structured overlays do not identify well the rhythm in the dynamic activities, thus resulting in high maintenance overhead. In this paper, we present a new state cache system, called SCS, that solves the problem by exploiting the access patterns of dynamic activities in P2P systems. SCS partitions the whole P2P network into clusters and dynamically chooses a "super" node in each cluster to selectively record and maintain the routing information for departed nodes most likely to arrive back in the near future. The cached routing information enables SCS to simplify self-organization, reduce system maintenance overhead and provide high quality routing service. The experimental results show that SCS reduces the maintenance overhead by up to 66% while delivering much better routing performance, as compared to current structured P2P systems.

KW - Maintenance overhead

KW - Peer-to-peer

KW - Routing performance

KW - SCS

KW - State cache

KW - Structured

UR - http://www.scopus.com/inward/record.url?scp=11444262109&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11444262109&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2004.09.005

DO - 10.1016/j.jpdc.2004.09.005

M3 - Article

VL - 65

SP - 154

EP - 168

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 2

ER -