Minimizing network cost in all-optical networks

Shivashis Saha, Eric D. Manley, Jitender S. Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

The problem of minimizing the total network cost of an optical network topology by efficient selection of switching sites, size of optical switches, and optical links is investigated in this paper. The problem investigated is NP hard. Therefore, we develop an efficient heuristic to approximate the solution in polynomial time. A mixed integer quadratic programming (MIQP) formulation of the problem is also presented to find the optimal network cost and compute the efficiency of the heuristic. The total network cost calculated by the heuristic in the experiments is within 19% of its optimal value. Moreover, the total network cost in half of the test problems is within 6% of its optimal value. The heuristic solves the problem with 20 node topologies in less than a second. However, the commercial optimization software can not solve any problem with more than 10 nodes even in two weeks.

Original languageEnglish (US)
Title of host publication2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009
DOIs
StatePublished - Dec 1 2009
Event2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009 - New Delhi, India
Duration: Dec 14 2009Dec 16 2009

Publication series

Name2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009

Conference

Conference2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009
CountryIndia
CityNew Delhi
Period12/14/0912/16/09

Fingerprint

Fiber optic networks
Costs
Topology
Optical links
Optical switches
Quadratic programming
Polynomials
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Saha, S., Manley, E. D., & Deogun, J. S. (2009). Minimizing network cost in all-optical networks. In 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009 [5409862] (2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009). https://doi.org/10.1109/ANTS.2009.5409862

Minimizing network cost in all-optical networks. / Saha, Shivashis; Manley, Eric D.; Deogun, Jitender S.

2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009. 2009. 5409862 (2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Saha, S, Manley, ED & Deogun, JS 2009, Minimizing network cost in all-optical networks. in 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009., 5409862, 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009, 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009, New Delhi, India, 12/14/09. https://doi.org/10.1109/ANTS.2009.5409862
Saha S, Manley ED, Deogun JS. Minimizing network cost in all-optical networks. In 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009. 2009. 5409862. (2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009). https://doi.org/10.1109/ANTS.2009.5409862
Saha, Shivashis ; Manley, Eric D. ; Deogun, Jitender S. / Minimizing network cost in all-optical networks. 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009. 2009. (2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009).
@inproceedings{a1162f00fcd94e33887749b05cf51a78,
title = "Minimizing network cost in all-optical networks",
abstract = "The problem of minimizing the total network cost of an optical network topology by efficient selection of switching sites, size of optical switches, and optical links is investigated in this paper. The problem investigated is NP hard. Therefore, we develop an efficient heuristic to approximate the solution in polynomial time. A mixed integer quadratic programming (MIQP) formulation of the problem is also presented to find the optimal network cost and compute the efficiency of the heuristic. The total network cost calculated by the heuristic in the experiments is within 19{\%} of its optimal value. Moreover, the total network cost in half of the test problems is within 6{\%} of its optimal value. The heuristic solves the problem with 20 node topologies in less than a second. However, the commercial optimization software can not solve any problem with more than 10 nodes even in two weeks.",
author = "Shivashis Saha and Manley, {Eric D.} and Deogun, {Jitender S.}",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/ANTS.2009.5409862",
language = "English (US)",
isbn = "9781424459896",
series = "2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009",
booktitle = "2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009",

}

TY - GEN

T1 - Minimizing network cost in all-optical networks

AU - Saha, Shivashis

AU - Manley, Eric D.

AU - Deogun, Jitender S.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - The problem of minimizing the total network cost of an optical network topology by efficient selection of switching sites, size of optical switches, and optical links is investigated in this paper. The problem investigated is NP hard. Therefore, we develop an efficient heuristic to approximate the solution in polynomial time. A mixed integer quadratic programming (MIQP) formulation of the problem is also presented to find the optimal network cost and compute the efficiency of the heuristic. The total network cost calculated by the heuristic in the experiments is within 19% of its optimal value. Moreover, the total network cost in half of the test problems is within 6% of its optimal value. The heuristic solves the problem with 20 node topologies in less than a second. However, the commercial optimization software can not solve any problem with more than 10 nodes even in two weeks.

AB - The problem of minimizing the total network cost of an optical network topology by efficient selection of switching sites, size of optical switches, and optical links is investigated in this paper. The problem investigated is NP hard. Therefore, we develop an efficient heuristic to approximate the solution in polynomial time. A mixed integer quadratic programming (MIQP) formulation of the problem is also presented to find the optimal network cost and compute the efficiency of the heuristic. The total network cost calculated by the heuristic in the experiments is within 19% of its optimal value. Moreover, the total network cost in half of the test problems is within 6% of its optimal value. The heuristic solves the problem with 20 node topologies in less than a second. However, the commercial optimization software can not solve any problem with more than 10 nodes even in two weeks.

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

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

U2 - 10.1109/ANTS.2009.5409862

DO - 10.1109/ANTS.2009.5409862

M3 - Conference contribution

AN - SCOPUS:77950290285

SN - 9781424459896

T3 - 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009

BT - 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009

ER -