Data networks
Performance comparison of routing protocols under dynamic and static file transfer connections
ACM SIGCOMM Computer Communication Review
Telecommunications network design algorithms
Telecommunications network design algorithms
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Dynamic multi constraint multi path QoS routing algorithm (DMCMPRA)
WOC '08 Proceedings of the Eighth IASTED International Conference on Wireless and Optical Communications
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.24 |
Internet routing protocols, such as Open Shortest Path First (OSPF), compute a shortest path tree from each node to other nodes in the network, using link-state information. Such protocols do not consider the queueing situation at a given node. An alternate path of higher cost may be more convenient to use than the optimum path when a long queue is present at the node. This paper proposes a new Multiple Path Routing Algorithm (MPRA), which uses dynamic shortest path tree mechanisms, load balancing among alternative paths to destination, and path feasibility analysis to avoid network loops. A better-cost model is also introduced. Computer simulations show that MPRA measured parameters (throughput, packet delay, etc.) improve over OSPF by amounts close to 30% for unbalanced networks, and close to 20% for balanced networks.