Routing cost optimization in Multi Overlay Robust Networks
In the present work we solve the problem of data flow routing in Multi-Overlay Robust Networks (MORN) while aiming to minimize its routing cost. This kind of networks are typically IP/MPLS Data Network deployed over an SDH/DWDM transport infrastructure. Through the IP/MPLSMulti-Layer Data Network di...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/20.500.12008/24171 |
| Tags: |
No Tags, Be the first to tag this record!
|
| Summary: | In the present work we solve the problem of data flow routing in Multi-Overlay Robust Networks (MORN) while aiming to minimize its routing cost. This kind of networks are typically IP/MPLS Data Network deployed over an SDH/DWDM transport infrastructure. Through the IP/MPLSMulti-Layer Data Network different kinds of services having a wide variety of quality of service requirements are delivered. Those services are being transported by an SDH/DWDM Transport Network which has different transport capacities. In this network, routing cost depends not only on the assigned transport capacity but also in the technology that it uses. Our problem seeks not only to route data flows through Data and Transport Networks but also to optimize routing costs and the reliability of the network. The inputs of our problem are the topology of the Data and Transport networks as well as the budget that the network operator has in order to improve its network routing costs and reliability. We will assume that the operator can only use that budget for installing new links between existing transport nodes. The output of the problem is the data flow routing in the Data and Transport Networks and its associated cost. Routing in the Transport Network is calculated not only in the nominal scenario - when all the Transport Network links are up and running - but also in each single transport link failure case. |
|---|