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

Y1 - 2010

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

T2 - IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010

Y2 - 8 November 2010 through 10 November 2010

ER -