Improved Compact Routing tables for planar Networks via Orderly spanning trees

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

Volumn 2387, Issue , 2002, Pages 57-66

  Lu, Hsueh I ^a  

^a ACADEMIA SINICA   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

BIT-OPERATIONS; COMPACT ROUTING TABLES; FORWARD PACKETS; NETWORK TOPOLOGY; PLANAR NETWORKS; POSITIVE CONSTANT; ROUTING TABLE; SPANNING TREE;

NETWORK ROUTING;

EID: 84949750963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45655-4_8     Document Type: Conference Paper

References (39)

1. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11(3):307–341, 1990.
2. M. Becker and K. Mehlhorn. Algorithms for routing in planar graphs. Acta Informatica, 23(2):163–176, 1986.
3. P. Bose and P. Morin. Competitive online routing in geometric graphs. In Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, pages 35–44, 2001.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609–616, 2001.
5. L. P. Chew. There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences, 39:205–219, 1989.
6. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu. Orderly spanning trees with applications to graph drawing and graph encoding. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 506–515, Washington, DC, 7–9 Jan. 2001. A revised and extended version can be found at http://xxx.lanl.gov/abs/cs.DS/0102006.
7. R. C.-N. Chuang, A. Garg, X. He, M.-Y. Kao, and H.-I. Lu. Compact encodings of planar graphs via canonical ordering and multiple parentheses. In K. G. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 1443, pages 118–129, Aalborg, Denmark, 1998. Springer-Verlag.
8. L. Cowen and C. G. Wagner. Compact roundtrip routing in directed networks. In Prooceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 51–59. ACM PRESS, 2000.
9. L. J. Cowen. Compact routing with minimum stretch. Journal of Algorithms, 38(1):170–183, 2001.
10. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41–51, 1990.
11. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21:194–203, 1975.
12. P. Fraigniaud and C. Gavoille. Routing in trees. In F. Orejas, P. G. Spirakis, and J. v. Leeuwen, editors, Proceedings of the 28th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 2076, pages 757–772. Springer, July 2001.
13. P. Fraigniaud and C. Gavoille. A space lower bound for routing in trees. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 2285, pages 65–75. Springer, Mar. 2002.
14. G. N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3(1):171–190, 1988.
15. G. N. Frederickson and R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18:843–857, 1989.
16. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Jouranl of Computer and System Sciences, 48(3):533–551, June 1994.
17. J. Gao, L. J. Guibas, J. Hershburger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), 2001.
18. C. Gavoille. A survey on interval routing. Theoretical Computer Science, 245(2):217–253, 2000.
19. C. Gavoille and M. Gengler. Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing, 61:679–687, 2001.
20. C. Gavoille and N. Hanusse. Compact routing tables for graphs of bounded genus. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, 26th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 1644, pages 351–360. Springer, July 1999. A full version is available at http://dept-info.labri.fr/˜gavoille/article/GH99up.ps.gz.
21. C. Gavoille and D. Peleg. The compactness of interval routing. SIAM Journal on Discrete Mathematics, 12(4):459–473, Oct. 1999.
22. C. Gavoille and D. Peleg. The compactness of interval routing for almost all graphs. SIAM Journal on Computing, 31(3):706–721, 2001.
23. Y. Hassin and D. Peleg. Sparse communication networks and efficient routing in the plane. Distributed Computing, 14(4):205–215, 2001.
24. G. Jacobson. Space-efficient static trees and graphs. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 549–554, Research Triangle Park, North Carolina, 30 Oct.–1 Nov. 1989. IEEE.
25. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16(1):4–32, 1996.
26. B. N. Karp. Geographic Routing for Wireless Networks. PhD thesis, Harvard University, Cambridge, MA, Oct 2000.
27. B. N. Karp and H. T. Kung. GPSR: Greedy perimeter stateless rouring for wireless networks. In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243–254, Boston, 2000.
28. X.-Y. Li, G. Calinescu, and P. -J. Wan. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom), New York City, 2002. To appear.
29. C.-C. Liao, H.-I. Lu, and H.-C. Yen. Floor-planning via orderly spanning trees. In Proceedings of the 9th International Symposium on Graph Drawing, Lecture Notes in Computer Science 2265, pages 367–377, Vienna, Austria, 2001. Springer.
30. G. Lin. Fault tolerant planar communication networks. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 133–139, 1992.
31. J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. SIAM Journal on Computing, 31(3):762–776, 2001.
32. G. Narasimhan and M. Smid. Approximating the stretch factor of euclidean graphs. SIAM Journal on Computing, 30(3):978–989, 2000.
33. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications. SIAM, 2000.
34. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3):510–530, 1989.
35. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to representations of k-ary trees and multisets. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 233–242, San Francisco, 6–8 Jan. 2002.
36. W. Schnyder. Embedding planar graphs on the grid. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 138–148, 1990.
37. M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1–10. ACM PRESS, 2001.
38. P. van Emde Boas. Machine models and simulations. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 1, pages 1–60. Elsevier, Amsterdam, 1990.
39. M. Yannakakis. Embedding planar graphs in four pages. Jouranl of Computer and System Sciences, 38(1):36–67, Feb. 1989.