• Jan 05, 2017 News![CFP] 2017 the annual meeting of IJFCC Editorial Board, ICCTD 2017, will be held in Paris, France during March 20-22, 2017.   [Click]
  • Mar 24, 2016 News! IJFCC Vol. 4, No. 4 has been indexed by EI (Inspec).   [Click]
  • Jun 28, 2017 News!Vol.6, No.3 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: Google Scholar, Engineering & Technology Digital Library, and Crossref, DOAJ, Electronic Journals LibraryEI (INSPEC, IET).
    • E-mail:  ijfcc@ejournal.net 
Editor-in-chief
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2012 Vol.1(4): 381-384 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2012.V1.102

Efficient Bandwidth Allocation for Packet Scheduling

D. Rosy Salomi Victoria, and S. Senthil Kumar

Abstract—Quality of Service provisioning, reduction of system delay, service fairness and effective resource utilization are all critical issues in the job scheduling design. Our scheduler gives a chance to all classes to have access to the bandwidth. This model can achieve load balance among resources of the same class and simultaneously decrease queueing delays for waiting packets. In order to avoid serious performance degradation for packets of lower classes, one resource handler is set up for all classes; not only to deal with packet dispatching but also to migrate packets between classes when necessary. User favors application service with a higher percentage of bandwidth in order to provide QoS. There is no packet drop in our implementation. This scheduler performance has been shown by comparing with Output Controlled Round Robin algorithm in terms of transmission rate, jitter, bandwidth, scheduling and latency.

Index Terms—Bandwidth based round robin, guaranteed service, maxmin fair scheduling, robust opportunistic scheduling.

D. Rosy Salomi Victoria is with the Dept. of CSE, St. Joseph’s College of Engineering, Chennai, Tamilnadu, India ( e-mail: rosysalomi@yahoo.com)
S. Senthil Kumar is with the Dept. of EEE, Government College of Engineering, Salem, Tamilnadu, India (e-mail: sengce2009@yahoo.in)

[PDF]

Cite: D. Rosy Salomi Victoria, and S. Senthil Kumar, "Efficient Bandwidth Allocation for Packet Scheduling," International Journal of Future Computer and Communication vol. 1, no. 4 pp. 381-384, 2012.

Copyright © 2008-2016. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net