On Degree Constrained Shortest Paths
Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, “actual” edges and “potential” edges. In addition, each vertex has a degree/interface constraint. We wish to compute a shortest path in the graph that maintains feasibility when we convert the potential edges on the shortest path to actual edges. The central difficulty is when a node has only one free interface, and the unconstrained shortest path chooses two potential edges incident on this node. We first show that this problem can be solved in polynomial time by reducing it to the minimum weighted perfect matching problem. The number of steps taken by this algorithm is O(|E|2 log |E|) for the single-source single-destination case. In other words, for each v we compute the shortest path P v such that converting the potential edges on P v to actual edges, does not violate any degree constraint. We then develop more efficient algorithms by extending Dijkstra’s shortest path algorithm. The number of steps taken by the latter algorithm is O(|E||V|), even for the single-source all destination case.
KeywordsShort Path Short Path Problem Short Path Algorithm Critical Node Free Space Optical
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
- 2.Cook, W., Rohe, A.: Computing Minimum Weight Perfect Matchings. INFORMS Journal of Computing (1998)Google Scholar
- 5.Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. of the ACM-SIAM Symp. on Discrete Algorithms, pp. 434–443 (1990)Google Scholar
- 7.Gurumohan, P., Hui, J.: Topology Design for Free Space Optical Network. In: ICCCN 2003 (October 2003)Google Scholar
- 8.Huang, Z., Shen, C.-C., Srisathapornphat, C., Jaikaeo, C.: Topology Control for Ad Hoc Networks with Directional Antennas. In: ICCCN 2002, Miami, Florida (October 2002)Google Scholar
- 9.Kashyap, A., Lee, K., Shayman, M.: Rollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks. Technical Report, Institute for System Research, University of Maryland (2003)Google Scholar
- 10.Könemann, J., Ravi, R.: Primal-dual algorithms come of age: approximating MST’s with non-uniform degree bounds. In: Proc. of the 35th Annual Symp. on Theory of Computing, pp. 389–395 (2003)Google Scholar
- 11.Koo, S., Sahin, G., Subramaniam, S.: Dynamic LSP Provisioning in Overlay, Augmented, and Peer Architectures for IP/MPLS over WDM Networks. In: IEEE INFOCOM (March 2004)Google Scholar
- 12.Lee, K., Shayman, M.: Optical Network Design with Optical Constraints in Multi-hop WDM Mesh Networks. In: ICCCN 2004 (October 2004)Google Scholar
- 13.Leonardi, E., Mellia, M., Marsan, M.A.: Algorithms for the Logical Topology Design in WDM All-Optical Networks. In: Optical Networks Magazine, pp. 35–46 (January 2000)Google Scholar
- 14.Riza, N.A.: Reconfigurable Optical Wireless. In: LEOS 1999, vol.1, pp. 8–11 (November 1999)Google Scholar