MXDD Scheduling Algorithm for MIBC Switches

Scheduling multicast traffic is the emerging research area due to increased growth and use of the multicast applications on the Internet. This work focuses on the multicast scheduling for M×N Internally Buffered Crossbar Switches. Internally Buffered Crossbar (IBC) switches, then again, have been considered a powerful option in contrast to buffer less crossbar switches to improve the scheduling execution. The Multicast Cross-point Due Date multicast scheduling algorithm (MXDD) is proposed with an input and output scheduling. In input scheduling the HOL of the all the input ports is transferred to the corresponding buffer at each cross point. The output scheduling has two phases for getting the fairness and alleviate the HOL blocking and Starvation problem. In phase I, The Due Date is assigned to the cells in the buffer at each cross-point. In Phase II, the cells which are assigned Due Date 1 are allowed to be scheduled in the N
^th
time Slot. This scheme appears to deal with multicast traffic more proficiently and far superior to conventional schemes. However, MXDD is both down to earth and accomplishes superior.