K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route ows. IEEE/ACM Transactions on Networking, 11:772-781, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Computing QoS Paths with Restoration - Bejerano, Breitbart, Orda, .. (2002) (3 citations) (Correct)
....(see, e.g. 3] 13] 15] 16] and references therein) However, none of the prior studies on QoS routing consider the problem of provisioning QoS paths with restoration. Similarly, path restoration and routing over alternate paths has also attracted a large body of research (see, e.g. 7] [8], 9] 10] 11] Most of the proposed solutions, however, consider only bottleneck QoS constraints. The few studies that do consider additive constraints, focus on heuristic approaches and do not provide proven performance guarantees. Bottleneck QoS constraints can be efficiently handled by ....
K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. In Proceedings of IEEE INFOCOM'02, New York, NY, June 2002.
Decentralized Local Backup LSP Calculation with Efficient.. - Mélon, Blanchy, Leduc (2003) (Correct)
....is the backup path. In the 1 1 scheme both paths are used simultaneously : all packets are duplicated at the ingress and sent on both paths. The egress node continuously monitors both inputs and selects the best one. This way of ensuring protection is of course very costly in terms of bandwidth. [6] presents an approach to limit the cost of the 1 1 protection. In the 1:1 scheme, only the primary path is used to forward packets while the backup path is in standby mode. If a failure occurs, a message is sent to the ingress which switch the backup and the primary path. The advantage of the ....
Koushik Kar, Murali Kodialam, and T.V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. In Proceeding of IEEE INFOCOM 2002.
A Simple Combinatorial Proof of Duality of Multiroute .. - Bagchi, Chaudhary.. (2004) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route ows. IEEE/ACM Transactions on Networking, 11:772-781, 2003.
Efficient Algorithms for Computing Disjoint QoS Paths - Orda, Sprintson (2004) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman, "Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows," in Proceedings of IEEE INFOCOM'2002.
A Simple Combinatorial Proof of Duality of Multiroute.. - Bagchi, Chaudhary, Kolman (2004) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. IEEE/ACM Transactions on Networking, 11:772--781, 2003.
A Simple Combinatorial Proof of Duality of Multiroute .. - Bagchi, Chaudhary.. (2004) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route ows. IEEE/ACM Transactions on Networking, 11:772-781, 2003.
A Simple Combinatorial Proof of Duality of Multiroute .. - Bagchi, Chaudhary.. (2004) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route ows. IEEE/ACM Transactions on Networking, 11:772-781, 2003.
A Simple Combinatorial Proof of Duality of Multiroute .. - Bagchi, Chaudhary.. (2004) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. IEEE/ACM Transactions on Networking, 11:772--781, 2003.
Algorithms for Computing QoS Paths with Restoration - Bejerano, Breitbart, Orda, .. (2002) (3 citations) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. In Proceedings of IEEE INFOCOM'02, New York, NY, June 2002.
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