Arabian Journal for Science and Engineering

, Volume 38, Issue 8, pp 2043–2054 | Cite as

Link Disjoint Paths Using Auxiliary Graph Transformation in WDM Networks

Research Article - Computer Engineering and Computer Science
First Online:
Received:
Accepted:
  • 136 Downloads

Abstract

This paper presents a new method for finding two link-disjoint paths in WDM networks under wavelength continuity and lowest cost constraints. Such a problem is considered to be an NP-complete problem, which is only solvable using Integer Linear Programming (ILP). The presented method is based on transforming the original network into an auxiliary network with n × n nodes and 2 mn links, where n is the number of nodes and m is the number of links in the original network, and then applying a modified version of Dijkstra’s shortest path algorithm on that network. Despite the larger network size, the execution time of the algorithm is in polynomial order. Considering that the problem is NP-complete, the presented algorithm takes much less time than using ILP, which generally requires exponential time. Yet, it is able to find all available disjoint paths obtainable by ILP.

Keywords

Disjoint paths WDM networks Network survivability Optimization algorithms 
Open image in new window

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fiber Optic Cable Cuts Isolate Millions From Internet, Future Cuts Likely | Threat Level | Wired.com. http://www.wired.com/threatlevel/2008/01/fiber-optic-cab/. Accessed on 09 Apr 2011
  2. 2.
    Sahasrabuddhe L, Ramamurthy S, Mukherjee B: Fault management in IP-over-WDM networks: WDM protection versus IP restoration. IEEE J. Select. Areas Commun. vol. 20(1), 21–33 (2002)CrossRefGoogle Scholar
  3. 3.
    Liang, W.: Robust routing in wide-area WDM networks. In: Parallel and Distributed Processing Symposium. Proceedings. 15th International (2001)Google Scholar
  4. 4.
    Shan D.M, Chua K.C, Mohan G: On burst rescheduling in OBS networks with partial wavelength conversion capability. Comput. Netw. Int. J. Comput. Telecommun. Netw. 54, 706–715 (2010)MATHCrossRefGoogle Scholar
  5. 5.
    German, M.; et al.: On the challenges of finding two link-disjoint lightpaths of minimum total weight across an optical network. Presented at the 14th European Conference on Networks and Optical Communications (NOC) and the 4th Conference on Optical Cabling and Infrastructure (OC&I), Valladolid, Spain (2009)Google Scholar
  6. 6.
    Suurballe J: Disjoint paths in a network.. Networks 4(2), 125–145 (1974)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Suurballe J, Tarjan R: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325–336 (1984)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Andersen, R.; Chung, F.; Sen, A.; Xue, G.: On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. IN WDM NETWORKS; IEEE INFOCOM’2004, vol. 2, pp. 524–535 (2004)Google Scholar
  9. 9.
    Yuan, S.; Jue, J.: Dynamic lightpath protection in WDM mesh networks under wavelength continuity constraint. In: Global Telecommunications Conference, 2004. GLOBECOM 04. IEEE, vol. 3, pp. 2019–2023 (2004)Google Scholar
  10. 10.
    Le, V.; Ngo, S.; Jiang, X.; Horiguchi, S.; Inoguchi, Y.: A hybrid algorithm for dynamic lightpath protection in survivable WDM optical networks. In: 8th International Symposium on Parallel Architectures, Algorithms and Networks (2005)Google Scholar
  11. 11.
    Yuan, S.; Jue, J.: Dynamic lightpath protection in WDM mesh networks under risk-disjoint constraint. In: Global Telecommunications Conference, 2004. GLOBECOM 04. IEEE, vol. 3, pp. 1770–1774 (2004)Google Scholar
  12. 12.
    Todimala, A.; Ramamurthy, B.; Vinodchandran, N.V.: On computing disjoint paths with dependent cost structure in optical networks. In: 2nd International Conference on Broadband Networks, 2005. BroadNets 2005, vol. 1, pp. 145–154 (2005)Google Scholar
  13. 13.
    Mandal, D.; Mitra, B.: Shared Path Protection in DWDM Mesh Networks. Presented at 8th International Conference on the Information Technology, Bhubaneswar, India (2005)Google Scholar
  14. 14.
    Todimala, A.; Ramamurthy, B.: Least-cost disjoint paths with dependent cost structure in wavelength continuous optical WDM networks. In: 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Proceedings. pp. 311–316 (2005)Google Scholar
  15. 15.
    Sneyers, J.; Schrijvers, T.; Demoen, B.: Dijkstra’s algorithm with Fibonacci heaps: an executable description. In: CHR. in 20th Workshop on Logic Programming (WLP’06), pp. 182–191 (2006)Google Scholar

Copyright information

© King Fahd University of Petroleum and Minerals 2013

Authors and Affiliations

  1. 1.Department of Computer Engineering, College of Computer and Information SciencesKing Saud UniversityRiyadhSaudi Arabia

Personalised recommendations