A fast construction of disjoint paths in communication networks
An incremental connection problem is to add k disjoint paths from s i to t i , 1≤i≤k, in an operating network. A parallel distributed algorithm is presented, which solves the problem efficiently in a general situation. Its probable performance is analyzed in a random graph setup.
KeywordsRandom Graph Disjoint Path Connection Request Free Vertex Fair Chance
Unable to display preview. Download preview PDF.
- 1.S.N. Bhatt, On concentration and connection networks, TM 196/1981, M.I.T. Cambridge, Mass. 1981.Google Scholar
- 2.P. Erdös, The Art of Counting — Selected Writings. J. Spencer Ed., The M.I.T. Press, Cambridge 1973.Google Scholar
- 3.M.R. Garey and D.S. Johnson, Computers and Intractability A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.Google Scholar
- 4.E. Shamir and E. Upfal, N — processors graphs distributively achieve perfect matchings in O(log2 N) beats. Proc. of Annual ACM Sym. on Principles of Distributed Computing, 1982, 238–241.Google Scholar