Investigation of quality of service IP routing algorithm
Loading...
Date
2003
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
University of Essex
Abstract
Internet communication is mainly determined by how best datagrams1 are routed from
source machine to destination machine. Routing is done in the network layer of the
OSI/RM by special machines called routers. Using proper protocols2 routers can
compute a path over which a datagram has to follow to reach the desired destination.
One of the protocols most commonly used in routers is the OSPF. This protocol
implements an algorithm called Dijkstra’s algorithm3 in computation of the relevant
path to destination for an incoming datagram. Basically Dijkstra’s algorithm uses only
shortest paths to calculate routes; i.e. the algorithm will return shortest possible routes
from a source router to all other routers in a network4.
Dijkstra’s algorithm does not consider the quality of service required by the individual
datagrams; as long as they are destined to the same router they will all follow the
same path. Hence, there is a need to have an algorithm that will take into account the
QoS required by the individual packets. One of the algorithms that consider QoS is-
that described in [1],
In this project, the above mentioned algorithms will be simulated by writing Java
computer program(s). Emphasis will be on investigating the QoS IP routing
algorithm. The results of the two algorithms for different network conditions will be
analysed and compared. A well GUI will be implemented to better illustrate the
algorithms for the benefit of many users.
Finally, comments and conclusion will be drawn on how best the QoS IP routing
algorithm can replace the existing Dijkstra’s algorithm.
Description
Dissertation
Keywords
IP Routing Algorithm, Internet communication