The virtual frame algorithm: a new scheduling technique for integrated services in packet switching networks
Date
2018-11-21
Authors
Nasser, Tarek
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this work, we propose a new scheduling algorithm (the virtual frame algorithm) for handling different types of traffic using an optimization technique based on the transportation problem with upper bounds. The proposed algorithm has independent control for bandwidth and delay performance, by which we are able to support both real and non-real time applications simultaneously. This algorithm has many attractive features such as protection, fairness, scalability, and minimum bandwidth guarantees. The proposed algorithm can work as a traffic shaper at the output of each switch, which reduces network congestion and data loss in the down stream.
The new algorithm was simulated and its performance was tested using MATLAB. Four types of traffic were simulated at the aggregation level and were used as input for testing the performance of the proposed algorithm. Each input traffic had its own quality of service requirements that expressed either a real or non-real time application.
A comparison was done between the proposed algorithm and some of the other well-known algorithms. It indicated that the proposed algorithm and those other algorithms under consideration were almost equal in providing the same quality of services but the proposed technique has the advantages of simple controllability as well as ease of implementation.
The main contribution of this work is introducing a totally new approach to model the scheduling problem in communication networks. The new algorithm provides a great amount of controllability embedded into the different degrees of freedom it possesses. The simplified model developed provides a very simple technique in the sense of complexity. It can be implemented either in software or hardware.
Description
Keywords
Packet switching (Data transmission), Algorithms