Data networks
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Efficient Max-Min Fair Routing Algorithms
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Hi-index | 0.00 |
This paper presents three mathematical formulations for designing robust two-layer networks carrying elastic traffic. The formulations differ in the way flow reconfiguration is performed in the case of link failures. An iterative algorithm to solve the problems is given and a numerical study is provided comparing the effectiveness of the three reconfiguration mechanisms. The formulations can be applied for designing Next Generation Internet (NGI) core networks with the two-layer, IP-over-WDM, structure.