A Parameterized Distributed Unicast Routing Algorithm with end-to-end Delay Constraint
Résumé
QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the applications while efficiently using the network resources. As different minimizing objectives may conflict together during paths construction, most proposed algorithms use, in a way or in an other, a predefined priority order between different QoS parameters. In this paper we present a parameterized distributed algorithm for unicast routing with end-to-end delay constraint. Our protocol stokes a balance between delay minimization and cost minimization using a simple but efficient parameterized mechanism. During route construction, intermediate routers use a parameterized selection function to select the best possible path among the least delay path and least cost path. Simulation shows that using adequate selection function we can construct efficient paths in terms of end-to-end delay and total cost.