Novel Survivable Logical Topology Routing by Logical Protecting Spanning Trees in IP-Over-WDM Networks

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The survivable logical topology mapping (routing) problem in IP-over-wavelength-division multiplexing networks is to map each link in the logical topology (IP layer) onto a lightpath in the physical topology (optical layer), such that failure of a physical link does not cause the logical topology to become disconnected. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. We present necessary and sufficient conditions based on this concept and study three optimization problems with varying degrees of difficulty. We study a generalized logical routing problem with the objective to protect the logical topology against maximal number of physical link failures. The new problem aims to find a survivable routing if one exists, or achieve maximal protection of physical link failures otherwise. We also show that the problem is equivalent to the minimum dominating set problem in bipartite graphs. We discuss how one can use the column generation technique to speed up the execution of this formulation, which obviates the need to find all spanning trees at the beginning of the execution of this formulation. In addition, we also present which has several nice features a heuristic approach, which incorporates a method to augment the logical topology with additional links to guarantee a survivable routing, which only requires a shortest path algorithm and an algorithm to generate an appropriate spanning tree. We provide the results of extensive simulations conducted to evaluate our formulations and demonstrate the effectiveness of our new approach.

Original languageEnglish (US)
JournalIEEE/ACM Transactions on Networking
DOIs
StateAccepted/In press - Jan 24 2017

Fingerprint

Trees (mathematics)
Wavelength division multiplexing
Topology
Telecommunication links

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Novel Survivable Logical Topology Routing by Logical Protecting Spanning Trees in IP-Over-WDM Networks. / Zhou, Zhili; Lin, Tachun; Thulasiraman, Krishnaiyan; Xue, Guoliang.

In: IEEE/ACM Transactions on Networking, 24.01.2017.

Research output: Contribution to journalArticle

@article{41e4326e34a142acb02d8f9a1cbc4294,
title = "Novel Survivable Logical Topology Routing by Logical Protecting Spanning Trees in IP-Over-WDM Networks",
abstract = "The survivable logical topology mapping (routing) problem in IP-over-wavelength-division multiplexing networks is to map each link in the logical topology (IP layer) onto a lightpath in the physical topology (optical layer), such that failure of a physical link does not cause the logical topology to become disconnected. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. We present necessary and sufficient conditions based on this concept and study three optimization problems with varying degrees of difficulty. We study a generalized logical routing problem with the objective to protect the logical topology against maximal number of physical link failures. The new problem aims to find a survivable routing if one exists, or achieve maximal protection of physical link failures otherwise. We also show that the problem is equivalent to the minimum dominating set problem in bipartite graphs. We discuss how one can use the column generation technique to speed up the execution of this formulation, which obviates the need to find all spanning trees at the beginning of the execution of this formulation. In addition, we also present which has several nice features a heuristic approach, which incorporates a method to augment the logical topology with additional links to guarantee a survivable routing, which only requires a shortest path algorithm and an algorithm to generate an appropriate spanning tree. We provide the results of extensive simulations conducted to evaluate our formulations and demonstrate the effectiveness of our new approach.",
author = "Zhili Zhou and Tachun Lin and Krishnaiyan Thulasiraman and Guoliang Xue",
year = "2017",
month = "1",
day = "24",
doi = "10.1109/TNET.2016.2639362",
language = "English (US)",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Novel Survivable Logical Topology Routing by Logical Protecting Spanning Trees in IP-Over-WDM Networks

AU - Zhou, Zhili

AU - Lin, Tachun

AU - Thulasiraman, Krishnaiyan

AU - Xue, Guoliang

PY - 2017/1/24

Y1 - 2017/1/24

N2 - The survivable logical topology mapping (routing) problem in IP-over-wavelength-division multiplexing networks is to map each link in the logical topology (IP layer) onto a lightpath in the physical topology (optical layer), such that failure of a physical link does not cause the logical topology to become disconnected. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. We present necessary and sufficient conditions based on this concept and study three optimization problems with varying degrees of difficulty. We study a generalized logical routing problem with the objective to protect the logical topology against maximal number of physical link failures. The new problem aims to find a survivable routing if one exists, or achieve maximal protection of physical link failures otherwise. We also show that the problem is equivalent to the minimum dominating set problem in bipartite graphs. We discuss how one can use the column generation technique to speed up the execution of this formulation, which obviates the need to find all spanning trees at the beginning of the execution of this formulation. In addition, we also present which has several nice features a heuristic approach, which incorporates a method to augment the logical topology with additional links to guarantee a survivable routing, which only requires a shortest path algorithm and an algorithm to generate an appropriate spanning tree. We provide the results of extensive simulations conducted to evaluate our formulations and demonstrate the effectiveness of our new approach.

AB - The survivable logical topology mapping (routing) problem in IP-over-wavelength-division multiplexing networks is to map each link in the logical topology (IP layer) onto a lightpath in the physical topology (optical layer), such that failure of a physical link does not cause the logical topology to become disconnected. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. We present necessary and sufficient conditions based on this concept and study three optimization problems with varying degrees of difficulty. We study a generalized logical routing problem with the objective to protect the logical topology against maximal number of physical link failures. The new problem aims to find a survivable routing if one exists, or achieve maximal protection of physical link failures otherwise. We also show that the problem is equivalent to the minimum dominating set problem in bipartite graphs. We discuss how one can use the column generation technique to speed up the execution of this formulation, which obviates the need to find all spanning trees at the beginning of the execution of this formulation. In addition, we also present which has several nice features a heuristic approach, which incorporates a method to augment the logical topology with additional links to guarantee a survivable routing, which only requires a shortest path algorithm and an algorithm to generate an appropriate spanning tree. We provide the results of extensive simulations conducted to evaluate our formulations and demonstrate the effectiveness of our new approach.

UR - http://www.scopus.com/inward/record.url?scp=85010674926&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010674926&partnerID=8YFLogxK

U2 - 10.1109/TNET.2016.2639362

DO - 10.1109/TNET.2016.2639362

M3 - Article

AN - SCOPUS:85010674926

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

ER -