Finding disjoint paths in networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Finding disjoint paths in networks

Full text

Pdf (713 KB)

Source

Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the conference on Communications architecture & protocols table of contents

Zurich, Switzerland

Pages: 43 - 51

Year of Publication: 1991

ISBN:0-89791-444-9

Also published in ...

Authors

Deepinder Sidhu	Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD
Raj Nair	Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD
Shukri Abdallah	Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD

Sponsor

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 164, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/115992.115998 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. Itah and M. Rodeh. The multi-tree approach to reliability in distributed networks. In Proc. 25th Symposium on FOC$, 1984.
	2	D. M. Topkis. A K shortest path algorithm for adaptive routing in communications networks. IEEE Transactions on Communications, 36, 1988.
	3	J. W. Surballe. Disjoint paths in a network. Networks, 4, 1974.
	4	j. W. Surballe and R. E. Tarjan. A quick method of finding shortest pairs of disjoint paths. Networks, 14, 1984.
	5	R. Ogier and N. Shacham. A distributed algorithm for finding shortest pairs of disjoint paths. In Proc. iEEE INFOCOM '89.
	6	C. Cheng, S. P. R. Kumar, and J. J. Garcia- Luna-Aceves. A distributed algorithm for finding K disjoint paths of minimum total length. In Proc. 28th Annual Allerton Conference on Communication, Control, and Computing, Urbana, Illinois, October 1990.
	7	P. F. Tsuchiya. The landmark hierarchy: Description and analysis. Technical Report MTR W87-87W00152, MITRE, June 1987.
	8	D. P. Sidhu, S. Abdallah, and R. Nair. A distance vector algorithm for alternate path routing. Submitted for publication, 1990.
	9	D. P. Sidhu, R. Nair, and S. Abdallah. A distributed algorithm for finding multiple disjoint paths. Submitted for publication, 1990.
	10	M. Garner, V. Haimo, I. Loobeek, D.Davis, and M. Frishkopf. Type-of-service routing: Modeling and simulation. Technical Report 6364, BBN Communications Corporation, January 1987.

CITED BY 11

	Sangman Bak , Jorge A. Cobb, Randomized distance-vector routing protocol, Proceedings of the 1999 ACM symposium on Applied computing, p.78-84, February 28-March 02, 1999, San Antonio, Texas, United States
	Seungjae Han , Kang G. Shin, Fast restoration of real-time communication service from component failures in multi-hop networks, ACM SIGCOMM Computer Communication Review, v.27 n.4, p.77-88, Oct. 1997
	Marc R. Pearlman , Zygmunt J. Haas , Peter Sholander , Siamak S. Tabrizi, On the impact of alternate path routing for load balancing in mobile ad hoc networks, Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, November 20, 2000, Boston, Massachusetts
	Anand Srinivas , Eytan Modiano, Minimum energy disjoint path routing in wireless ad-hoc networks, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA
	Anand Srinivas , Eytan Modiano, Finding minimum energy disjoint paths in wireless ad-hoc networks, Wireless Networks, v.11 n.4, p.401-417, July 2005
	Soumaya Cherkaoui , Omar Lahlou, MSBR: a multi-path routing approach based on end-to-end reliability, Proceedings of the 2nd ACM international workshop on Quality of service & security for wireless and mobile networks, October 02-02, 2006, Terromolinos, Spain
	Meng-Yen Hsieh , Yueh-Min Huang , Tzu-Chinag Chiang, Transmission of layered video streaming via multi-path on ad hoc networks, Multimedia Tools and Applications, v.34 n.2, p.155-177, August 2007
	Constantinos Dovrolis , Parameswaran Ramanathan, Resource aggregation for fault tolerance in integrated services networks, ACM SIGCOMM Computer Communication Review, v.28 n.2, p.39-53, Apr. 1998
	J. M. Ng , R. N. Susilo, Controlled shared backup strategy based on channel availability, International Journal of Computer Applications in Technology, v.24 n.1, p.25-32, June 2005
	Sahel Alouneh , Anjali Agarwal , Abdeslam En-Nouaary, A novel path protection scheme for MPLS networks using multi-path routing, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.53 n.9, p.1530-1545, June, 2009
	Xianbing Wang , Yong Meng Teo, Global data computation in chordal rings, Journal of Parallel and Distributed Computing, v.69 n.8, p.725-736, August, 2009