Design and Analysis of Network Models for QoS Routers on UDP and CBR
No Thumbnail Available
Files
Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Georgian Technical University and St. Andrew the First Called Georgian University of The Patriarchy of Georgia
Abstract
To address the issues of packet delay and unfairness among multimedia UDP flows, this paper presents the design and evaluation of network models to study different parameters for quality-of-service (QoS) provisioning in differentiated service (DiffServ) routers using user datagram protocol (UDP) as network traffic agent and constant bit rate (CBR) as traffic generator. Traffic marker algorithms are used to define the treatment an incoming traffic (packet streams) receives at the edge routers in a DiffServ domain. In order to implement the TSW2CM and TSW3CM marker algorithms, a network model was designed. The designed models were simulated, analysed and evaluated. For the purpose of evaluation, packet delay and fairness index were considered. The obtained evaluation results were analysed based on a ranking system approach to showcase the strengths and weaknesses of the TSW2CM and TSW3CM algorithms for multimedia UDP flows. The adopted approach showed that the TSW3CM algorithm was ranked first with a packet delay value of 0.237704 while TSW2CM algorithm was marked second (with 0.431778), and the TSW3CM algorithm was ranked first with a fairness rate value of 0.3823960 while TSW2CM algorithm was ranked second (with 0.2817353). The obtained results indicate that applications that requires low packet delay can be deployed on UDP protocol using TSW3CM algorithm while applications that requires high fairness rate values can be deployed on UDP protocol using TSW3CM algorithm
Description
Keywords
Wireless Communication, Network Models, Quality of Service
Citation
Ameen, A. O., Olatinwo, D.D., Alamu, F.O., Olatinwo, S.O., Balogun, A.O., (2017): Design and Analysis of Network Models for QoS Routers on UDp and CBR. GESJ: Computer Science and Telecommunications. No.1 (51) pp. 76-82.