Subscribe Now Subscribe Today
Science Alert
Curve Top
Information Technology Journal
  Year: 2014 | Volume: 13 | Issue: 3 | Page No.: 434-442
DOI: 10.3923/itj.2014.434.442
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Fair and Efficient Variable-length Packet Scheduling and Multilink Transmission Support

Guikai Liu

Aiming to guarantee scheduling fairness in variable-length packet networks, this study presents a novel easily implementable scheduling algorithm, called Resilient Quantum Round-Robin (RQRR). The quantum assigned to each of the flows in a round is not fixed and is calculated depending on the transmission situation of all the flows in the previous round. The computing method is: For one flow, p-value (namely quantum) of the next round = p-value of the current round+the average count of bytes sent by other flows in current round-the number of bytes sent by the flow in current round. Dynamic quanta can instantly reflect the behavior of the flows in scheduling process. This study proves that the implementation complexity of RQRR is O (1) with respect to the number of flows; it also analytically prove the fairness properties of RQRR and show that its relative fairness measure has an upper bound of 7 Max-1, where Max is the size of the largest packets. On the other hand, multilink transmission is an efficient way to solve the problem that satisfies the subscriber’s demand on bandwidth increment. RQRR can support multilink transmission commendably and it not only allocates the bandwidth resource of multilink fairly to keep load-balance amongst links, but also guarantees accordant packet sequence between sending end and receiving end without increasing additional overhead.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

Guikai Liu , 2014. Fair and Efficient Variable-length Packet Scheduling and Multilink Transmission Support. Information Technology Journal, 13: 434-442.

DOI: 10.3923/itj.2014.434.442






Curve Bottom