Analysis of beacon triangulation in random graphs

Simple item page
dc.contributorLoguinov, Dmitri
dc.creatorKakarlapudi, Geetha
dc.date.accessioned2005-02-17T21:01:46Z
dc.date.accessioned2017-04-07T19:49:31Z
dc.date.available2005-02-17T21:01:46Z
dc.date.available2017-04-07T19:49:31Z
dc.date.created2004-12
dc.date.issued2005-02-17
dc.description.abstractOur research focusses on the problem of finding nearby peers in the Internet. We focus on one particular approach, Beacon Triangulation that is widely used to solve the peer-finding problem. Beacon Triangulation is based on relative distances of nodes to some special nodes called beacons. The scheme gives an error when a new node that wishes to join the network has the same relative distance to two or more nodes. One of the reasons for the error is that two or more nodes have the same distance vectors. As a part of our research work, we derive the conditions to ensure the uniqueness of distance vectors in any network given the shortest path distribution of nodes in that network. We verify our analytical results for G(n, p) graphs and the Internet. We also derive other conditions under which the error in the Beacon Triangulation scheme reduces to zero. We compare the Beacon Triangulation scheme to another well-known distance estimation scheme known as Global Network Positioning (GNP).
dc.identifier.urihttp://hdl.handle.net/1969.1/1447
dc.language.isoen_US
dc.publisherTexas A&M University
dc.subjectBeacon Triangulation
dc.subjectRandom graphs
dc.subjectnetwork distance estimation
dc.titleAnalysis of beacon triangulation in random graphs
dc.typeBook
dc.typeThesis

Files

Collections

Texas A&M University at College Station