Abstract
Most distributed algorithms for computer networks are designed to work with arbitrary graph structures. Most networks, however, can usually be decomposed into subgraphs with a specific structure. Detecting and exploiting these subgraphs can considerably reduce the storage and communication cost of the algorithm. In this paper we propose a distributed algorithm for detecting and exploiting tree subgraphs. In a network with fixed topology, the algorithm is optimal in terms of communication complexity. The algorithm also dynamically adapts to changes in network topology caused by link failure and recovery. The dynamic operation of the algorithm is incremental as only nodes that may be affected by the change reinitiate the algorithm. Another important property of our algorithm is that it requires no node identities or sequence numbers. We examine how this idea can be extended to other subgraph structures.
Similar content being viewed by others
References
J. M. McQuillan, I. Richer, and E. C. Rosen, The New Routing Algorithm for the ARPANET,IEEE Transactions on Communications, Vol. 28, May 1980.
I. Cidon, J. M Jaffe, and M Sidi, Local Distributed Deadlock Detection by Cycle Detection and Clustering, to appear inIEEE Transactions on Software Engineering, also in Technical Report 88.164, IBM Israel Scientific Center, July 1985.
C. Berge,Graphs and Hypergraphs, North Holland, Amsterdam, 1973, p. 8.
A. E. Baratz, J. P. Gray, P. E. Green, J. M. Jaffe, and D. P. Pozefsky, SNA Networks of Small Systems,IEEE Journal on Selected Areas in Communications, Vol. 3, No. 3, May 1985, pp. 416–426.
S. Even,Graph Algorithms, Computer Science Press, Rockville, MD, 1979, pp. 53–56.
B. Awerbuch, A New Depth-First-Search Algorithm,Information Processing Letters, No. 20, 1985, pp. 147–150.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
Rights and permissions
About this article
Cite this article
Cidon, I., Gopal, I.S. Dynamic detection of subgraphs in computer networks. Algorithmica 5, 277–294 (1990). https://doi.org/10.1007/BF01840389
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840389