When hundred thousands of flows are competing for the same switch output, scalable, low complexity scheduling algorithm are needed to ensure low latency and fairness. In wire-line access networks where the infrastructure is shared by relatively low number of users achieving high utilization but at the same time guaranteeing stringent quality of service has led to the use of multiple channels over the same cable/fiber. I proposed the input and output queuing concepts for scheduling a single user transmission simultaneously over multiple channels. I also analyzed and implemented the bonded deficit round robin algorithm which realizes these concept and demonstrated that it can guarantee strict quality of service requirements even when the channels use varying bit rates. Input queuing where the packets are buffered in common queue and scheduled for transmission owhen a channel becomes free
0 Comments
|
AuthorI am a scientist and an engineer with wide interests in photonics, optical enineering, deep learning and biology. ArchivesCategories
All
|