Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Peleg (2000)
Informative labeling schemes for graphsTheor. Comput. Sci., 340
L. Narayanan, S. Shende (1996)
Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes
J. Soares (1992)
Graph spanners
P. Bose, Pat Morin (2004)
Competitive Online Routing in Geometric GraphsTheor. Comput. Sci., 324
E. Kranakis, D. Krizanc, S. Ravi (1996)
On Multi-Label Linear Interval Routing SchemesComput. J., 39
(2001)
Parent and ancestor queries using a compact index
S. Mullender, P. Vitányi (1988)
Distributed match-makingAlgorithmica, 3
Y. Hassin, D. Peleg (2000)
Sparse communication networks and efficient routing in the plane (extended abstract)
P. Fraigniaud, C. Gavoille (1995)
Memory requirement for universal routing schemes
B. Awerbuch, D. Peleg (1992)
Routing with Polynomial Communication-Space Trade-OffSIAM J. Discret. Math., 5
D. Peleg (1999)
Proximity-Preserving Labeling Schemes and Their Applications
L. Cowen, Christopher Wagner (2004)
Compact roundtrip routing in directed networksJ. Algorithms, 50
Y. Hassin, D. Peleg (2001)
Sparse communication networks and efficient routing in the planeDistributed Computing, 14
Amos Korman, D. Peleg, Yoav Rodeh (2002)
Labeling Schemes for Dynamic Tree NetworksTheory of Computing Systems, 37
M. Flammini, G. Gambosi, U. Nanni, R. Tan (1998)
Multidimensional Interval Routing SchemesTheor. Comput. Sci., 205
T. Ottmann, A. Rosenberg, L. Stockmeyer (1982)
A Dictionary Machine (for VLSI)IEEE Transactions on Computers, C-31
N. Santoro, Ramez Khatib (1985)
Labelling and Implicit Routing in NetworksComput. J., 28
W. Weihl (1984)
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
D. Peleg, E. Upfal (1989)
A trade-off between space and efficiency for routing tablesJ. ACM, 36
N. Lynch, Michael Merritt (1986)
Introduction to the Theory of Nested TransactionsTheor. Comput. Sci., 62
L. Cowen (1999)
Compact routing with minimum stretchJ. Algorithms, 38
E. Cohen, E. Halperin, Haim Kaplan, Uri Zwick (2002)
Reachability and distance queries via 2-hop labels
C. Gavoille, S. Pérennes (1996)
Memory requirement for routing in distributed networks
E. Bakker, J. Leeuwen, R. Tan (1993)
Prefix Routing Schemes in Dynamic NetworksComput. Networks ISDN Syst., 26
Y. Afek, E. Gafni, Moty Ricklin (1989)
Upper and lower bounds for routing schemes in dynamic networks30th Annual Symposium on Foundations of Computer Science
M. Thorup (2001)
Compact oracles for reachability and approximate distances in planar digraphsProceedings 2001 IEEE International Conference on Cluster Computing
M. Herlihy (1984)
REPLICATION METHODS FOR ABSTRACT DATA TYPES
D. Peleg (1987)
Distributed Computing: A Locality-Sensitive Approach
H. Bodlaender (1998)
A Partial k-Arboretum of Graphs with Bounded TreewidthTheor. Comput. Sci., 209
G. Frederickson, Ravi Janardan (1990)
Space-Efficient Message Routing in c-Decomposable NetworksSIAM J. Comput., 19
J. Chang, O. Ibarra, M. Chung, K. Rao (1988)
Systolic Tree Implementation of Data Structures
C. Gavoille, N. Hanusse (1999)
Compact Routing Tables for Graphs of Bounded Genus
L. Kleinrock, F. Kamoun (1977)
Hierarchical Routing for Large Networks; Performance Evaluation and OptimizationComput. Networks, 1
G. Frederickson (1993)
Searching among intervals and compact routing tablesAlgorithmica, 15
C. Ellis (1980)
Concurrent search and insertion in 2–3 treesActa Informatica, 14
S. Basagni, I. Chlamtac, V. Syrotiuk, Barry Woodward (1998)
A distance routing effect algorithm for mobility (DREAM)
P. Torre, L. Narayanan, D. Peleg (1998)
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper)
C. Ellis (1985)
Distributed data structures: A case studyIEEE Transactions on Computers, C-34
C. Gavoille, D. Peleg, S. Pérennes, R. Raz (2004)
Distance labeling in graphsJ. Algorithms, 53
G. Frederickson, Ravi Janardan (1986)
Separator-based strategies for efficient message routing27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
C. Gavoille, Michal Katz, Nir Katz, C. Paul, D. Peleg (2001)
Approximate Distance Labeling Schemes
U. Manber (1984)
On maintaining dynamic information in a concurrent environmentSIAM J. Comput., 15
M. Flammini (1997)
On the Hardness of Devising Interval Routing SchemesParallel Process. Lett., 7
B. Courcelle, R. Vanicat (2003)
Query efficient implementation of graphs of bounded clique-widthDiscret. Appl. Math., 131
S. Dolev, E. Kranakis, D. Krizanc, D. Peleg (1995)
Bubbles: adaptive routing scheme for high-speed dynamic networks
B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg (1989)
Compact distributed data structures for adaptive routing
P. Fraigniaud, C. Gavoille, B. Mans (2001)
Interval routing schemes allow broadcasting with linear message-complexityDistributed Computing, 14
T. Eilam, C. Gavoille, D. Peleg (1998)
Compact routing schemes with low stretch factor (extended abstract)
C. Gavoille, D. Peleg (1998)
The Compactness of Interval Routing for Almost All Graphs
L. Narayanan, N. Nishimura (1998)
Interval Routing on k-TreesJ. Algorithms, 26
C. Leiserson (1979)
Systolic Priority Queues
M. Flammini, J. Leeuwen, A. Marchetti-Spaccamela (1995)
The Complexity of Interval Routing on Random GraphsComput. J., 41
C. Ellis (1980)
Concurrent Search and Insertion in AVL TreesIEEE Transactions on Computers, C-29
Rao Nageshwara, Vipin Kumar (1988)
Concurrent insertions and deletions in a priority queue, 3
D. Harel, R. Tarjan (1984)
Fast Algorithms for Finding Nearest Common AncestorsSIAM J. Comput., 13
S. Pramanik, Myoung-Ho Kim (1987)
HCB-Tree: A B-Tree Structure for Parallel Processing
R. Bayer, M. Schkolnick (1994)
Concurrency of operations on B-treesActa Informatica, 9
Alan Schwartz, M. Loui (1987)
Dictionary Machines on Cube-Class NetworksIEEE Transactions on Computers, C-36
(2001)
Compact and Localized Distributed Data Structures
C. Gavoille, C. Paul (2001)
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary GraphsElectron. Notes Discret. Math., 10
J. Leeuwen, R. Tan (1994)
Compact Routing Methods: A Survey
Sudhanshu Aggarwal, S. Kutten (1993)
Time Optimal Self-Stabilizing Spanning Tree Algorithms
S. Rajsbaum, J. Urrutia (2011)
Some problems in distributed computational geometryTheor. Comput. Sci., 412
Stephen Alstrup, C. Gavoille, Haim Kaplan, Theis Rauhe (2002)
Nearest common ancestors: a survey and a new distributed algorithm
H. Kung, P. Lehman (1980)
Concurrent manipulation of binary search treesACM Trans. Database Syst., 5
Rastislav Kralovic, P. Ruzicka, Daniel Stefankovic (1997)
The Complexity of Shortest Path and Dilation Bounded Interval Routing
B. Courcelle, S. Olariu (2000)
Upper bounds to the clique width of graphsDiscret. Appl. Math., 101
Michal Katz, Nir Katz, Amos Korman, D. Peleg (2002)
Labeling schemes for flow and connectivity
A. Brandstädt, V. Le, J. Spinrad (1987)
Graph Classes: A Survey
M. Thorup, Uri Zwick (2001)
Approximate distance oracles
D. Peleg, E. Upfal (1988)
A tradeoff between space and efficiency for routing tables
Haim Kaplan, T. Milo, Ronen Shabo (2002)
A comparison of labeling schemes for ancestor queries
Haim Kaplan, T. Milo (2001)
Short and Simple Labels for Small Distances and Other Functions
G. Frederickson, Ravi Janardan (1988)
Designing networks with compact routing tablesAlgorithmica, 3
M. Flammini, G. Gambosi, Sandro Salomone (1995)
Interval routing schemesAlgorithmica, 16
S. Abiteboul, Haim Kaplan, T. Milo (2001)
Compact labeling schemes for ancestor queries
M. Flammini, G. Gambosi (1995)
On Devising Boolean Routing Schemes
T. Eilam, C. Gavoille, D. Peleg (2003)
Compact routing schemes with low stretch factorJ. Algorithms, 46
L. Kleinrock, F. Kamoun (1980)
Optimal clustering structures for hierarchical topological design of large computer networksNetworks, 10
(1989)
Decentralized ordering of contending nodes in a distributed system
F. Dehne, N. Santoro (1987)
Optimal VLSI Dictionary Machines on Meshes
H. Schmeck, Heiko Schröder (1985)
Dictionary Machines for Different Models of VLSIIEEE Transactions on Computers, C-34
H. Buhrman, J. Hoepman, P. Vitányi (1999)
Space-efficient Routing Tables for Almost All Networks and the Incompressibility MethodSIAM J. Comput., 28
A. Omondi, J. Brock (1987)
Implemnting a Dictionary on Hypercube Machines
L. Narayanan, J. Opatrny (1997)
Compact Routing on Chordal Rings
T. Eilam, S. Moran, S. Zaks (2002)
The complexity of the characterization of networks supporting shortest-path interval routingTheor. Comput. Sci., 289
T. Bilski (1992)
Embedding graphs in books: a survey, 139
W. Dally, C. Seitz (1985)
The Balanced Cube: A Concurrent Data Structure
D. Oppen, Y. Dalal (1983)
The clearinghouse: a decentralized agent for locating named objects in a distributed environmentACM Trans. Inf. Syst., 1
K. Lantz, Judy Edighoffer, B. Hitson (1985)
Towards a universal directory service
P. Bose, Pat Morin (1999)
Online Routing in TriangulationsSIAM J. Comput., 33
Stephen Alstrup, Theis Rauhe (2002)
Improved labeling scheme for ancestor queries
P. Ruzicka, Daniel Stefankovic (2000)
On the complexity of multi-dimensional interval routing schemesTheor. Comput. Sci., 245
J. Leeuwen, R. Tan (1987)
Interval RoutingComput. J., 30
C. Papadimitriou (1986)
The Theory of Database Concurrency Control
M. Breuer, J. Folkman (1967)
An unexpected result in coding the vertices of a graphJournal of Mathematical Analysis and Applications, 20
P. Fraigniaud, C. Gavoille (2002)
A Space Lower Bound for Routing in Trees
C. Gavoille (2000)
A survey on interval routingTheor. Comput. Sci., 245
M. Breuer (1966)
Coding the vertexes of a graphIEEE Trans. Inf. Theory, 12
Michal Katz, Nir Katz, D. Peleg (2000)
Distance labeling schemes for well-separated graph classes
C. Gavoille (2001)
Routing in distributed networks: overview and open problemsSIGACT News, 32
G. Frederickson, Ravi Janardan (1989)
Efficient Message Routing in Planar NetworksSIAM J. Comput., 18
(1982)
Addressing problems in multinetwork systems
T. Eilam, S. Moran, S. Zaks (1999)
Lower bounds for linear interval routingNetworks, 34
R. Tarjan (1972)
Depth-First Search and Linear Graph AlgorithmsSIAM J. Comput., 1
D. Reed (1978)
Naming and synchronization in a decentralized computer system
D. Terry (1987)
Caching Hints in Distributed SystemsIEEE Transactions on Software Engineering, SE-13
R. Perlman (1985)
Hierarchical Networks and the Subnetwork Partition ProblemComput. Networks, 9
J. Leeuwen, R. Tan (1983)
Routing with compact routing tables
E. Kranakis, Harvinder Singh, J. Urrutia (1999)
Compass routing on geometric networks
M. Herlihy (1987)
Concurrency versus availability: atomicity mechanisms for replicated dataACM Trans. Comput. Syst., 5
Sampath Kannan, M. Naor, S. Rudich (1992)
Implicit representation of graphs
T. Eilam, S. Moran, S. Zaks (1997)
A Simple DFS-Based Algorithm for Linear Interval Routing
C. Gavoille, M. Gengler (2001)
Space-Efficiency for Routing Schemes of Stretch Factor ThreeJ. Parallel Distributed Comput., 61
L. Cowen, Christopher Wagner (2000)
Compact roundtrip routing in directed networks (extended abstract)
P. Boas (1975)
Preserving order in a forest in less than logarithmic time16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
E. Kranakis, D. Krizanc (1996)
Lower Bounds for Compact Routing (Extended Abstract)
B. Schieber, U. Vishkin (1988)
On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM J. Comput., 17
S. Tse, F. Lau (1997)
A lower bound for interval routing in general networksNetworks, 29
P. Fraigniaud, C. Gavoille (1997)
Universal routing schemesDistributed Computing, 10
J. Biswas, J. Browne (1987)
Simultaneous Update of Priority Structures
C. Papadimitriou (1986)
The theory of concurrency control
N. Carriero, D. Gelernter, Jerrold Leichter (1986)
Distributed data structures in Linda
Ariel Frank, L. Wittie, A. Bernstein (1985)
Maintaining Weakly-Consistent Replicated Data on Dynamic Groups of Computers
C. Gavoille, Eric Guévremont (1998)
Worst Case Bounds for Shortest Path Interval RoutingJ. Algorithms, 27
U. Manber, R. Ladner (1984)
Concurrency control in a dynamic search structureACM Trans. Database Syst., 9
This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.
Distributed Computing – Springer Journals
Published: Sep 1, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.