Skip to Main Content
ASME Press Select Proceedings

International Conference on Instrumentation, Measurement, Circuits and Systems (ICIMCS 2011)

By
Chen Ming
Chen Ming
Search for other works by this author on:
ISBN:
9780791859902
No. of Pages:
1400
Publisher:
ASME Press
Publication date:
2011

This paper presents one adaptive path selection scheme for dynamic traffic grooming in the DWDM networks. With using of this scheme, the network can tackle the propagation of congestion problem caused by excessive utilization of alternate path in IP/MPLS layer in IP/MPLS over WDM network model, which was nearly not concerned by route scheme in traditional traffic grooming research, herein the presented scheme is deployed to deal with this problem by employing a cost function which is designed to assign cost weight to each existed lightpath and each new lightpath that needed to be set up to serve the newly arrived LSP request, and then shortest path algorithm takes the weighted integrated topology as input and returns a path with least cost for the LSP request to be deployed. The scheme and traditional traffic grooming policy by extensive simulation are compared, and the result shows an improvement in block rate under different traffic models.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal