| V. Anand, and C. Qiao, "Dynamic Establishment of Protection Paths in WDM Networks ---Part I", Proc. ICCCN 2000, pp. 198--204. ThW2 2:15 pm Enhanced Algorithm Cost Model to Control tradeoffs in Provisioning Shared Mesh Restored Lightpaths Eric Bouillet, Jean-Franois Labourdette, Ramu Ramamurthy, and Sid Chaudhuri, Tellium, Inc. 185 Route 36 West Long Branch, NJ 07764 |
.... found through the traffic measurement that the user s perceived QoS is not satisfactory, then new wavelength paths are set up to increase the path bandwidth (i.e. the number of lightpaths) A heuristic algorithm for setting up primary and backup lightpaths on demand basis is already proposed in [5], in which routing and wavelength assignment are performed for each lightpath setup request. The authors in [5] allow backup lightpaths to be reconfigured in order to meet future lightpaths setup requests for an effective use of wavelengths. Their method is intended to be performed in a ....
....are set up to increase the path bandwidth (i.e. the number of lightpaths) A heuristic algorithm for setting up primary and backup lightpaths on demand basis is already proposed in [5] in which routing and wavelength assignment are performed for each lightpath setup request. The authors in [5] allow backup lightpaths to be reconfigured in order to meet future lightpaths setup requests for an effective use of wavelengths. Their method is intended to be performed in a distributed fashion. However, only a dedicated protection is considered in [5] As described above, the shared protection ....
[Article contains additional citation context not shown here]
V. Anand and C. Qiao, "Dynamic establishment of protection paths in WDM networks, part i," in Proceedings of the 9th IEEE International Conference on Computer Communications and Networks (IC3N 2000.
....routing analog of min hop routing. The focus of this paper is only on the no sharing case. Since we cannot achieve efficiency by sharing, our objective here is to improve performance by improved path selection. For some alternative approaches to this problem in the context of optical networks, see [3] and the references therein. For dynamic routing of non restorable connections, a recently proposed algorithm that performs very well is minimum interference routing [9] Here the idea is that a newly routed connection s path must not interfere too much with paths that might be critical to ....
V. Anand, C. Qiao, "Dynamic Establishment of Protection Paths in WDM Networks, Part I", Proc. of the 9th International Conference on Computer Communications (ICCCN '00), October 2000.
No context found.
V. Anand, and C. Qiao, "Dynamic Establishment of Protection Paths in WDM Networks ---Part I", Proc. ICCCN 2000, pp. 198--204. ThW2 2:15 pm Enhanced Algorithm Cost Model to Control tradeoffs in Provisioning Shared Mesh Restored Lightpaths Eric Bouillet, Jean-Franois Labourdette, Ramu Ramamurthy, and Sid Chaudhuri, Tellium, Inc. 185 Route 36 West Long Branch, NJ 07764
No context found.
V. Anand and C. Qiao, Dynamic establishment of protection paths in WDM networks, ICCCN2000, pp. 198--204.
No context found.
V. Anand and C. Qiao, "Dynamic establishment of protection paths in WDM networks, part i," in Proceedings of the 9th IEEE International Conference on Computer Communications and Networks (IC3N 2000), Oct. 2000.
No context found.
Vishal Anand, Chunming Qiao, "Dynamic Establishment of Protection Paths in WDM Networks: Part I", Proceedings, 9 th International Conference on Computer Communication and Networks (IC3N 300), pp.198-204
No context found.
Vishal Anand, Chunming Qiao, "Dynamic Establishment of Protection Paths in WDM Networks: Part I", Proceedings, 9 th International Conference on Computer Communication and Networks (IC3N 300), pp.198-204
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