Dynamic routing schemes for general graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 619-630

  Korman, Amos ^a   Peleg, David ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; PARAMETER ESTIMATION; ROUTERS; TELECOMMUNICATION NETWORKS;

DYNAMIC COMMUNICATION NETWORKS; DYNAMIC ROUTING SCHEMES; LOCAL DENSITY D; ROUTING SCHEME;

GRAPH THEORY;

EID: 33746329338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_54     Document Type: Conference Paper

References (19)

1. Y. Afek, B. Awerbuch, S.A. Plotkin and M. Saks. Local management of a global resource in a communication network. J. ACM 43, (1996), 1-19.
2. Y. Afek, E. Gafni and M. Ricklin. Upper and lower bounds for routing schemes in dynamic networks. In Proc. 30th Symp. on Foundations of Computer Science, 1989, 370-375.
3. B. Awerbuch, A. Bar-Noy, N. Linial and D. Peleg. Improved routing strategies with succinct tables. J. Algorithms 11, (1990), 307-341.
4. B. Awerbuch and D. Peleg. Routing with polynomial communication-space tradeoff. SIAM J. Discrete Math. 5, (1992), 307-341.
5. L. Cowen. Compact routing with minimum stretch. J. Algorithms 38, (2001), 170-183.
6. S. Dolev, E. Kranakis, D. Krizanc and D. Peleg. Bubbles: Adaptive routing scheme for high-speed dynamic networks. SIAM J. on Comput. 29, (1999), 804-833.
7. D. Eppstein, Z. Galil and G. F. Italiano. Dynamic Graph Algorithms. In Algorithms and Theoretical Computing Handbook, M.J. Atallah, Ed., CRC Press, 1999, Ch. 8.
8. P. Praigniaud and C. Gavoille. Universal routing schemes. Distributed Computing 10, (1997), 65-78.
9. J. Feigenbaum and S. Kannan. Dynamic Graph Algorithms. In Handbook of Discrete and Combinatorial Mathematics, CRC Press, 2000.
10. C. Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News-Distributed Computing Column 32, (2001), 36-52.
11. K. Iwama and A. Kawachi. Compact routing with stretch factor less than three. In Proc. 19th ACM Symp. on Principles of Distributed Computing, 2000, 337.
12. K. Iwama and M. Okita. Compact Routing for Flat Networks. In Proc. 17th International Simposium on Distributed Computing, Oct. 2003.
13. A. Korman. General Compact Labeling Schemes for Dynamic Trees. In Proc. 19th International Simposium on Distributed Computing, Sep. 2005.
14. A. Korman, D. Peleg and Y. Rodeh. Labeling schemes for dynamic tree networks. Theory of Computing Systems 37, (2004), 49-75.
15. A. Korman and D. Peleg. Labeling schemes for weighted dynamic trees. In Proc. 30th Int. Colloq. on Automata, Languages and Prog., July 2003, 369-383.
16. D. Peleg. Distributed computing: A Locality-Sensitive Approach. SIAM, 2000.
17. D. Peleg and E. Upfal. A tradeoff between size and efficiency for routing tables. J. ACM36, (1989), 510-530.
18. N. Santoro and R. Khatib. Labeling and implicit routing in networks. The Computer Journal 28, (1985), 5-8.
19. M. Thorup and U. Zwick. Compact routing schemes. In Proc. 13th ACM Symp. on Parallel Algorithms and Architectures, July 2001, 1-10.