| S. Lumetta, M. Medard, "Towards a Deeper Understanding of Link Restoration Algorithms for Mesh Networks", in Proc. of IEEE Infocom |
....is supposed to go through the failed link) is rerouted over a set of replacement paths through the spare capacity of a network between the two nodes terminating the failed link. Path restoration reroutes the a#ected tra#c over a set of replacement paths between their source and destination nodes [1 5]. The obvious advantages of using the link restoration strategy are simplicity and ability to rapidly recover from failure events. However, as we will show later, the amount of spare capacity needed for the link based scheme is significantly greater than that of path based restoration since the ....
Lumetta SS, Medard M. Towards a deeper understanding of link restoration algorithms for mesh networks. In Proceedings of INFOCOM '01, vol. 1, 2001; 367--375.
....supposed to go through the failed link) is rerouted over a set of replacement paths through the spare capacity of a network between the two nodes terminating the failed link. Path restoration reroutes the affected traffic over a set of replacement paths between their source and destination nodes [1, 2, 3, 5, 6]. The obvious advantages of using the link restoration strategy are simplicity and ability to repidly recover from failure events. However, as we will show later, the amount of spare capacity needed for the link based scheme is significantly greater than that of path based restoration since the ....
S.S. Lumetta and M. Medard, "Towards a deeper understanding of link restoration algorithms for mesh networks," in Proceedings of INFOCOM '01, vol. 1, pp. 367-375, 2001.
....supposed to go through the failed link) is rerouted over a set of replacement paths through the spare capacity of a network between the two nodes terminating the failed link. Path restoration reroutes the affected traffic over a set of replacement paths between their source and destination nodes [1, 2, 3, 5, 6]. The obvious advantages of using the link restoration strategy are simplicity and ability to rapidly recover from failure events. However, as we will show later, the amount of spare capacity needed for the link based scheme is significantly greater than that of path based restoration since the ....
S.S. Lumetta and M. Medard, "Towards a deeper understanding of link restoration algorithms for mesh networks," in Proceedings of INFOCOM '01, vol. 1, pp. 367-375, 2001.
....di segnalazione associata al OCh) e del loro tracciato diventano fondamentali in quanto gli OXC devono riconfigurarsi ed effettuare operazioni di instradamento che variano in base al working lightpath da recuperare. A livello OMS la link protection pu essere attuata sulle reti mesh in vari modi [8]. E a volte preferita rispetto alla path protection per una maggiore facilit di controllo e per il fatto che la link protection, essendo a recovery locale, si adatta meglio al controllo distribuito piuttosto che centralizzato. A parte la link protection basata su provisioning, di cui non ....
S.S. Lumetta, M. M dard, Toward a deeper understanding of link restoration algorithms for mesh netwoks , INFOCOM 01, vol. 1, pp. 367-375, 2001.
....(Fig. 8) under some aspects can be preferable to path protection. In a complex topology, a local recovery mechanism, more suitable to distributed than to centralized control, is easier to manage than an end to end mechanism. Link protection on a mesh network can be carried out in various ways [22,26]. We will not consider link protection based on provisioning. Rather, we are going to describe the two Fig. 8. Link protection in a mesh network. All the lightpaths crossing a link (a) are rerouted on a common protection route (b) when the link is down. 260 main known approaches to preplanned ....
S. S. Lumetta, M. Medard, Toward a deeper understanding of link restoration algorithms for mesh networks, in: Proc. IEEE INFOCOM'01 (Anchorage, AL, April 2001), vol. 1, pp. 367-375.
No context found.
S. S. Lumetta and M. M edard, "Towards a deeper understanding of link restoration algorithms for mesh networks," Proceedings of IEEE INFOCOM, vol. 1, pp. 367-375, 2001.
No context found.
S. S. Lumetta and M. Medard, "Towards a Deeper Understanding of Link Restoration Algorithms for Mesh Networks," in Proc. of INFOCOM, Anchorage, Alaska, April 2001.
No context found.
S. Lumetta, M. Medard, "Towards a Deeper Understanding of Link Restoration Algorithms for Mesh Networks", in Proc. of IEEE Infocom
No context found.
S. Lumetta and M. Medard, "Towards a deeper understanding of link restoration algorithms for mesh networks," in Proceedings of IEEE INFOCOM '01.
No context found.
S. Lumetta, M. Medard, "Towards a Deeper Understanding of Link Restoration Algorithms for Mesh Networks", in Proc. of IEEE Infocom
No context found.
S.S. Lumetta and M. Medard, "Towards a deeper understanding of link restoration algorithms for mesh networks," in Proceedings of INFOCOM '01, vol. 1, pp. 367-375, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC