Abstract

Free-space optical networks have emerged as a viable technology for broadband wireless backbone networks of the next generation. In this paper, we investigate the challenging problem of joint topology design and load balancing in FSO networks. We consider FSO link characteristics, cost constraints, traffic characteristics, traffic demand, and QoS requirements in the formulation, along with various objective functions including network-wide average load and delay. We apply the reformulation–linearization technique (RLT) to obtain linear programming (LP) relaxations of the original complex problem, and then incorporate the LP relaxations into a branch-and-bound framework. The proposed algorithm can produce highly competitive solutions with the performance guarantees in the form of bounded optimality gap. For reducing computation complexity, we also 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. The proposed algorithms are complementary to each other, since jointly applying the algorithms can make the FSO network dynamically adaptive to events occurring at both large and small timescales. The proposed algorithms are evaluated with extensive simulations. Our simulation results show that the heuristic algorithm can achieve an optimality gap close to that of the branch-and-bound algorithm, with significantly reduced computation time.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.