Pre-order Bonded Deficit Round Robin for Channel Bonding System

DOI

10.2991/iccnce.2013.149How to use a DOI?

Keywords

Bonded Deficit Round Robin (BDRR), DOCSIS3.0, Channel Bonding, Latency-Rate, Packet Scheduler Algorithm

Abstract

For multiple channels packet scheduling in DOCSIS3.0, we propose a new scheduling algorithm, called Preorder Bonded Deficit Round Robin (PB-DRR) scheduling algorithm. The PB-DRR employs the preorder mechanism for Bonded Deficit Round Robin (BDRR) to overcome the large latency problem of BDRR. Theoretical analysis proves that PB-DRR is a latency-rate server and has O(logz) complexity. Simulation results show that PBDRR have more advantages in delay guarantee compared with BDRR.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhongzhen Yang
AU  - Jinin Wang
AU  - Xianguan Wang
AU  - Chengwen Jiao
PY  - 2013/07
DA  - 2013/07
TI  - Pre-order Bonded Deficit Round Robin for Channel Bonding System
BT  - Proceedings of the International Conference on Computer, Networks and Communication Engineering (ICCNCE 2013)
PB  - Atlantis Press
SP  - 601
EP  - 604
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccnce.2013.149
DO  - 10.2991/iccnce.2013.149
ID  - Yang2013/07
ER  -