Graphs and algorithms
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics
Topology aggregation for hierarchical routing in ATM networks
ACM SIGCOMM Computer Communication Review
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithm and Neural Network Approaches to Local Access Network Design
MASCOTS '94 Proceedings of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Connection-oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks
Connection-oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks
Survivable IP network design with OSPF routing
Networks - Special Issue on Multicommodity Flows and Network Design
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
Quality-of-Service routing with path information aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Recovery Techniques in Next Generation Networks
IEEE Communications Surveys & Tutorials
On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains
IEEE Communications Magazine
Lightpath restoration in WDM optical networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
A challenge in network management and control is the ability to account for multi-domain requirements in the network planning process. Especially in Connection Oriented Networks where multi-domain path finding is a critical issue, networks need to be designed in such a manner as to restrict the possibility of erroneous inter-domain path selection. In this paper we propose per-domain topology design considerations that would leverage accurate disjoint path computations in a multi-domain environment, covering requirements of end-to-end path resiliency. In multi-domain environments state information between domains is heavily aggregated, hiding internal topology details dictated by scalability concerns, but also by restrictive domain administration policies for privacy, and security. Disjoint path finding is strongly affected by the aggregation techniques, since they do not provide information on path overlap. To handle this issue we introduce a metric, the Overlap Factor (OF), that quantifies path overlap in domains. The OF can be passed as an additional parameter of the inter-domain information exchange model to evaluate disjoint end-to-end paths. Alternatively, if domains were appropriately designed, this additional parameter might not be needed in evaluating resilient pairs of inter-domain paths. We based our recommended topology design algorithm on exploiting locally known OF values within the context of Genetic Algorithms. Extensive simulations confirm that domains designed using our proposed algorithm, result into accurate multi-domain disjoint path identification, with a high success ratio compared to networks that are designed without inter-domain considerations.