
Reliable Routings in Networks with Generalized Link Failure Events
Author(s) -
Shailesh Kumar,
M. Siddappa
Publication year - 2011
Publication title -
international journal of smart sensors and ad hoc networks
Language(s) - English
Resource type - Journals
ISSN - 2248-9738
DOI - 10.47893/ijssan.2011.1017
Subject(s) - link (geometry) , disjoint sets , computer science , backup , path (computing) , computer network , distributed computing , link layer , mathematics , combinatorics , database , network packet
Traditional methods for ensuring reliable transmissions in circuit- switched networks rely on the pre computation of a backup path for every working path or for every network link These methods work fine as long as the network experiences only single link failures. They do not guarantee undisturbed communication, however, in the case of multiple link failures. Such failures are not seldom and often are correlated: a single failure in the physical network (a cut in the conduit carrying wiring or fibers used for several links) results in several failures in the abstract network layer (see for a discussion on multiple link failures).This type of link failures can be modeled using the notion of generalized failure events. A single generalized failure leads to the failure of several links in the network. Links that belong to the same failure even are also said to be in the same shared risk link group. Recent research has focused on the problem of computing, for a given pair of nodes, tworisk-disjoint paths, i.e., two paths that do not share links that belong tothe same generalized failure event.