Information Technology Reference
In-Depth Information
Table 3.
Average restoration times for three protection schemes
path protection
region protection
link protection
average restoration times [ms]
47,92
43,79
23,98
95% confidence interval [ms]
1,54
1,71
1,07
1,2
1
0,75
0,8
0,5
0,25
0,4
0
1
21
41
61
81
101
121
141
0
restoration time [ms]
path
protection
region
protection
link
protection
path protection
region protection
link protection
Fig. 6.
Relative network resource utiliza-
tion ratio per connection for all three pro-
tection schemes
Fig. 7.
Cumulative distribution function of
restoration time depending on protection
model
5 Conclusions
Our results prove that region protection approach is the best way of keeping both
restoration times and network resource utilization at the acceptable level.
Concluding the paper, we point out that one cannot simultaneously have the short-
est restoration times and the smallest ratio of network resource utilization. One of
these two factors plays against the second one and vice-versa. If they are of the same
importance, the best solution is to use a region protection model, which provides the
medium values of both restoration time values and network resource utilization.
References
1.
Andersen, R., Chung, F., Sen, A., Xue, G.: On disjoint path pairs with wavelength continu-
ity constraint in WDM networks. Proc. INFOCOM (2004) 524-535
2.
Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik,
1, (1959) 269-271
3.
Kodialam, M., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with
restoration. Proc. INFOCOM (2000) 902-911
4.
Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks, Part I - protection.
Proc. IEEE INFOCOM (1999) 744-751
5.
Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks, Part II - restoration.
Proc. IEEE-ICC, Vol.3 (1999) 2023-2030
6.
Suurballe, J.W.: Disjoint paths in a network. Networks, John Willey & Sons (1974) 125-145
7.
Xiong, Y, Mason, L.G.: Comparison of two path restoration schemes in self-healing net-
works. Computer Networks 38 (2002) 663-674
