Routing in the Internet
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Evaluating the Overheads of Source-Directed Quality-of-Service Routing
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
A Scalable QoS-Based Routing Mechanism for Supporting Multimedia Applications
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
QoS-based routing of multimedia streams in computer networks
IEEE Journal on Selected Areas in Communications
Distributed, scalable routing based on vectors of link states
IEEE Journal on Selected Areas in Communications
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
Developing scalable protocols for three-metric QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multiconstraint QoS Routing Using a Path-Vector Protocol
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
| Hi-index | 0.00 |
Quality of Service (QoS) based routing provides QoS guarantees to multimedia applications and an efficient utilization of the network resources. Nevertheless, QoS routing is likely to be a costly process that does not scale when the number of nodes increases. Thus, the routing algorithm must be simple and a class-of-service routing is an alternative to provide QoS guarantees instead of per-flow routing. This paper proposes and analyzes the performance of a distance-vector QoS routing algorithm that takes into account three metrics: propagation delay, available bandwidth, and loss probability. Classes of service and metric-combination are used to turn the algorithm scalable and as complex as a two-metric one. The processing requirements of the proposed algorithm and those of an optimal approach are compared and the results show an improvement up to 50%