Fanout Splitting Multicast Scheduling in High Performance Router
Quan Cheng-bin · Journal of Northeastern University · 2004
Analyzing the architecture and queuing management, which the multicast scheduling dependent on, some practical fanout splitting algorithms are discussed. A new PGMF(packet greedy match fairness) algorithm is then proposed for multicast scheduling to support length-variable data packets. Thus, the redundant circuits to recombine signal elements and treat disorderly states can be prevented,with scheduling/transmitting throughput increased on fairness basis to support easily QoS management. Simulative analysis showed that more throughput and latency feature the new algorithm and, in view of the complexity of hardware designing,its implementation is of low complexity. Compared with other algorithms,the developmental trend of multicast scheduling algorithm is presented.