A Virtual Node-based Shared Restoration scheme in multi-domain networks

Abstract

Existing restoration schemes require detailed link-state information to be advertised between the nodes in a given network. These schemes become less attractive to networks with multiple autonomous domains where network link-state information needs to be abstracted within each domain for efficiency and scalability reasons. In this paper, we present a distributed end-to-end shared restoration scheme, referred to as Virtual Node-based Shared Restoration (VNSR), which provides routing and shared restoration across multiple domains with limited information exchange among the domains. With this scheme, every domain is modeled as a single virtual node with a certain internal capacity that can be advertised to other domains. This minimum advertised information is used to compute a pair of link-disjointed paths between any given source and destination nodes across the domains. The performance of the proposed scheme is evaluated and compared with another published scheme, which modeled every domain as a set of virtual paths. We will show that the VNSR scheme is more scalable and efficient in terms of the routing overhead, while still yielding the same capacity performance, compared with the published scheme.

A Centralized Model for Establishing End-to-End Communication Services via Management Agents

“…The signalling message length equals 1,000 bytes. In the centralized model, it is supposed that the 3P agent is collocated Each administrative domain with its DMA is approximated as a virtual node, which is interconnected with the other domains (virtual nodes) by external links [25,26]. The original NS2 Distance Vector routing module is used, and equal costs of all links (cost=1) are adopted, which means that the traffic is routed over paths with the smallest number of hops.…”