Title :
RASTER: a light-weight routing protocol to discover shortest overlay routes in randomized DHT systems
Author :
Wang, Chih-Chiang ; Harfoush, Khaled
Author_Institution :
Dept. of Comput. Sci., North Carolina State Univ.
Abstract :
In this paper, we propose a novel routing protocol, RASTER, that approximates shortest overlay routes between nodes in randomized DHTs. Unlike previously proposed routing protocols, RASTER encodes and aggregates routing information. Its simple bitmap-encoding scheme together with the proposed RASTER routing algorithm enable a performance edge over current overlay routing protocols. RASTER provides a forwarding overhead of merely a small constant number of bitwise operations, a routing performance close to optimal, and a better resilience to churn. RASTER also provides nodes with the flexibility to adjust the size of the maintained routing information based on their storage/processing capabilities. The cost of storing and exchanging encoded routing information is manageable and grows logarithmically with the number of nodes in the system
Keywords :
routing protocols; bitmap-encoding; light-weight routing protocol; randomized DHT systems; shortest overlay route discovery; Aggregates; Computer science; Costs; Degradation; Delay; Electronic mail; Information management; Resilience; Routing protocols; Web and internet services;
Conference_Titel :
Parallel and Distributed Systems, 2006. ICPADS 2006. 12th International Conference on
Conference_Location :
Minneapolis, MN
Print_ISBN :
0-7695-2612-8
DOI :
10.1109/ICPADS.2006.88
