Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Introduction to Linear Optimization
Introduction to Linear Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in optical networks
IEEE/ACM Transactions on Networking (TON)
Survivable embedding of logical topologies in WDM ring networks
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Photonics, networking & computing
Design of a Survivable WDM Photonic Network
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Survivable Routing in WDM Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Journal on Selected Areas in Communications
Design protection for WDM optical networks
IEEE Journal on Selected Areas in Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction
IEEE Journal on Selected Areas in Communications
Reliability in layered networks with random link failures
IEEE/ACM Transactions on Networking (TON)
Notions of connectivity in overlay networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails
IEEE/ACM Transactions on Networking (TON)
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |
In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may not be effective in multilayer networks. In this paper, we introduce the problem of maximizing the connectivity of layered networks. We show that connectivity metrics in layered networks have significantly different meaning than their single-layer counterparts. Results that are fundamental to survivable single-layer network design, such as the Max-Flow Min-Cut Theorem, are no longer applicable to the layered setting. We propose new metrics to measure connectivity in layered networks and analyze their properties. We use one of the metrics, Min Cross Layer Cut, as the objective for the survivable lightpath routing problem and develop several algorithms to produce lightpath routings with high survivability. This allows the resulting cross-layer architecture to be resilient to failures between layers.