Journal of the Institute of Electronics Engineers of Korea TC (대한전자공학회논문지TC)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Design and Analysis of a Dual Round-Robin based iSLIP (DiSLIP) Scheduling Scheme for IP Switching System

IP 스위칭 시스템을 위한 iSLIP 스케줄링에 기반의 Dual 라운드로빈 설계 및 분석

  • Published : 2007.03.25
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, a new Dual Round-Robin (DRR) based iterative SLIP (iSLIP) scheduling scheme, called DiSLIP is proposed for IP switching systems. By using DRR followed by iSLIP, DiSLIP can exploit desynchronization effect of DRR and high performance of iSLIP, while the drawbacks of two schemes are minimized. 'Through computer simulation, we verify the switch throughput and total waiting time of the proposed scheme under nonuniform and correlated self-similar traffic. Moreover, the proposed scheme can considerably reduce the complexity of parallel matching logics compared to iSLIP. From the result, we observe that the proposed scheme outperforms DRR on throughput as well as iSLIP schemes on complextiy.

본 논문에서는 IP 스위칭 시스템을 위한 iSLIP 기반의 Dual Round Robin(DRR) 방식 스케줄링 알고리즘을 제시한다. 기존의 iSLIP 방식과 DRR 방식을 결합하여 단점은 최소화하면서 DRR이 가진 분배기능의 장점과 iSLIP 기능이 가진 고성능의 장점을 이용할 수 있게 한다. 불균일한 트래픽 환경에서 스위치에서의 처리율과 지연성능을 컴퓨터 시뮬레이션을 통해 확인한다. 또한 제안된 방식은 기존의 iSLIP과 비교하여 구현 복잡성을 매우 낮아짐을 보인다. 이러한 실험을 통해 본 논문에서 제안한 스케줄링 알고리즘이 기존의 DRR에 비해 우수한 성능을 iSLIP에 비해 구현의 복잡성에서 우수함을 알 수 있었다.

Keywords

References

  1. P. Newman, G. Minshall, and T. L. Lyon 'IP switching-ATM under IP,' IEEE/ACM Trans. on Networking, vol. 6, No. 2, pp. 117-129, April 1998 https://doi.org/10.1109/90.664261
  2. A. Adas, 'Traffic models in broadband networks,' IEEE Commun. Mag., vol. 35, pp. 82-89, July 1997
  3. X. -R. Cao and D. Towsley, 'A performance model for ATM switches with general packet length distributions,' IEEE/ACM Trans. on Networking, vol. 3, No. 3, pp. 299-309, June 1995 https://doi.org/10.1109/90.392389
  4. N. Mir, 'Analysis of nonuniform traffic in a switching network,' in ICCCN '98, 1998
  5. P. Gupta, 'Scheduling in input queued switches: a survey,'in citeseer.nj.nec.com/246798.html
  6. G. Nong, M. Hamdi, and J. K. Muppala, 'Performance evaluation of multiple input-queued ATM switches with PIM scheduling under bursty traffic,' IEEE Trans. Commun., vol. 49, pp. 1329-1333, Aug. 2001 https://doi.org/10.1109/26.939843
  7. A. Mekkittikul and N. Mckeown, 'A practical scheduling algorithm to achieve 100% throughput in input-queued switches,' IEEE INFOCOM '98, pp. 792-799, 1998
  8. D. Manjunath and B. Sikdar, 'Variable length packet switches: delay analysis of crossbar switches under Poisson and self similar traffic,' in IEEE INFOCOM '00, 2000
  9. M. A. Marsan, A. Bianco, P. Giaccone E. Leonardi and F. Neri, 'Packet scheduling in inputqueued cell-based switches,' in IEEE INFOCOM '01
  10. N. Mckeown, A. Mekkittikul, V. Anantharam, and J.Walrand, 'Achieving 100% throughput in an input-queued switch,' IEEE Trans. Commun., vol. 47, pp. 1260-1267, Aug. 1999 https://doi.org/10.1109/26.780463
  11. Y. Li, S. Panwar, H. J. Chao, 'On the performance of a Dual Round-Robin switch,' IEEE INFOCOM '01., vol. 3, pp. 1688-1697, April 2001
  12. M. G. Hluchyj and M. J. Karol, 'Queueing in high performance packet switching,' IEEE J. Sel. Areas Commun., vol. 6, pp. 15871597, Dec. 1988
  13. K. W. Sarkies, 'The bypass queue in fast packet switching,' IEEE Trans. on Commun., vol. 39, pp. 766-774, May 1991 https://doi.org/10.1109/26.87139
  14. A. Santhanam and A. Karandikar, 'Window-based cell scheduling algorithm for VLSI implementation of an input-queued ATM switch, in IEE Proc.-Commun. Vol. 147, No. 2, April 2000
  15. J. S. Choi and H. H. Lee, 'Performance Study of an Input queueing ATM switch with windowing scheme for IP switching system, in IEE Proceeding of HPSR 2002, Kobe, Japan, May 2002