Research Article
Single shortest path-based logical topologies for grooming IP traffic over wavelength-routed networks
@INPROCEEDINGS{10.1109/ICBN.2005.1589752, author={Gaurav Agrawal and Deep Medhi}, title={Single shortest path-based logical topologies for grooming IP traffic over wavelength-routed networks}, proceedings={2nd International ICST Conference on Broadband Networks}, publisher={IEEE}, proceedings_a={BROADNETS}, year={2006}, month={2}, keywords={}, doi={10.1109/ICBN.2005.1589752} }- Gaurav Agrawal
Deep Medhi
Year: 2006
Single shortest path-based logical topologies for grooming IP traffic over wavelength-routed networks
BROADNETS
IEEE
DOI: 10.1109/ICBN.2005.1589752
Abstract
We consider the problem of designing logical topologies for grooming IP traffic over wavelength-routed networks; in particular non-bifurcated minimum hop routing is used to route IP traffic. We present two approaches to solve this problem. The first approach is a two-step approach where in the first step we solve a mixed integer linear programming (MILP) formulation to determine an initial single shortest path logical topology; this is followed by a pruning approach to find an improved logical topology in the second step. Our second approach is a heuristic solution for moderate size networks. We then consider different performance measures to show the effectiveness of our solution approaches in generating minimum average packet hop-based logical topology
