Queuing delay aware path selection algorithm as extension to OSPF
| Autor: | J P Ashwini, H. A. Sanjay, M Sushma |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
business.industry
Computer science Distributed computing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Open Shortest Path First Flooding (computer networking) Link-state routing protocol Shortest path problem Queuing delay K shortest path routing business Dijkstra's algorithm Constrained Shortest Path First Computer network |
| Zdroj: | 2011 3rd International Conference on Electronics Computer Technology. |
| DOI: | 10.1109/icectech.2011.5942059 |
| Popis: | OSPF — Open Shortest Path First is an intra domain routing protocol used to find the shortest path from source to destination. OSPF is one of the most widely used link state routing algorithm which uses hop count as the only parameter to find the shortest path. Provisioning of QoS to OSPF will effectively improve the performance of the network. Some of the QoS parameters that can be considered are bandwidth, delay etc. This work proposes extension to OSPF by considering one of the QoS parameter queuing delay. The modified version of path selection algorithm will consider hop count and queuing delay while finding routes in IP network. The link advertisement mechanisms of OSPF and Dijkstra's algorithm are retained so that minimum changes will be done to the existing algorithm. Results shows there is decrease in queuing delay by 10 to 40% over existing OSPF. Also we observed that the queuing load is distributed equally among all the nodes in the network. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|