Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Open access · Published 9 February 2013

Stateless Aggregate Fair Marking Scheduler for Differentiated Service Networks

Nandhini Sivasubramaniam1 & Palaniammal Senniappan2

Journal of Computer Science, Volume 9, Issue 1, pp. 63–73 · doi.org/10.3844/jcssp.2013.63.73

7,510 accesses4,803 downloads0 citations (Crossref)Metrics
Cite Check for updates

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.

Licence and reuse

Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Sivasubramaniam, N. & Senniappan, P. (2013). Stateless Aggregate Fair Marking Scheduler for Differentiated Service Networks. Journal of Computer Science, 9(1), 63–73. https://doi.org/10.3844/jcssp.2013.63.73

Licence
CC BY 3.0
Issue
Volume 9, Issue 1
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Stateless Aggregate Fair Marking Scheduler for Differentiated Service NetworksJournal of Computer Science · Volume 9, Issue 1 · pp. 63–73 · CC BY 3.0Download