DocumentCode
1984604
Title
Fast Heuristic Algorithm for Joint Topology Design and Load Balancing in FSO Networks
Author
Son, In Keun ; Mao, Shiwen
Author_Institution
Dept. of Electr. & Comput. Eng., Auburn Univ., Auburn, AL, USA
fYear
2010
fDate
6-10 Dec. 2010
Firstpage
1
Lastpage
5
Abstract
We investigate the challenging problem of joint topology design and load balancing in FSO networks. Important factors such as FSO link characteristics, cost constraints, traffic characteristics, traffic demand, and QoS requirements are considered in the problem formulation, along with objective functions of network-wide average traffic load and delay. We develop a fast heuristic algorithm to provide highly competitive solutions. The heuristic algorithm iteratively perturbs the current topology and computes network flows for the new topology, thus progressively improving the configuration and load balancing of the FSO network. Our simulation results show that the heuristic algorithm can achieve an optimality gap close to that of a branch-and-bound algorithm developed in our prior work, with significantly reduced computation time. The heuristic algorithm is complementary to the branch-and-bound algorithm. Jointly applying the algorithms can make the FSO network dynamically reconfigurable and adaptive to events occurring at both large and small timescales.
Keywords
iterative methods; optical links; resource allocation; telecommunication network topology; telecommunication traffic; tree searching; FSO link; FSO networks; QoS; branch-and-bound algorithm; free space optics networks; heuristic algorithm; iterative method; load balancing; network-wide average traffic load; topology design; traffic delay; Algorithm design and analysis; Delay; Heuristic algorithms; Load management; Network topology; Routing; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Conference_Location
Miami, FL
ISSN
1930-529X
Print_ISBN
978-1-4244-5636-9
Electronic_ISBN
1930-529X
Type
conf
DOI
10.1109/GLOCOM.2010.5683330
Filename
5683330
Link To Document