Home // ICWMC 2015, The Eleventh International Conference on Wireless and Mobile Communications // View article

IWO Based Adaptive Algorithm for Packet Scheduling Problem

Authors:
Jan Dziergwa
Iwona Pozniak-Koszalka
Leszek Koszalka
Andrzej Kasprzak

Keywords: packet scheduling; metaheuristic; QoS; IWO; algorithm; experimentation system

Abstract:
This paper deals with the packet scheduling problem in a computer network. Multimedia services, such as Voice-over-IP (VoIP) and Video-on-Demand (VoD), rely on IP networks thus may suffer from unwanted delays, high packet loss rate and large jitter because of intense traffic load on the network. Traffic needs to be prioritized in order to meet the Quality-of-Service (QoS) requirements and ensure reliable media transmission. This paper presents an idea of modifying Weighted Round Robin (WRR) scheduling algorithm to adapt to the incoming traffic by applying Invasive Weed Optimization (IWO) metaheuristic search algorithm for finding the best set of the weights with every time step. Simulation study of the performance of the proposed scheduling algorithm, called Adaptive Weighted Round Robin (AWRR), shows that it can deliver better results than basic scheduling algorithms

Pages: 61 to 65

Copyright: Copyright (c) IARIA, 2015

Publication date: October 11, 2015

Published in: conference

ISSN: 2308-4219

ISBN: 978-1-61208-433-6

Location: St. Julians, Malta

Dates: from October 11, 2015 to October 16, 2015