Activities per year
This paper proposes a round-robin based multicast scheduling algorithm for high-speed input-queued switches. Fan-out information of each head-of-line cell is examined by the packet scheduler to form a matrix called Traffic Matrix. A subscheduler for each column executes the round-robin scheduling algorithm and scheduling decisions are collected into the Decision Matrix. To avoid unnecessary multiple transmissions of a multicast cell, the sync mechanism is introduced after the Decision Matrix is formed. By simulation, the results demonstrate that the number of transmissions is effectively decreased by sync while maintaining the same output utilization.
|Title of host publication||proceedings INFOCOM|
|Publication status||Published - 2010|
|Event||29th IEEE International Conference on Computer Communications - San Diego, CA, United States|
Duration: 15 Mar 2010 → 19 Mar 2010
Conference number: 29
|Conference||29th IEEE International Conference on Computer Communications|
|City||San Diego, CA|
|Period||15/03/2010 → 19/03/2010|
Bibliographical noteCopyright 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
- multicast scheduling
- high-speed switch
Yu, H., Ruepp, S. R., & Berger, M. S. (2010). A novel round-robin based multicast scheduling algorithm for 100 Gigabit Ethernet switches. In proceedings INFOCOM (pp. 1-2). IEEE. https://doi.org/10.1109/INFCOMW.2010.5466651