Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Citations
15 citations
15 citations
Additional excerpts
...Several algorithms based on integer linear programming (ILP), or heuristic have existed [4]–[7], [10]–[15]....
[...]
14 citations
Cites background from "Optimal capacity placement for path..."
...They refer to the work of Murakami and Kim (1995), Saito et al. (1998) and Iraschko et al. (1998) on this problem....
[...]
14 citations
14 citations
Cites background or methods from "Optimal capacity placement for path..."
...This typically provides fast recovery from a failure, even though it is not as capacity efficient as path restoration [10,14,23]....
[...]
...The service capacity assignment problem in optical networks [13,17], and the restoration problem in other networks such as ATM [10,23], SONET [22], have also been extensively studied....
[...]
...1 which have been widely used as test networks in literature [10,17]: Network 1 (Arpanet with 20 nodes, 32 links), Network 2...
[...]
...area network [10]....
[...]
...The observations made in [10] from the integer programming solutions of the joint routing/restoration problem in ATM networks also support this intuition....
[...]
References
638 citations
233 citations
199 citations
193 citations
"Optimal capacity placement for path..." refers background or methods in this paper
...Previous work used an IP approach based on -flow -cut considerations to solve the spare capacity placement problem in a span-restorable network [4], [11], [20]....
[...]
...Issues related to the restoration mechanisms themselves are addressed in related works [1], [2], [4], [21], [27]....
[...]
180 citations