Caching routing indices in structured P2P overlays

Because of the omnipresence of node dynamic activities, large scale P2P systems built on structured overlays suffer high maintenance overhead and compromised routing performance. In this paper, we study the characteristics of P2P node dynamic behaviors and present a novel routing indices caching sch...

Full description

Saved in:
Bibliographic Details
Main Authors: Cai, H., Wang, J.
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Computer science
Geometry
High-speed networks
Large-scale systems
Modems
Peer to peer computing
Rhythm
Routing
Scalability
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Because of the omnipresence of node dynamic activities, large scale P2P systems built on structured overlays suffer high maintenance overhead and compromised routing performance. In this paper, we study the characteristics of P2P node dynamic behaviors and present a novel routing indices caching scheme, called SORIC, which solves this problem by fully exploiting the round-trip pattern in node dynamic behaviors and heterogeneity among peers in the system. SORIC selectively caches routing indices of transient departed nodes in other relatively stable and capable nodes for two purposes. First, rejoin of the cached nodes is drastically simplified to O(1) complexity, thus cutting off a large portion of system maintenance overhead. Second, caching routing indices of departed nodes minimizes the negative effects of node departures and rejoins, and thus enables the system to sustain an uninterruptedly high quality routing service.
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPP.2005.23