Optimal maintenance of a spanning tree

Journal of the ACM

Volumn 55, Issue 4, 2008, Pages

  Awerbuch, Baruch ^a   Cidon, Israel ^b   Kutten, Shay ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Amortized complexity; Distributed algorithms; Dynamic networks; Leader election; Optimal message complexity; Spanning tree; Topological changes

Indexed keywords

AMORTIZED COMPLEXITY; COMMUNICATION COMPLEXITIES; DISTRIBUTED ALGORITHMS; DYNAMIC NETWORKS; ESSENTIAL COMPONENTS; LEADER ELECTION; MESSAGE COMPLEXITY; MULTICAST; NAME SPACES; NETWORK NODES; NUMBER OF NODES; OPTIMAL MAINTENANCE; OPTIMAL MESSAGE COMPLEXITY; SPANNING TREE; SPANNING TREES; STATIC ALGORITHMS; TERMINATION DETECTION; TOPOLOGICAL CHANGES;

ALGORITHMS; BROADCASTING; CHLORINE COMPOUNDS; MAINTENANCE; PARALLEL ALGORITHMS; TOPOLOGY;

ROUTING ALGORITHMS;

EID: 52249100844     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1391289.1391292     Document Type: Article

References (73)

1. AFEK, Y., AWERBUCH, B., AND GAFNI, E. 1987. Applying static network protocols to dynamic networks. In Proceedings of the 28th IEEE Conference on Foundations of Computer Science (Oct.). IEEE Computer Society Press, Los Alamitos, CA, 358-370.
2. AFEK, Y., AWERBUCH, B., GAFNI, E., MANSOUR, Y., ROSEN, A., AND SHAVIT, N. 1997. Slide-the key to polynomial end-to-end communication. J. Algorithms 22, 1, 158-186.
3. AEEK, Y., AWERBUCH, B., AND MORIEL, H. 1989. Overhead of resetting a communication protocol is independent of the size of the network. (May) Unpublished manuscript.
4. AFEK, Y., AND GAFNI, E. 1988. End-to-end communication in unreliable networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, New York, 131-148.
5. AFEK, Y., AND GAFNI, E. 1991. Bootstrap network resynchronization. In Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, New York, 295-307.
6. AFEK, Y., GAFNI, E., AND ROSEN, A. 1992. The slide mechanism with applications in dynamic networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, New York, 35-46.
7. AFEK, Y., KUTTEN, S., AND YUNG, M. 1990. Memory-efficient self stabilizing protocols for general networks. In Proceedings of the 5th Workshop on Distributed Algorithms. Lecture Notes in Computer Science, Springer-Verlag, New York, 15-28.
8. ARORA, A., AND GOUDA, M. G. 1994. Distributed reset. IEEE Trans. Computers 43. 9, 1026-1038.
9. AUERBACH, J., GOPAL, M., KAPLAN, M., AND KUTTEN, S. 2003. Multicast group membership management. IEEE/ACM Trans. Netw. 11, 1 (Feb.), 166-175.
10. AWERBUCH, B. 1985. Complexity of network synchronization. J. ACM. 32, 4 (Oct.), 804-823.
11. AWERBUCH, B. 1990. On the effects of feedback in dynamic network protocols. J. Algorithms 11, 3, 342-373.
12. AWERBUCH, B., CIDON, I., GOPAL, I., KAPLAN, M., AND KUTTEN, S. 1990a. Distributed control for PARIS. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (Quebec City, Que., Canada), ACM, New York, 145-160.
13. AWERBUCH, B., CIDON, I., AND KUTTEN, S. 1990b. Communication-optimal maintenance of replicated information. In Proceedings of IEEE Symposium on Foundations of Computer Science. Ieee Computer Society Press, Loss Alamitos, CA, 492-502.
14. AWERBUCH, B., CIDON, I., KUTTEN, S., MANSOUR, Y., AND PELEG, D. 1998. Optimal broadcast with partial knowledge. SIAM J. Comput. 28, 2, 511-524.
15. AWERBUCH, B., GOLDREICH, O., AND HERZBERG, A. 1990c. A quantitative approach to dynamic networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM, New York, 189-203.
16. AWERBUCH, B., GOLDREICH, O., PELEG, D., AND VAINISH, R., 1990d. A tradeoff between information and communication in broadcast protocols. J. ACM. 37, 2, 238-256.
17. AWERBUCH, B., MANSOUR, Y., AND SHAVIT, N. 1989. End-to-end communication with polynomial overhead. In Proceedings of IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 358-363.
18. AWERBUCH, B., AND MICALI, S. 1986. Dynamic deadlock resolution protocols. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 196-207.
19. AWERBUCH, B., PATT-SHAMIR, B., AND VARGHESE, G. 1991. Self-stabilization by local checking and correction. In of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 268-277.
20. AWERBUCH, B., AND SCHULMAN, L.J. 1997. The maintenance of common data in a distributed system. J. ACM 44, 1, 86-103.
21. AWERBUCH, B., AND SIPSER, M. 1988. Dynamic networks are as fast as static networks. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 206-220.
22. BARATZ, A. E., GRAY, J. P., GREEN JR., P. E., JAFFE, J. M., AND POZEFSKI, D. P. 1985. SNA networks of small systems. IEEE J. Select. Areas Commun. SAC-3, 3 (May), 416-426.
23. BARNES, D., AND SAKANDAR, B. 2004. Cisco LAN Switching Fundamentals. Cisco Press, ISBN: 1587050897.
24. BEHRENS, J., AND GARCIA-LUNA- ACEVES, J. J. 1994. Distributed, scalable routing based on link-state vectors. In Proceedings of the Conference on Communications Architectures (London, UK), 136-147.
25. BELLUR, B., AND OGIER, R. G. 1999. A reliable, efficient topology broadcast protocol for dynamic networks. In Proceedings of IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA.
26. BUI, M., BUTELLE, F., AND LAVAULT, C. 2004. A distributed algorithm for constructing a minimum diameter spanning tree. J. Parallel Distrib. Comput. 64, 5, 571-577.
27. CHANDY, K. M., AND LAMPORT, L. 1985. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3, 1, 63-75.
28. CHENG, C., CIMET, I. A., AND KUMAR, S. P. R. 1988. A protocol to maintain a minimum spanning tree in dynamic topology. In Proceedings of ACM SIGCOMM 1988 Symposium (Stanford, CA, Aug. 16-18), ACM, New York, 330-337.
29. CHENG, C., RILEY, R., KUMAR, S. P. R., AND GARCIA-LUNA-ACEVES, J. J. 1989. A loop-free extended Bellman-Ford routing protocol without bouncing effect. In Proceedings of the ACM SIGCOMM '89th (Sept.), ACM, New York, 224-237.
30. CICERONE, S., STEFANO, G. D., FRIGIONE, D., AND NANNI, U. 2003. A fully dynamic algorithm for distributed shortest paths. Theoret. Comput. Sci. 297, 83-102.
31. CIDON, I., AND GOPAL, I. S. 1988. PARIS: An approach to integrated high-speed private networks. Int. J. Digital Analog Cabled Syst. 1, 2, (April-June), 77-86.
32. CIDON, I., GOPAL, I. S., KAPLAN, M., AND KUTTEN, S. 1995a. A distributed control architecture of high-speed networks. IEEE Trans. Commun. 43, 5 (May) 1950-1960.
33. CLDON, I., GOPAL, I. S., AND KUTTEN, S. 1995b. New models and algorithms for future networks. IEEE Trans. Inf. Theory 41, 3 (May), 769-780.
34. CIDON, I., HSIAO, T., KHAMISY, A., PAREKH, A., ROM, R., AND SUJI, M. 1999. OPENET: An open and efficient control platform for ATM networks. J. High Speed Netw. 8, 3, 195-210.
35. COHEN, R., AND SEGALL, A. 1988. A distributed query protocol for high-speed networks. In Proceedings of the 9th International Conference on Computer Communication (ICCC88), (Tel Aviv, Israel, Oct.-Nov.) 299-302.
36. DIJKSTRA, E. W., AND SCHOLTEN, C. S. 1980. Termination detection for diffusing computations. Inf. Proc. Lett. 11, 1 (Aug.) 1-4.
37. DOLEV, S., ISRAELI, A., AND MORAN, S. 1993. Self-stabilization of dynamic systems assuming only read/write atomicity. Distrib. Comput. 7, 1, 3-16.
38. ELKIN, M. 2007. A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing Portland, Or). ACM, New York, 185-194.
39. EVEN, S. 1979. Graph Algorithms. Computer Science Press.
40. FINN, S. G. 1979. Resynch procedures and a fail-safe network protocol. IEEE Trans. Commun. COM-27, 6 (June) 840-845.
41. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M.S. 1985. Impossibility of distributed consensus with one family faulty process. J. ACM, 32, 2 (Apr.), 374-382.
42. FREDERICKSON, G. N. 1985. Data structures for on-line updating of minimum spanning trees. SIAM J. Comput. 14, 781-798.
43. GAENI, E. 1987. Topology resynchronization: A new paradigm for fault tolerance in distributed algorithms. In Proceedings of the 2nd Workshop on Distributed Algorithms (WDAG '87) Amsterdam, The Netherlands, July 8-10), Lecture Notes in Computer Science, vol. 312, Springer-Verlag, New York.
44. GAFNI, E., AND AFEK, Y. 1987. Local fail-safe resynch procedure, unpublished manuscript, (Apr.).
45. GALLAGER, R. G. 1976. A shortest path routing algorithm with automatic resynch. Tech. repo. MIT LIDS, (Mar).
46. GALLAGER, R. G. 1977. A minimum delay routing algorithm using distributed computation. IEEE Trans. Commun. 25, 1, 73-85.
47. GALLAGER, R. G., HUMBLET, P. A., AND SPIRA, P. M. 1983. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Prog. Lang. Syst. 5, 1 (Jan.), 66-77.
48. GARCIA-LUNA-ACEVES, J. J. 1989. A unified approach to loop-free routing using distance vectors or link states. ACM SIGCOMM Comput. Commun. Rev. Arch. 19, 4, 212-223.
49. GARCIA-LUNA-ACEVES, J. J. 1993. Loop-free routing using diffusing computations. IEEE/ACM Trans. Netw. 1, 1 (Feb.), 130-141.
50. GUERIN, R., RANK, J., SARKAR, S., AND VERGETIS, E. 2003. Forming connected topologies in bluetooth adhoc networks. In Proceedings of ITC 18 (Berlin, Germany, Sept.).
51. HUMBLET, P. A. 1981. An adaptive distributed Dijkstra shortest path algorithm. Tech. Rep. CICS-P-60, Center for Intelligent Control Systems, MIT, Cambridge, MA, (May).
52. HUMBLET, P. 1991. Another adaptive distributed shortest path algorithm. IEEE Trans. Commun. 39, 6, 995-1003.
53. HUMBLET, P., AND SOLOWAY, S. 1989. Topology broadcast algorithms. Comput. Netw. ISDN Syst. 16, 179-186.
54. IETF, http://www.ietf.org/proceedings/02nov/179.htm.
55. ITALIANO, G.F. 1991. Distributed algorithms for updating shortest paths. In Proceedings of the 5th International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, Springer-Verlag, New York, 200-211.
56. ITALIANO, G. F., AND RAMASWAMI, R. 1998. Maintaining spanning trees of small diameter. Algorithmica, 22, 3, 275-304.
57. JAFFE, J., AND MOSS, F. 1982. A responsive distributed routing protocol. IEEE Trans. Commun. COM-30, 7, II (Jul.), 1758-1762.
58. KORACH, E., AND MARKOVITZ, M. 1986. Algorithms for distributed spanning tree construction in dynamic networks. Tech. Rep. 401, Dept of CS, Technion, Haifa, Israel (Feb).
59. KORACH, E., MORAN, S., AND ZAKS, S. 1989. Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoret. Comput. Sci. 64, 1, 125-132.
60. KUTTEN, S., AND PORAT, A. 1999. Maintenance of a spanning tree in dynamic networks. In Proceedings of the 13th International Symposium on Distributed Computing (DISC'99), (Bratislava, Slovak Republic, Sept.), 342-355.
61. MCQUILLAN, J., RICHER, I., AND ROSEN, E. 1980. The new routing algorithm for the arpanet. IEEE Trans. Commun., 28, 5 (May), 711-719.
62. MARIN, G. A., IMMANUEL, C. P., CHIMENTO, P. F., AND GOPAL, I. S. 1995. Overview of the NBBS architecture - Networking BroadBand Services. IBM Syst. J. 34, 4 (Dec.), 564.
63. MERLIN, P., AND SEGALL, A. 1979. Failsafe distributed routing protocol. IEEE Trans. Comm. 27 (Sept.), 1280-1287.
64. OGIER, R., TEMPLIN, F., AND LEWIS, M. 2004. RFC3684: Topology Dissemination Based on Reverse-Path Forwarding (TBRPF). An Internet RFC: http://portal.acm.org/citation.cfm-id=RFC3684.
65. PERLMAN, R. 1999. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, (2nd Ed.), Addison-Wesley Professional, Reading, MA.
66. RAJAGOPALAN, B., AND FAIMAN, M. 1989. A new responsive distributed shortest path routing algorithm. In Proceedings of the ACM Symposium on Communications Architectures & Protocols (Austin, TX, Sept.). ACM, New York, 237-246.
67. RAMARAO, K. V. S., AND VENKATESAN, S. 1992. On finding and updating shortest paths distributively. J. Algorithms, 13, 235-257.
68. SEGALL, A. 1983. Distributed network protocols. IEEE Trans. Inf. Syst. IT-29, 1 (Jan.), 23-35.
69. SEGALL, A., AND SIDI, M. 1981, A failsafe distributed protocol for minimum, delay routing. IEEE Trans. Commun., COM-29, 5 (May), 689-695.
70. SPINELLI, J.M., AND GALLAGER, R. G. 1989. Broadcasting topology information in computer networks. IEEE Trans. Commun. (May).
71. TANENBAUM, A. 2002. Computer Networks, (4th Ed.), Prentice-Hall, Engewood, Cliffs, NJ.
72. TURNER, J. S. 1988. Design of a broadcast packet switching network. IEEE Trans. Commun. 36, 6 (Jun.), 734-743.
73. VISHKIN, U. 1983. A distributed orientation algorithm. IEEE Trans. Inf. Theory, IT-29, 4 (July), 624-629.