NDLI: Random P2P network with O(d) routing distance

Content Provider	IEEE Xplore Digital Library
Author	Shiping Chen Kaihua Rao Yuan Li Lei Zhao Tao Li Shigang Chen
Copyright Year	2008
Description	Author affiliation: Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL (Shigang Chen) \|\| Network Center, Univ. of Shanghai for Sci. & Technol., Shanghai (Shiping Chen; Kaihua Rao; Yuan Li; Lei Zhao) \|\| Sch. of Comput. & Electr. Eng., Univ. of Shanghai for Sci. & Technol., Shanghai (Tao Li)
Abstract	Most existing P2P networks route requests in O(kN1/k), O(logN), O(logN/log logN ), or O(logN/log k) hops, where N is the number of participating nodes and k is an adjustable parameter. Using the simple uniformly-random neighbor selection strategy, this paper proposes a random peer-to-peer network that is the first of its kind to resolve requests in d hops and O(d) messages with a probability of 1-c, where c is a chosen constant that can be arbitrarily small. The system combines arbitrary neighbor selection, typically used only in unstructured P2P networks, with a DHT (distributed hash table) ring. It is practically attractive due to small routing delay, which does not grow with the size of the network. The number of neighbors per node is O((-ln c)frac12dN1/d), which is within a constant factor (-ln c)frac12d from the optimal complexity O(N1/d) for any network whose routing paths are bounded by d hops.
Starting Page	191
Ending Page	196
File Size	1159189
Page Count	6
File Format	PDF
ISBN	9781424423736
DOI	10.1109/CHINACOM.2008.4685001
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-08-25
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Information science Network topology Peer to peer computing Scalability Routing Hypercubes Computer networks Space exploration Application software IP networks
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

HyperCircle: An Efficient Broadcast Protocol for Super-Peer P2P Networks

Degree-optimal deterministic routing for P2P systems

Efa: an efficient content routing algorithm in large peer-to-peer overlay networks

Research on routing method on peer-to-peer network

Distributed message routing in unstructured P2P network overlays

A Novel P2P Overlay Network Based on Cycloid and Folded Hypercube

Neighbor Definition in P2P Networks

An impact of addressing schemes on routing scalability

HP2P: A Hybrid Hierarchical P2P Network

Random P2P network with O(d) routing distance

Similar Documents

HyperCircle: An Efficient Broadcast Protocol for Super-Peer P2P Networks

Degree-optimal deterministic routing for P2P systems

Efa: an efficient content routing algorithm in large peer-to-peer overlay networks

Research on routing method on peer-to-peer network

Distributed message routing in unstructured P2P network overlays

A Novel P2P Overlay Network Based on Cycloid and Folded Hypercube

Neighbor Definition in P2P Networks

An impact of addressing schemes on routing scalability

HP2P: A Hybrid Hierarchical P2P Network

Random P2P network with O(d) routing distance