NDLI: Cyclic routing: Generalizing look-ahead in peer-to-peer networks

Content Provider	IEEE Xplore Digital Library
Author	Korzun, D. Nechaev, B. Gurtov, A.
Copyright Year	2009
Description	Author affiliation: Helsinki Institute for Information Technology (HIIT), P.O. Box 9800, FIN-02015 TKK, Finland (Nechaev, B.; Gurtov, A.) \|\| Department of Computer Science, Petrozavodsk State University (PetrSU), Republic of Karelia, Russia (Korzun, D.)
Abstract	Distributed Hash Tables (DHT) provide a lookup service in peer-to-peer overlay networks. Many valuable applications have been recently built on top of several available DHTs. However, they function poorly when no direct IP connectivity is available to some nodes (e.g., located behind a NAT or firewall) or in the presence of overloaded or malicious nodes. In this paper, we propose a new method for DHT-based routing called cyclic routing. It generalizes existing single-hop look-ahead approach (also known as “Know thy neighbor's neighbor”) and supports multipath routing. The method provides a systematic way for collecting stable and efficient overlay paths. Cyclic routing has the same theoretical dependability and efficiency upper bounds as basic DHT routing but it is more resilient when IP connectivity is limited or when the overlay suffers from overloaded nodes.
Starting Page	697
Ending Page	704
File Size	408057
Page Count	8
File Format	PDF
ISBN	9781424438075
DOI	10.1109/AICCSA.2009.5069403
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-05-10
Publisher Place	Morocco
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Peer to peer computing Intrusion detection Chromium Network address translation Upper bound Proposals Computer science Information technology Mobile communication Lookup availability Distributed hash tables Peer-to-Peer routing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On Routing in Distributed Hash Tables

Congestion Control for Distributed Hash Tables

Cyclic routing: generalizing look-ahead in peer-to-peer networks.

Performance analysis of look strategies of DHT in NATed environment

Towards Scalable Mobility in Distributed Hash Tables

Mobile Ad Hoc Networks: The DHT paradigm

Reconfiguration of Chord Ring Based on Communication Delay for Lookup Performance Improvement

A Framework for supporting consistent lookup in Distributed Hash Table

An adaptive stabilization framework for distributed hash tables

Cyclic routing: Generalizing look-ahead in peer-to-peer networks

Similar Documents

On Routing in Distributed Hash Tables

Congestion Control for Distributed Hash Tables

Cyclic routing: generalizing look-ahead in peer-to-peer networks.

Performance analysis of look strategies of DHT in NATed environment

Towards Scalable Mobility in Distributed Hash Tables

Mobile Ad Hoc Networks: The DHT paradigm

Reconfiguration of Chord Ring Based on Communication Delay for Lookup Performance Improvement

A Framework for supporting consistent lookup in Distributed Hash Table

An adaptive stabilization framework for distributed hash tables

Cyclic routing: Generalizing look-ahead in peer-to-peer networks