Optical Network Design with Optical Constraints in IP/WDM Networks
Summary :
In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.5 pp.1898-1905
- Publication Date
- 2005/05/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.5.1898
- Type of Manuscript
- Special Section PAPER (Joint Special Section on Recent Progress in Optoelectronics and Communications)
- Category
- Optical Network Architecture
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kwangil LEE, Mark A. SHAYMAN, "Optical Network Design with Optical Constraints in IP/WDM Networks" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 5, pp. 1898-1905, May 2005, doi: 10.1093/ietcom/e88-b.5.1898.
Abstract: In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.5.1898/_p
Copy
@ARTICLE{e88-b_5_1898,
author={Kwangil LEE, Mark A. SHAYMAN, },
journal={IEICE TRANSACTIONS on Communications},
title={Optical Network Design with Optical Constraints in IP/WDM Networks},
year={2005},
volume={E88-B},
number={5},
pages={1898-1905},
abstract={In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching.},
keywords={},
doi={10.1093/ietcom/e88-b.5.1898},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Optical Network Design with Optical Constraints in IP/WDM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1898
EP - 1905
AU - Kwangil LEE
AU - Mark A. SHAYMAN
PY - 2005
DO - 10.1093/ietcom/e88-b.5.1898
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2005
AB - In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching.
ER -
English
