A Scalable QoS-Based Routing Mechanism for Supporting Multimedia Applications

Authors:
Luis Henrique Maciel Kosmalski Costa;Otto Carlos Muniz Bandeira Duarte
Affiliations:
Universite Pierre et Marie Curie and Universidade Federal do Rio de Janeiro;Universidade Federal do Rio de Janeiro
Venue:
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Year:
1999

Citing 0
Cited 3

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
Distance-Vector QoS-Based Routing with Three Metrics

NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
WiMAX integration in NGN network, architecture, protocols and services

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a scalable algorithm for Quality of Service (QoS) based routing. This type of routing is one of the main components for supporting new multimedia applications in the Internet. The algorithm takes into account the available bandwidth, the transmission delay and the packet loss probability for each link in route computation. This three-metric algorithm is as complex as a two-metric algorithm and provides a better characterization of application requirements. The mechanism was implemented using a network simulator and the results obtained are 25% better than the classical approach.