Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
DISTRIBUTED QOS ROUTING FOR MULTIMEDIA TRAFFIC Venkatesh Sarangan, Donna Ghosh and Raj Acharya
 

Summary: DISTRIBUTED QOS ROUTING FOR MULTIMEDIA TRAFFIC
Venkatesh Sarangan, Donna Ghosh and Raj Acharya
Department of Computer Science and Engineering,
State University of New York at Buffalo, NY 14260
(sarangan,donnag,acharya)@cse.buffalo.edu
ABSTRACT
The goal of QoS routing is to find a loopless path through a
network that can satisfy a given set of constraints on parame-
ters such as bandwidth, delay and cost. QoS routing algorithms
can be classified into three categories. They are Source routing,
Distributed routing and Hierarchical routing. In this paper we
propose a distributed QoS routing algorithm that gives high call
admission rates in a congested network for constraints on met-
rics like bandwidth, buffer, and CPU usage with a low message
complexity.
1. INTRODUCTION
Resource reservation is a necessity for providing guar-
anteed end-to-end performance for multimedia applications.
However in the present Internet setup, resource reservation
is not supported. Also, the data packets of these applications

  

Source: Acharya, Raj - Department of Computer Science and Engineering, Pennsylvania State University

 

Collections: Computer Technologies and Information Sciences