Analysis of QoS Routing Approach and the starvation evaluation in LAN
This paper gives a survey in QoS Routing Architecture
implemented by Dijkstra`s algorithm. The performance of QoS
Routing architecture is evaluated by made a comparison between
the Shortest Path Routing and QoS one. A very important feature
in QoS routing are the conditions for elimination of starvation.
Experimentally we have evaluated the number of packets delivery
from source node to destination one in QoS Routing architecture
with high and low priority classes based on ns-2 simulator.
Keywords: QoS Routing Architecture, Dijkstra Algorithm, Shortest Path Routing, Starvation
Download Full-Text
ABOUT THE AUTHORS
Ariana Bejleri
Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department, Tirana, Albania
Igli Tafaj
Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department, Tirana, Albania
Helidon Karcanaj
Polytechnic University of Tirana, Faculty of Information Technology, Telecmmunication and Electronic Department, Tirana, Albania
Ariana Bejleri
Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department, Tirana, Albania
Igli Tafaj
Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department, Tirana, Albania
Helidon Karcanaj
Polytechnic University of Tirana, Faculty of Information Technology, Telecmmunication and Electronic Department, Tirana, Albania