NDLI: Eclecticism shrinks even small worlds (2006).

Please wait, while we are loading the content...

Eclecticism shrinks even small worlds (2006).

Content Provider	CiteSeerX
Author	Fraigniaud, Pierre Gavoille, Cyril Paul, Christophe
Abstract	We consider small world graphs as defined by Kleinberg (2000), i.e., graphs obtained from a d-dimensional mesh by adding links chosen at random accordingtothed-harmonic distribution. In these graphs, greedy routing performs in O(log 2 n) expected number of steps. We introduce indirect-greedy routing. We show that giving O(log 2 n) bits of topological awareness per node enables indirect-greedy routing to perform in O(log 1+1/d n) expected number of steps in d-dimensional augmented meshes. We also show that, independently of the amount of topological awareness given to the nodes, indirectgreedy routing performs in �(log 1+1/d n) expected number of steps. In particular, augmenting the topological awareness above this optimum of O(log 2 n) bits would drastically decrease the performance of indirect-greedy routing. Our model demonstrates that the efficiency of indirectgreedy routing is sensitive to the “world’s dimension, ” in the sense that high dimensional worlds enjoy faster greedy routing than low dimensional ones. This could not be observed in Kleinberg’s routing. In addition to bringing new light to Milgram’s experiment, our protocol presents several desirable properties. In particular, it is totally oblivious, i.e., there is no header modification along the path from the source to the target, and the routing decision depends only on the target, and on information stored locally at each node.
File Format	PDF
Publisher Date	2006-01-01
Access Restriction	Open
Subject Keyword	Topological Awareness S00446-005-0137-4 Special Issue Podc Indirect-greedy Routing Indirectgreedy Routing New Light D-dimensional Mesh Small World Graph D-dimensional Augmented Mesh Header Modification Milgram Experiment World Dimension Several Desirable Property High Dimensional World Low Dimensional One Random Accordingtothed-harmonic Distribution
Content Type	Text

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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