A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Name-independent compact routing in trees
2007
Information Processing Letters
Preserved Fulltext
Our schemes use underlying optimal name-dependent tree routing algorithms from from Thorup and Zwick, and from ...
A singlesource compact routing tradeoff scheme achieves the a stretch of 2k − 1 with the same space and header constraints. ...
A Compact Routing Tradeoff Scheme for Trees In this section we present two compact routing schemes for trees -an all-pairs scheme and also a singlesource scheme. ...
doi:10.1016/j.ipl.2007.02.015
fatcat:bwcwdi7fjzd4fimkccpvat5vhy
A space lower bound for name-independent compact routing in trees
2005
Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Given a rooted n-node tree with arbitrary positive edge weights, and arbitrarily assigned node names, what is the minimum amount of space that a single-source compact routing algorithm could use in its ...
We show that the space requirement is Ω( √ n) bits in a port model that is more general than the fixed-port model, and note that this result also applies for all-pairs routing in trees. ...
Acknowledgements The authors would like to thank Ittai Abraham, Cyril Gavoille and Dahlia Malkhi for pointing out an error in an earlier version of the paper. ...
doi:10.1145/1073970.1074005
dblp:conf/spaa/LaingR05
fatcat:bob6pd7h2ngz7lmudhtvgulspq
A SPACE LOWER BOUND FOR NAME-INDEPENDENT COMPACT ROUTING IN TREES
2007
Journal of Interconnection Networks (JOIN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Given a rooted n-node tree with arbitrary positive edge weights, and arbitrarily assigned node names, what is the minimum amount of space that a single-source compact routing algorithm could use in its ...
We show that the space requirement is Ω( √ n) bits in a port model that is more general than the fixed-port model, and note that this result also applies for all-pairs routing in trees. ...
Acknowledgements The authors would like to thank Ittai Abraham, Cyril Gavoille and Dahlia Malkhi for pointing out an error in an earlier version of the paper. ...
doi:10.1142/s0219265907002004
fatcat:itmbtyfob5gixepbg6pttktida
Compact routing with name independence
2003
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
recent work
-Bounds on maximal RT size
-Name-independent routing
Compact Routing Taxonomy
• Node naming:
-Name Independent (harder): nodes have arbitrary, fixed
names with no topological information ...
Name-Independent Compact
Routing with Stretch 5
High-level view
• Select "a few" landmark nodes. ...
: -Scheme is flat (non-hierarchical) in terms of storage, but not in terms of load (landmarks get more traffic) -After first lookup, can we take shorter route? ...
doi:10.1145/777412.777442
dblp:conf/spaa/AriasCLRT03
fatcat:xt7i4imkznbmxnafscw56gwznu
Randomized compact routing in decomposable metrics
2011
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we present both name-dependent and name-independent constant stretch compact routing schemes for bounded decomposable metrics with polylogarithmic storage requirements at each node and polylogarithmic ...
We study the compact routing problem in networks whose shortest path metrics are decomposable. ...
In the following, we build upon this idea in our labeled and name-independent routing schemes. ...
doi:10.1145/1993806.1993879
dblp:conf/podc/KonjevodRXZ11
fatcat:udogty5vvvazdcv7pdi7gqs7ia
Brief announcement
2004
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Here we are concerned with the name-independent fixedport variant of the problem for the special case of trees. Awerbuch et al. [3] introduced the name-independent compact routing model. Arias et al ...
We present compact routing tradeoff schemes for trees under the name-independent model, which achieve a stretch of 2k − 1 for single-source routing and 2 k − 1 for all-pairs routing, givenÕ(n 1/k ) space ...
doi:10.1145/1011767.1011841
dblp:conf/podc/Laing04
fatcat:q2hxi65alveclljiw5zkzzanz4
On compact routing for the internet
2007
Computer communication review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in ...
this paper that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent ...
ACKNOWLEDGEMENTS This work is supported in part by NSF CNS-0434996. ...
doi:10.1145/1273445.1273450
fatcat:umclhzou6facdf25c3pxnfrrhi
Compact routing with slack
2007
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
"color" in [ n]
Tree Routing In name-independent model, tree routing is basically no easier than general routing Table Size O Size ( 1
4/k
log 3−1/k 1
log log 1 + log n)
O(log 4 n)
Headers ...
net" to net node closest to v (name in label of v ) (≤ 6d(u, v )) Phase 3: Use a tree routing scheme to go down the tree to destination (≤ 3d(u, v )) For each x ∈ N, assign each node in N (x)) a different ...
no easier than general routing AGM '04: Name-independent, designer-port tree routing scheme on unweighted trees with additive distortion twice the depth of the tree
Tree Routing In name-independent ...
doi:10.1145/1281100.1281114
dblp:conf/podc/Dinitz07
fatcat:g4cxylxjl5dapbjcjumiapp3ji
Compact name-independent routing with minimum stretch
2004
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This is optimal in a very strong sense. It is known that no compact routing using o(n) space per node can route with stretch below 3. ...
Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a O( √ n ) space routing table at each node, and routing along paths of stretch 3, that is, at ...
The problem of devising compact routing schemes has two basic variants: labeled routing and name-independent routing. ...
doi:10.1145/1007912.1007916
dblp:conf/spaa/AbrahamGMNT04
fatcat:qoyaeeoaurds5em7e5wzivpbze
Compact name-independent routing with minimum stretch
2008
ACM Transactions on Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This is optimal in a very strong sense. It is known that no compact routing using o(n) space per node can route with stretch below 3. ...
Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a O( √ n ) space routing table at each node, and routing along paths of stretch 3, that is, at ...
The problem of devising compact routing schemes has two basic variants: labeled routing and name-independent routing. ...
doi:10.1145/1367064.1367077
fatcat:yyxl4scqsbdatjf3qskdolkwxm
Compact Routing with Name Independence
2006
SIAM Journal on Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The scheme of Awerbuch et al. in [4, 5] showed, perhaps surprisingly, that the problem of compact routing with name-independent node names was not impossible. ...
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. ...
Concluding Remarks In this paper, we have developed low-stretch schemes that decouple node names from network topology. ...
doi:10.1137/04062053
fatcat:tleut7ziajdobalzz7gvaj224i
Compact Multicast Routing
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We obtain results in several variants of the problem: labeled -in which the designer can choose polylogarithmic node names, name-independent -in which nodes have arbitrarily chosen names, dynamic -an online ...
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. ...
Conclusions We have initiated the study of distributed compact multicast routing schemes. No lower bounds are known (other than the known ones for unicast routing). ...
doi:10.1007/978-3-642-04355-0_40
fatcat:kjm25bnqi5f5xpxrj72dteoiiu
Optimal-stretch name-independent compact routing in doubling metrics
2006
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing - PODC '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of name-independent routing in doubling metrics. ...
Name-Independent Routing, Compact Routing, Doubling Metrics * TheÕ() notation denotes complexity similar to O() up to poly-logarithmic factors. ...
While in this case, (1 + ǫ)-stretch labeled compact routing is possible, as mentioned above, for the name-independent model there exist stronger lower bounds. Abraham et al. ...
doi:10.1145/1146381.1146412
dblp:conf/podc/KonjevodRX06
fatcat:g75qbwbr2rdnfpwbjhhwe3tq5e
Compact roundtrip routing with topology-independent node names
2008
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
routing in the name-dependent model. ...
Both results are for the topology-independent node-name model. ...
Lenore Cowen was supported in part by the National Science Foundation under Grant No. CCR-0208629. Kofi Laing was supported in part by NSF grant EHR-0227879. ...
doi:10.1016/j.jcss.2007.09.001
fatcat:cbmtt73q5vg63cyatup7k4wnnm
Compact roundtrip routing with topology-independent node names
2003
Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
routing in the name-dependent model. ...
Both results are for the topology-independent node-name model. ...
Lenore Cowen was supported in part by the National Science Foundation under Grant No. CCR-0208629. Kofi Laing was supported in part by NSF grant EHR-0227879. ...
doi:10.1145/872035.872042
dblp:conf/podc/AriasCL03
fatcat:edidzu433jfehiqlvp5mrpkkle
« Previous
Showing results 1 — 15 out of 27,201 results