Compact and localized distributed data structures

Distributed Computing

Volumn 16, Issue 2-3, 2003, Pages 111-120

  Gavoille, Cyril ^a   Peleg, David ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Compact routing tables; Distance labeling; Informative labeling schemes

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; COMPUTER PROGRAMMING LANGUAGES; DATA HANDLING; DATA STRUCTURES; GRAPH THEORY; XML;

DISTANCE LABELING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0141519354     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0073-5     Document Type: Conference Paper

References (126)

1. th ACM Symp. on Discrete Algorithms, 2001 pp. 547-556
2. th IEEE Symp. on Foundations of Computer Science, 1989 pp. 370-375
3. th Conf. on the Foundations of Software Technology and Theoretical Computer Science, 1993 pp. 400-410
4. th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), ACM Press, 2002, pp. 258-264
5. th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 2002 pp. 947-953
6. st ACM Symp. on Theory of Computing, 1989 pp. 230-240
7. [AP92] B. Awerbuch, D. Peleg. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Math. 5: 151-162 (1992)
8. [BCSW98] S. Basagni, I. Chlamtac, V.R. Syrotiuk, B.A. Woodward. A distance routing effect algorithm for mobility (dream). In Proc. MOBICOM, 1998 pp. 76-84
9. [BS79] R. Bayer, M. Schkolnick. Concurrency of operations on B-trees. Acta Informatica 9: 1-21, 1979
10. [BHG86] P. Bernstein, V. Hadzilacos, N. Goodman. Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley 1986
11. [BB87] J. Biswas, J.C. Browne. Simultaneous update of priority structures. In Proc. IEEE Int. Conf. on Parallel Process, 1987 pp. 124-131
12. [BLS99] A. Brandstädt, V.B. Le, J.P. Spinrad. Graph Classes A survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999
13. [BLT90] E.M. Bakker, J. van Leeuwen, R.B. Tan. Prefix routing schemes in dynamics networks. Technical Report RUU-CS-90-10, Utrecht University, Mar. 1990
14. [B92] T. Bilski. Embedding graphs in books: a survey. IEEE Proceedings 139: 134-138, 1992
15. th Int. Symp. on Algorithms and Computation, pp. 113-122, SVLNCS 1741, 1999
16. th Colloq. on Structural Information & Communication Complexity, pp. 35-44, Carleton University Press, Jun. 2001
17. [Bod98] H.L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(1-2): 1-45, 1998
18. [Bre66] M.A. Breuer. Coding the vertexes of a graph. IEEE Trans. on Information Theory IT-12:148-153, 1966
19. [BF67] M.A. Breuer, J. Folkman. An unexpected result on coding the vertices of a graph. Journal of Mathematical Analysis and Applications 20: 583-600, 1967
20. [BHV99] H. Buhrman, J.-H. Hoepman, P. Vitányi. Spaceefficient routing tables for almost all networks and the incompressibility method. SIAM Journal on Computing, 28(4): 1414-1432, 1999
21. th ACM Symp. on Principles of Prog. Lang, 1986 pp. 236-242
22. [CCIR86] J.H. Chang, M.J. Chung, O.H. Ibarra, K.K. Rao. Systolic tree implementation of data structures. In Proc. IEEE Int. Conf. on Parallel Process., 1986 pp. 669-671
23. th ACM-SIAM Symp. on Discrete Algorithms, Jan. 2002
24. [CO02] B. Courcelle, S. Olariu. Upper bounds to the clique-width of graphs. Discrete Applied Mathematics 101: 77-114, 2000
25. [Cow01] L.J. Cowen. Compact routing with minimum stretch. Journal of Algorithms 38: 170-183, 2001
26. th ACM Symp. on Principles of Distributed Computing, 2000 pp. 51-59
27. [CV01] B. Courcelle, R. Vanicat. Query efficient implementation of graphs of bounded clique width. Discrete Applied Mathematics, to appear
28. [DS85] W.J. Dally, C.L. Seitz. The balanced cube: a concurrent data structure. Technical Report 5174:TR:85, California Institute of Technology, 1985
29. [DS87] F. Dehne, N. Santoro. Optimal VLSI dictionary machines on meshes. In Proc. IEEE Int. Conf. on Parallel Process, 1987 pp. 832-840
30. [DKKP95] S. Dolev, E. Kranakis, D. Krizanc, D. Peleg. Bubbles: adaptive routing scheme for high-speed dynamic networks. SIAM Journal on Computing, 29: 804-833, 1999. Preliminary version appeared in STOC 1995
31. th Annual ACM Symp. on Principles of Distributed Computing, 1998 pp. 11-20
32. th Int. Colloq. on Structural Information & Communication Complexity, pages 99-111. Carleton Scientific 1997
33. th Int. Workshop on Distributed Algorithms, vol. 1320 of LNCS, pp. 37-51, Berlin Heidelberg New York: Springer 1997
34. [EMZ99] T. Eilam, S. Moran, S. Zaks. Lower bounds for linear interval routing. Networks 34(1): 37-46, 1999
35. [E180] C.S. Ellis. Concurrent search and insertion in 2-3 trees. Acta Informatica 14: 63-86, 1980
36. [E180b] C.S. Ellis. Concurrent search and insertion in AVL trees. IEEE Trans. on Computers C-29:811-817, 1980
37. [E185] C.S. Ellis. Distributed data structures, a case study. IEEE Trans. on Computers C-34: 1178-1185, 1985
38. [Fla97] M. Flammini. On the hardness of devising interval routing schemes. Parallel Processing Letters 7(1): 39-47, 1997
39. [FGS96] M. Flammini, G. Gambosi, S. Salomone, Intervalrouting schemes. Algorithmica 16(6): 549-568, 1996
40. [FG97a] M. Flammini, G. Gambosi. On devising boolean routing schemes. Theoretical Computer Science 186:171-198, 1997
41. [FGNT98] M. Flammini, G. Gambosi, U. Nanni, R.B. Tan. Multidimensional interval routing schemes. Theoretical Computer Science 205: 115-133, 1998
42. [FvLS98] M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela. The complexity of interval routing on random graphs. The Computer Journal 41(1): 16-25, 1998
43. [FG95] P. Fraigniaud, C. Gavoille. Memory requirement for universal routing schemes. In Proc. 14 ACM Symp. on Principles of Distributed Computing, 1995 pp. 223-230
44. [FG97b] P. Fraigniaud, C. Gavoille. Universal routing schemes. Journal of Distributed Computing 10: 65-78, 1997
45. [FG98] P. Fraigniaud, C. Gavoille. Interval routing schemes. Algorithmica 21: 155-182, 1998
46. th Int. Colloq. on Automata, Languages & Prog., vol. 2076 of LNCS, 2001 pp. 757-772
47. th Symp. on Theoretical Aspects of Computer Science, Mar. 2002
48. [FGM01] P. Fraigniaud, C. Gavoille, B. Mans. Interval routing schemes allow broadcasting with linear message-complexity. Distributed Computing 14: 217-229, 2001
49. [FWB85] A.J. Frank, L.D. Wittie, A.J. Bernstein. Maintaining weakly-consistent replicated data on dynamic groups of computers. In Proc. IEEE Int. Conf. on Parallel Process., 1985 pp. 155-162
50. th Int. Colloq. on Automata, Languages & Prog., vol. 700 of LNCS, pp. 28-39. Berlin Heidelberg New York: Springer 1993
51. th IEEE Symp. on Foundations of Computer Science, 1986 pp. 428-437
52. [FJ88] G.N. Frederickson, R. Janardan. Designing networks with compact routing tables. Algorithmica 3: 171-190, 1988
53. [FJ89] G.N. Frederickson, R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing 18: 843-857, 1989
54. [FJ90] G.N. Frederickson, R. Janardan. Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing 19: 164-181, 1990
55. [Gav00] C. Gavoille. A survey on interval routing schemes. Theoretical Computer Science 245(2): 217-253, 2000
56. [Gav01] C. Gavoille. Routing in distributed networks: overview and open problems. ACM SIGACT News - Distributed Computing Column 32(1): 36-52, 2001
57. [GG98] C. Gavoille, E. Guévremont. Worst case bounds for shortest path interval routing. Journal of Algorithms 27: 1-25, 1998
58. [GG01] C. Gavoille, M. Gengler. Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing 61: 679-687, 2001
59. th Int. Colloq. on Automata, Languages and Programming, vol. 1644 of LNCS, 1999 pp. 351-360
60. th European Symp. on Algorithms, Aug. 2001
61. th ACM Symp. on Principles of Distributed Computing, 1996 pp. 125-133
62. [GP01a] C. Gavoille, C. Paul. Split decomposition and distance labelling: an optimal scheme for distance hereditary graphs. In Proc. Euro. Conf. on Combinatorics, Graph Theory and Applications, Sep. 2001
63. [GP01] C. Gavoille, D. Peleg. The compactness of interval routing for almost all graphs. SIAM Journal on Computing 31(3): 706-721, 2001
64. th ACM Symp. on Discrete Algorithms, 2001 pp. 210-219
65. [GS89] D. Ginat, A.U. Shankar. Decentralized ordering of contending nodes in a distributed system. Unpublished manuscript, 1989
66. [HT84] D. Harel, R.E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13(2): 338-355, 1984
67. th ACM Symp. on Principles of Distributed Computing, 2000 pp. 41-50
68. [H84] M. Herlihy. Replication methods for abstract data types. Technical Report TR-319, MIT, Lab. for Computer Science, 1984
69. [H87] M. Herlihy. Concurrency versus availability: atomicity mechanisms for replicated data. ACM Trans. on Comput. Syst. 5: 249-274, 1987
70. [KNR88] S. Kannan, M. Naor, S. Rudich. Implicit representation of graphs. SIAM Journal on Discrete Math. 5(4): 596-603, 1992. Preliminary version appeared in STOC 1988
71. [KM01] H. Kaplan, T. Milo. Short and simple labels for small distances and other functions. In Proc. Workshop on Algorithms and Data Structures, Aug. 2001
72. th ACM Symp. on Principles of Database Systems, May 2001
73. th ACM-SIAM Symp. on Discrete Algorithms, Jan. 2002
74. th ACM-SIAM Symp. on Discrete Algorithms, Jan. 2002
75. th Symp. on Theoretical Aspects of Computer Science, vol. 1770 of LNCS, pp. 516-528, Feb. 2000
76. [KK1] L. Kleinrock, F. Kamoun. Hierarchical routing for large networks; performance evaluation and optimization. Computer Networks 1: 155-174, 1977
77. [KK2] L. Kleinrock, F. Kamoun. Optimal clustering structures for hierarchical topological design of large computer networks. Computer Networks 10: 221-248, 1980
78. th Symp. on Theoretical Aspects of Computer Science, Mar. 2002
79. th Symp. on Theoretical Aspects of Computer Science, vol. 1046 of LNCS, 1996 pp. 529-540
80. [KKR96] E. Kranakis, D. Krizanc, S.S. Ravi. On multi-label linear interval routing schemes. The Computer Journal 39: 133-139, 1996
81. nd Colloq. on Structural Information & Communication Complexity, pp. 101-112. Carleton University Press, Jun. 1995
82. [KRS00] R. Kráľovička, P. Ružička, D. Štefankovič. The complexity of shortest path and dilation bounded interval routing. Theoretical Computer Science 234 (1-2): 85107, 2000
83. th Canadian Conf. on Computational Geometry, 1999 pp. 51-54
84. [KL80] H.T. Kung, P.L. Lehman. Concurrent manipulation of binary search trees. ACM Trans. on Programming Lang. and Syst. 5: 339-353, 1980
85. th ACM Symp. on Principles of Distributed Computing, 1985 pp. 261-271
86. [Le79] C.E. Leiserson. Systolic priority queues. Technical Report CMU-CS-79-115, Carnegie-Mellon University, 1979
87. [LM79] N. Lynch, M. Merritt. Introduction to the theory of nested transactions. In Proc. Int. Conf. on Database Theory, Rome, Italy 1979 pp. 278-305
88. [Man86] U. Manber. On maintaining dynamic information in a concurrent environment. SIAM Journal on Computing 15: 1130-1142, 1986
89. [ML84] U. Manber, R.E. Ladner, Concurrency control in a dynamic search structure. ACM Trans. on Database Syst. 9: 439-455, 1984
90. [MV88] S.J. Mullender, P. Vitányi. Distributed match-making. Algorithmica 3: 367-391, 1988
91. [NN98] L. Narayanan, N. Nishimura. Interval routing on k-trees, Journal of Algorithms 26(2): 325-369, 1998
92. th Colloq. on Structural Information & Communication Complexity, Carleton Scientific, M 1997 pp. 125-137
93. rd Int. Colloq. on Structural Information & Communication Complexity, Carleton University Press, Jun. 1996 pp. 73-87
94. [OB87] A.R. Omondi, J.D. Brock. Implementing a dictionary on hypercube machines. In Proc. IEEE Int. Conf. on Parallel Process., 1987 pp. 707-709
95. [OD81] D. Oppen.Y.K. Dalai. The clearinghouse: a decentralized agent for locating named objects in a distributed environment. Technical Report OPD-T8103, Xerox Corp., Oct. 1981
96. [ORS82] T.A. Ottman, A.L. Rosenberg, L.J. Stockmeyer. A dictionary machine for VLSI. IEEE Trans. on Computers C-31: 892-897, 1982
97. [Pap86] C.H. Papadimitriou. The Theory of Concurrency Control. Rockville, MD: Computer Science Press 1986
98. th Int. Workshop on Graph-Theoretic Concepts in Computer Science, vol. 1665 of LNCS, 1999 pp. 30-41
99. [Pel00a] D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000
100. th Symp. on Mathematical Foundations of Computer Science, vol. 1893 of LNCS, pp. 579-588. Berlin Heidelerg New York: Springer 2000
101. [PS89] D. Peleg, A.A. Schäffer. Graph spanners. Journal of Graph Theory 13: 99-116, 1989
102. [PU87] D. Peleg, E. Upfal. Efficient message passing using succinct routing tables. Research Report RJ5768, IBM, Aug. 1987
103. [PU89] D. Peleg, E. Upfal. A tradeoff between size and efficiency for routing tables. Journal of the ACM 36: 510-530, 1989
104. th Conf. on System Sciences, 1982
105. [PK87] S. Pramanik, M.H. Kim. HCB.tree: A B_tree structure for parallel processing. In Proc. IEEE Int. Conf. on Parallel Process., 1987 pp. 140-146
106. th Int. Colloq. on Structural Information & Communication Complexity, Carleton University Press 1999 pp. 233-248
107. [RK88] V.N. Rao, V. Kumar. Concurrent insertions and deletions in a priority queue. In Proc. IEEE Int. Conf. on Parallel Process., 1988 pp. 207-211
108. [Re78] D.P. Reed. Naming and Synchronization in a Decentralized Computer System. PhD thesis, MIT, Dept. of Electrical Engineering, 1978
109. [RS00] P. Ružlčka, D. Štefankovič. On the complexity of multi-dimensional interval routing schemes. Theoretical Computer Science 245(2): 255-280, 2000
110. [SK] N. Santoro, R. Khatib. Labelling and implicit routing in networks. The Computer Journal 28: 5-8, 1985
111. [SV88] B. Schieber, U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM Journal on Computing 17(6): 1253-1262, 1988
112. [SS85] H. Schmeck, H. Schröder. Dictionary machines for different models of VLSI. IEEE Trans. on Computers C-34: 472-475, 1985
113. [SL87] A.M. Schwartz, M. Loui. Dictionary machines on cube-class networks. IEEE Trans. on Computers C36: 100-105, 1987
114. [Sun82] C.A. Sunshine. Addressing problems in multi-network systems. In Proc. IEEE INFOCOM, 1982 pp. 12-18
115. [Tar72] R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2): 146-160, 1972
116. [Ter87] D.B. Terry. Cashing hints in distributed systems. IEEE Trans. on Software Eng. SE-13: 48-54, 1987
117. th Int. Colloq. on Structural Information & Communication Complexity, Carleton Scientific, Jun. 1998 pp. 214-228
118. nd IEEE Symp. on Foundations of Computer Science, Oct. 2001
119. th ACM Symp. on Parallel Algorithms and Architecture, 2001 pp. 1-10
120. rd ACM Symp. on Theory of Computing, 2001 pp. 183-192
121. [TL97] S.S.H. Tse, F.C.M. Lau. A lower bound for interval routing in general networks. Networks 29(1): 49-53, 1997
122. [vBoas77] P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6(3): 80-82, 1977
123. [vLT86] J. van Leeuwen, R.B. Tan. Routing with compact routing tables. In: G. Rozenberg, A. Salomaa (eds.) The Book of L, pages 259-273. New York: Springer 1986
124. [vLT87] J. van Leeuwen, R.B. Tan. Interval routing. The Computer Journal 30: 298-307, 1987
125. st Int. Colloq. on Structural Information & Communication Complexity, pp. 99-110. Carleton University Press 1994
126. [Wei84] W.E. Weihl. Specification and implementation of atomic data types. Technical Memo MIT/LCS/TM-314, MIT, Lab. for Computer Science, Mar. 1984