Solving k-shortest and constrained shortest path problems efficiently
Annals of Operations Research
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Analysis, modeling and generation of self-similar VBR video traffic
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Performance evaluation of a queue fed by a Poisson Pareto burst process
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
Fractal traffic: measurements, modelling and performance evaluation
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
A quantitative measure for telecommunications networks topology design
IEEE/ACM Transactions on Networking (TON)
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
Studies on a Next Generation Access Technology Using Radio over Free-Space Optic Links
NGMAST '08 Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies
Optimization of urban optical wireless communication systems
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
IEEE Spectrum
Broadband traffic modeling: simple solutions to hard problems
IEEE Communications Magazine
Optical wireless: the story so far
IEEE Communications Magazine
Building reliable MPLS networks using a path protection mechanism
IEEE Communications Magazine
Flexible optical wireless links and networks
IEEE Communications Magazine
High-speed integrated transceivers for optical wireless
IEEE Communications Magazine
QoS online routing and MPLS multilevel protection: a survey
IEEE Communications Magazine
Urban optical wireless communication networks: the main challenges and possible solutions
IEEE Communications Magazine
A practical approach to operating survivable WDM networks
IEEE Journal on Selected Areas in Communications
Logical topology design for linear and ring optical networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Autonomous Reconfiguration in Free-Space Optical Sensor Networks
IEEE Journal on Selected Areas in Communications
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Optical wireless networks have appealing features such as very high broadband data rates and cost effectiveness. They represent a potential alternative to the last mile (first mile) wireless access problem. However, they are also highly vulnerable to external disturbances such as adverse weather and building sway. In this paper, we develop robust and efficient methods for outdoor optical wireless networks by jointly considering topology optimization and survivability strategies. We propose linearized congestion minimization schemes with working and protection paths (LCM-WP), in which a mixed integer linear program is formulated to choose the optimal working and protection paths for every OD pair such that the network congestion is minimized. In particular, the objective is to minimize the maximum amount of traffic on the links. To solve realistically sized problems, we consider a restricted version of the LCM-WP, in which only limited sets of candidate working and protection paths are considered. A simple algorithm is developed to find candidate working and protection paths for each origin-destination (OD) pair. Implementation of our LCM-WP schemes demonstrates the efficiency of our approach in terms of the number of constraints and solution time. It also shows that our approach is applicable to realistically sized networks.