Journal of Computer Science

Stateless Aggregate Fair Marking Scheduler for Differentiated Service Networks

Nandhini Sivasubramaniam and Palaniammal Senniappan

DOI : 10.3844/jcssp.2013.63.73

Journal of Computer Science

Volume 9, Issue 1

Pages 63-73

Abstract

In diffserv networks, as the traffic flows vary constantly, it is very difficult to maintain the per-flow state. The computation of rate information of the traffic flow also becomes complex. In this study, we propose a Stateless Aggregate Fair Marking (SAMQ) with Multiple Queue Priority Scheduler for Differentiated Service (DiffServ) networks. Initially, priority scheduler is applied to the flows entering the ingress edge router. If it is real time flow like Voice over IP (VoIP) or Video, then the packets are given higher priority else lower priority. In core router, for higher priority flows the Multiple Queue Fair Queuing (MQFQ) is applied that allows a flow to utilize multiple queues to transmit the packets. In case of lower priority, Stateless Aggregate Fair Marking technique is utilized. This technique applies Core Stateless Fair Queuing (CSFQ) technique for maintaining the rate information of packet flow and distributes the token to each incoming packet without maintaining the per-flow state. By simulation results, we show that this technique improves the throughput of non-real time flows.

Copyright

© 2013 Nandhini Sivasubramaniam and Palaniammal Senniappan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.