Optical network design to minimize switching and transceiver equipment costs

Authors:
Benjamin K. Chen;Fouad A. Tobagi
Affiliations:
Department of Electrical Engineering, Stanford University, Stanford, CA 94305, United States;Department of Electrical Engineering, Stanford University, Stanford, CA 94305, United States
Venue:
Optical Switching and Networking
Year:
2009

Citing 6
Cited 1

Optical networks: a practical perspective

Optical networks: a practical perspective
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
An exact algorithm for the maximum leaf spanning tree problem

Computers and Operations Research
A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree

A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree
Routing of Video/Audio Streams In Packet-Switched Networks

Routing of Video/Audio Streams In Packet-Switched Networks

Self-healing in transparent optical packet switching mesh networks: A reinforcement learning perspective

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a network consisting of N nodes and a certain number of links M that could be used to interconnect these nodes. The problem we address is to determine the smallest subset of switching nodes (in which to provide optical or electronic switching capability) necessary and sufficient to provide full end-to-end connectivity among all nodes. It is shown that this selection leads to the minimum number of transceivers needed to achieve full connectivity. We then address the same problem with the additional requirement of survivability, whereby the failure of any one link does not lead to any disconnection in the network. To solve the above stated problems, we employ heuristic and optimal algorithms; we find that the minimum number of switching sites is well estimated as a function of a single parameter, the network connectivity @a=2MN(N-1). (This is an extended version of the paper presented at Broadnets 2006.)