2013
DOI: 10.1007/978-3-642-41527-2_29
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. We present a distributed asynchronous algorithm that, for every undirected weighted n-node graph G, constructs name-independent routing tables for G. The size of each table isÕ( √ n ), whereas the length of any route is stretched by a factor of at most 7 w.r.t. the shortest path. At any step, the memory space of each node isÕ( √ n ). The algorithm terminates in time O(D), where D is the hop-diameter of G. In synchronous scenarios and with uniform weights, it consumes O(m √ n + n 3/2 min {D, √ n }) me… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
2
2
1

Relationship

3
2

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 30 publications
0
11
0
Order By: Relevance
“…2 In the Internet, an autonomous system is a single network or a group of networks that is managed and supervised by a single administrative entity or organization. 3 The power-law component of the Internet seems to be decreasing while the assortativity (likelihood of nodes with the same degree being connected) is increasing. 4 The process of finding/selecting paths between given nodes of a communication network.…”
Section: Routing Design Problemmentioning
confidence: 99%
See 3 more Smart Citations
“…2 In the Internet, an autonomous system is a single network or a group of networks that is managed and supervised by a single administrative entity or organization. 3 The power-law component of the Internet seems to be decreasing while the assortativity (likelihood of nodes with the same degree being connected) is increasing. 4 The process of finding/selecting paths between given nodes of a communication network.…”
Section: Routing Design Problemmentioning
confidence: 99%
“…In [3], another distributed unicast compact routing scheme, DCR, based on the centralized scheme AGMaNT (ref. [4] in [3]), was proposed.…”
Section: Distributed Compact Routing (Dcr)mentioning
confidence: 99%
See 2 more Smart Citations
“…In compact routing schemes [AGM + 08,GGHI13], only some shortest-path trees completely spanning the connected components are built and need to be maintained. Given a set of roots r 1 , r 2 , .…”
Section: Introductionmentioning
confidence: 99%