Selection of switching sites in all-optical network topology design

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

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

Abstract

In this paper, we consider the problem of topology design for both unprotected and one-link protected all-optical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The cost of an optical network is expressed as a sum of three main factors: the site cost, the link cost, and the switch cost. For unprotected networks with linear cost model, we present a mixed integer linear programming (MILP) formulation of the problem. We also present an efficient heuristic to approximate the solution. The experimental results show good performance of the linear cost model heuristic. In 16% of the experiments with 10 nodes network topologies, the linear cost model heuristic had no error. Moreover, for 54% and 86% of the experiments with 10 nodes network topologies, the linear cost model heuristic's solution is within 2% and 5% of its optimal value respectively. Finally, we extend our approach to one-link protected networks, and present an efficient survivable heuristic, and representative experimental results.

Original languageEnglish (US)
Title of host publicationProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010
Pages278-284
Number of pages7
DOIs
StatePublished - Dec 1 2010
EventIASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010 - Marina Del Rey, CA, United States
Duration: Nov 8 2010Nov 10 2010

Publication series

NameProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
ISSN (Print)1027-2658

Conference

ConferenceIASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010
CountryUnited States
CityMarina Del Rey, CA
Period11/8/1011/10/10

Fingerprint

Fiber optic networks
Topology
Costs
Linear programming
Experiments
Switches

Keywords

  • Linear programming
  • Mixed integer
  • Network optimization
  • Optical networks
  • Switching site

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Saha, S., Manley, E. D., & Deogun, J. S. (2010). Selection of switching sites in all-optical network topology design. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010 (pp. 278-284). (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems). https://doi.org/10.2316/P.2010.724-003

Selection of switching sites in all-optical network topology design. / Saha, Shivashis; Manley, Eric D.; Deogun, Jitender S.

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010. 2010. p. 278-284 (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems).

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

Saha, S, Manley, ED & Deogun, JS 2010, Selection of switching sites in all-optical network topology design. in Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 278-284, IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010, Marina Del Rey, CA, United States, 11/8/10. https://doi.org/10.2316/P.2010.724-003
Saha S, Manley ED, Deogun JS. Selection of switching sites in all-optical network topology design. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010. 2010. p. 278-284. (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems). https://doi.org/10.2316/P.2010.724-003
Saha, Shivashis ; Manley, Eric D. ; Deogun, Jitender S. / Selection of switching sites in all-optical network topology design. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010. 2010. pp. 278-284 (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems).
@inproceedings{c5e9f5b1bb2f4642aed2ab4fbb259c64,
title = "Selection of switching sites in all-optical network topology design",
abstract = "In this paper, we consider the problem of topology design for both unprotected and one-link protected all-optical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The cost of an optical network is expressed as a sum of three main factors: the site cost, the link cost, and the switch cost. For unprotected networks with linear cost model, we present a mixed integer linear programming (MILP) formulation of the problem. We also present an efficient heuristic to approximate the solution. The experimental results show good performance of the linear cost model heuristic. In 16{\%} of the experiments with 10 nodes network topologies, the linear cost model heuristic had no error. Moreover, for 54{\%} and 86{\%} of the experiments with 10 nodes network topologies, the linear cost model heuristic's solution is within 2{\%} and 5{\%} of its optimal value respectively. Finally, we extend our approach to one-link protected networks, and present an efficient survivable heuristic, and representative experimental results.",
keywords = "Linear programming, Mixed integer, Network optimization, Optical networks, Switching site",
author = "Shivashis Saha and Manley, {Eric D.} and Deogun, {Jitender S.}",
year = "2010",
month = "12",
day = "1",
doi = "10.2316/P.2010.724-003",
language = "English (US)",
isbn = "9780889868786",
series = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems",
pages = "278--284",
booktitle = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010",

}

TY - GEN

T1 - Selection of switching sites in all-optical network topology design

AU - Saha, Shivashis

AU - Manley, Eric D.

AU - Deogun, Jitender S.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - In this paper, we consider the problem of topology design for both unprotected and one-link protected all-optical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The cost of an optical network is expressed as a sum of three main factors: the site cost, the link cost, and the switch cost. For unprotected networks with linear cost model, we present a mixed integer linear programming (MILP) formulation of the problem. We also present an efficient heuristic to approximate the solution. The experimental results show good performance of the linear cost model heuristic. In 16% of the experiments with 10 nodes network topologies, the linear cost model heuristic had no error. Moreover, for 54% and 86% of the experiments with 10 nodes network topologies, the linear cost model heuristic's solution is within 2% and 5% of its optimal value respectively. Finally, we extend our approach to one-link protected networks, and present an efficient survivable heuristic, and representative experimental results.

AB - In this paper, we consider the problem of topology design for both unprotected and one-link protected all-optical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The cost of an optical network is expressed as a sum of three main factors: the site cost, the link cost, and the switch cost. For unprotected networks with linear cost model, we present a mixed integer linear programming (MILP) formulation of the problem. We also present an efficient heuristic to approximate the solution. The experimental results show good performance of the linear cost model heuristic. In 16% of the experiments with 10 nodes network topologies, the linear cost model heuristic had no error. Moreover, for 54% and 86% of the experiments with 10 nodes network topologies, the linear cost model heuristic's solution is within 2% and 5% of its optimal value respectively. Finally, we extend our approach to one-link protected networks, and present an efficient survivable heuristic, and representative experimental results.

KW - Linear programming

KW - Mixed integer

KW - Network optimization

KW - Optical networks

KW - Switching site

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

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

U2 - 10.2316/P.2010.724-003

DO - 10.2316/P.2010.724-003

M3 - Conference contribution

AN - SCOPUS:84858668901

SN - 9780889868786

T3 - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

SP - 278

EP - 284

BT - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010

ER -