Complexity analysis of a dual round-robin iSLIP (DiSLIP) scheduling scheme

In this paper, we analyze dual round-robin (DRR) based iterative SLIP (iSLIP) scheduling scheme, called DiSLIP, for IP switching systems. By using DRR followed by iSLIP, DiSLIP can exploit desynchronization effect of DRR and high throughput of iSLIP, while DiSLIP considerably reduce the complexity of parallel matching comparing to iSLIP. Through the computer simulation, we verify the switch throughput and complexity of the proposed scheme under nonuniform and correlated self-similar traffic. From the result, we observe that the proposed scheme outperforms the DRR scheme and considerably reduce the complexity comparing to iSLIP