References in periodicals archive ?
The network is modeled by an undirected graph and each SRLG is modeled by a color assigned to some of the edges of this graph.
As said in the introduction, we model a SRLG by a color, and we will abuse the notations denoting C both the set of all colors and the coloring function associating an edge with the colors (SRLGs) it belongs to.
As already said, in the SRLG context the reliability of a link is measured by the SRLGs it belongs to, that is the number of colors associated to the edge representing the link.
In the SRLG context, the working and protection paths must not only be edge disjoint, but also SRLG disjoint.
Notice that in the SRLG context, the max flow - min cut relation (i.e., the maximum number of edge disjoint st-paths equals the minimum st-cut) does not hold.
In this section, we concentrate on optimization problems in mono-colored graphs (an edge has a unique color or SRLG).
The AND transformation corresponds to the natural interpretation of the colors as SRLGs: the failure of a single SRLG is sufficient to break a link.
(2007) have generated a large set of benchmark random instances (topology and SRLGs): the topologies are random directed graphs; each arc is assigned a single SRLG; in these instances, denoted [T.sub.1] - i, each SRLG corresponds to an adjacent subset of arcs (i.e.
When no two SRLG disjoint paths exists between s and t, we compute the pair of paths minimizing the number of common SRLGs (see e.g.
Indeed, the 2-CDP problem is NP-Complete as soon as one SRLG has span > 1 (Theorem 3) or when all SRLGs are stars (Bermond et al.
A novel survivable routing algorithm with partial shared-risk link groups (SRLG)-disjoint protection based on differentiated reliability constraints in WDM optical mesh networks.
A new shared-risk link groups (SRLG)-disjoint path provisioning with shared protection in WDM optical networks.
Acronyms browser ?
Full browser ?
- SRK formula