Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
The C programming language
Elements of information theory
Elements of information theory
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Theoretical Computer Science
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with minimum stretch
Journal of Algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Labeling schemes for small distances in trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Short and Simple Labels for Small Distances and Other Functions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Labeling Schemes for Dynamic Tree Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact routing schemes with low stretch factor
Journal of Algorithms
Compact roundtrip routing with topology-independent node names
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Proceedings of the 1st international conference on Embedded networked sensor systems
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Distance labeling schemes for well-separated graph classes
Discrete Applied Mathematics
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Compact routing with additive stretch using distance labelings
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
The workshop on internet topology (wit) report
ACM SIGCOMM Computer Communication Review
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms
Name-independent compact routing in trees
Information Processing Letters
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Labeling schemes for weighted dynamic trees
Information and Computation
Roundtrip spanners and roundtrip routing in directed graphs
ACM Transactions on Algorithms (TALG)
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
NetComplex: a complexity metric for networked system designs
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A compact routing architecture for mobility
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Note: A note on models for graph representations
Theoretical Computer Science
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Steps toward self-aware networks
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
On randomized representations of graphs using short labels
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Predictive QoS routing to mobile sinks in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On Designing for Tussle: Future Internet in Retrospect
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
ACM Transactions on Algorithms (TALG)
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
An Optimal Labeling for Node Connectivity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Electric Routing and Concurrent Flow Cutting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Node addressing schemes for scalable and fault tolerant routing in hierarchical WSNs
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Labels, routing, and capacity: bringing theoretical networking closer to practice
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Labeling schemes for vertex connectivity
ACM Transactions on Algorithms (TALG)
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
Mobile Networks and Applications
Labeling schemes for weighted dynamic trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
New approximation algorithms for minimum cycle bases of graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Distributed relationship schemes for trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Collective additive tree spanners of homogeneously orderable graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An optimal ancestry scheme and small universal posets
Proceedings of the forty-second ACM symposium on Theory of computing
An optimal labeling scheme for workflow provenance using skeleton labels
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Compact ancestry labeling schemes for XML trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Additive spanners in nearly quadratic time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Scalable routing on flat names
Proceedings of the 6th International COnference
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
SIAM Journal on Computing
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
SIAM Journal on Computing
Fault Tolerant Spanners for General Graphs
SIAM Journal on Computing
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
S4: small state and small stretch compact routing protocol for large static wireless networks
IEEE/ACM Transactions on Networking (TON)
S4: small state and small stretch routing protocol for large wireless sensor networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Electric routing and concurrent flow cutting
Theoretical Computer Science
Simulating Routing Schemes on Large-Scale Topologies
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Improved approximation for the directed spanner problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Distance oracles for vertex-labeled graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Resilient and low stretch routing through embedding into tree metrics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Improved compact routing schemes for power-law networks
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
On approximate distance labels and routing schemes with affine stretch
DISC'11 Proceedings of the 25th international conference on Distributed computing
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Short labels by traversal and jumping
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Exact distance labelings yield additive-stretch compact routing schemes
DISC'06 Proceedings of the 20th international conference on Distributed Computing
All-pairs nearly 2-approximate shortest-paths in O(n2 polylog n) time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Collective tree 1-spanners for interval graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Max-stretch reduction for tree spanners
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
A dynamic implicit adjacency labelling scheme for line graphs
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Geometric routing without geometry
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
Compact and low delay routing labeling scheme for Unit Disk Graphs
Computational Geometry: Theory and Applications
Constructing labeling schemes through universal matrices
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the efficiency of routing in sensor networks
Journal of Parallel and Distributed Computing
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Label cover instances with large girth and the hardness of approximating basic k-spanner
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
IEEE/ACM Transactions on Networking (TON)
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved distance oracles and spanners for vertex-labeled graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Distributed k-core decomposition of dynamic graphs
Proceedings of the 2012 ACM conference on CoNEXT student workshop
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Approximation algorithms for spanner problems and Directed Steiner Forest
Information and Computation
Fault tolerant additive spanners
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
HDLBR: A name-independent compact routing scheme for power-law networks
Computer Communications
Multipath spanners via fault-tolerant spanners
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
k-Dense communities in the Internet AS-level topology graph
Computer Networks: The International Journal of Computer and Telecommunications Networking
Trap array: a unified model for scalability evaluation of geometric routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: a simple stretch 2 distance oracle
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Graph reconstruction via distance oracles
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Hi-index | 0.01 |
We describe several compact routing schemes for general weighted undirected networks. Our schemes are simple and easy to implement. The routing tables stored at the nodes of the network are all very small. The headers attached to the routed messages, including the name of the destination, are extremely short. The routing decision at each node takes constant time. Yet, the stretch of these routing schemes, i.e., the worst ratio between the cost of the path on which a packet is routed and the cost of the cheapest path from source to destination, is a small constant. Our schemes achieve a near-optimal tradeoff between the size of the routing tables used and the resulting stretch. More specifically, we obtain:A routing scheme that uses only O (n 1/2) bits of memory at each node of an n-node network that has stretch 3. The space is optimal, up to logarithmic factors, in the sense that every routing scheme with stretch n2), and every routing scheme with stretch n3/2). The headers used are only (1 + &Ogr;(1)) log2 n-bits long and each routing decision takes constant time. A variant of this scheme with [log2 n] -bit headers makes routing decisions in &Ogr;(log log n) time.Also, for every integer k 2, a general handshaking based routing scheme that uses O (n1/k) bits of memory at each node that has stretch 2k - 1. A conjecture of Erdös from 1963, settled for k = 3, 5, implies that the routing tables are of near-optimal size relative to the stretch. The handshaking is similar in spirit to a DNS lookup in TCP/IP. Headers are &Ogr;(log2 n) bits long and each routing decision takes constant time. Without handshaking, the stretch of the scheme increases to 4k — 5. One ingredient used to obtain the routing schemes mentioned above, may be of independent practical and theoretical interest:A shortest path routing scheme for trees of arbitrary degree and diameter that assigns each vertex of an n-node tree a (1 + &Ogr;(1)) log2 n-bit label. Given the label of a source node and the label of a destination it is possible to compute, in constant time, the port number of the edge from the source that heads in the direction of the destination.The general scheme for k 2 also uses a clustering technique introduced recently by the authors. The clusters obtained using this technique induce a sparse and low stretch tree cover of the network. This essentially reduces routing in general networks into routing problems in trees that could be solved using the above technique.