Pre-order Bonded Deficit Round Robin for Channel Bonding System

摘要

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.