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

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

An Efficient Scheduling for Input Queued Switch

입력큐 교환기를 위한 스케줄링기법

  • 이상호 (에스넷시스템(주) 네트워크연구소) ;
  • 신동열 (성균관대학교 전기전자컴퓨터공학부)
  • Published : 2001.12.25
Download PDF
⟨ Previous Next ⟩

Abstract

Input queueing is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queueing. The input queueing switch, however, suffers HOL-Blocking, which limits the throughput to 58%. To get around this low throughput, many input queueing switches have centralized scheduler, which centralized scheduler restrict the design of the switch architecture. To overcome this problem, we propose a simple scheduler called PRR(Pipelined Round Robin), which is intrinsically distributed and presents to show the effectiveness of the proposed scheduling.

입력큐방식의 교환기는 간결하며 고속교환을 위한 효과적인 교환방법이나 입력 측의 큐에서 발생하는 HOL-블로킹(HOL-Blocking)은 패킷들의 대기시간을 크게 증가시켜 전체 시스템의 효율을 58%로 제한한다. 이를 해결하는 방법은 별도의 스케줄러(scheduler, contention controller)를 두어 블로킹의 방지 및 높은 처리율을 얻고 있다. 대부분의 스케줄러의 구현은 중앙집중방식으로 구현되는데 이는 다양한 교환기의 구성을 어렵게 한다. 본 논문에서는 입력포트별로 간단하면서 분산된 형태의 스케줄러를 소개하고 모의실험을 통하여 성능을 검증한다.

Keywords

References

  1. M. J. Karol, M. G. HLUCHYJ and S. P. Morgan, ,'Input versus Output Queueing Switch', IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, Sep. 1991, pp. 1347-1355
  2. T. E. Anderson, S. S. Owicki, J. B. Saxe, and C. P. Thacker, 'High speed switch scheduling for local-area networks', ACM Transaction on Computer Systems, Nov, 1993, pp. 319-352 https://doi.org/10.1145/161541.161736
  3. A. Mekkittikul and Nick McKeown, 'Achieving 100% throughput in an input-queued switch', Proceedings of IEEE INFOCOM'96, 1996, pp. 296-302 https://doi.org/10.1109/INFCOM.1996.497906
  4. A. Mekkittikul and Nick McKeown, 'The iSLIP Scheduling Algorithm for Input-Queued Switches', IEEE/ACM Transaction on Networking, Vol. 7, No. 2, April 1999, pp. 188-201 https://doi.org/10.1109/90.769767
  5. M. A. Marsan, A. Bianco, E. Leonardi, and L. Mila, 'RPA：A Flexible Scheduling Argorithm for Input Buffered Switches', IEEE Transactions on Communications, Vol. 47, No. 12, December 1999, pp. 1921-1933 https://doi.org/10.1109/26.809713
  6. R. Schoen, G. Post, and G. Sander, 'Weighted arbitration algorithms with priorities for input-queued switches with 100% throughput', Proceedings of IEEE Broadband Switching Systems, 1999
  7. A. Demer, S. Keshav, and S. Shenkar, 'Analysis and simulation of a fair queueing algorithm', Proceedings of ACM SIGCOMM 1989, pp. 1-12 https://doi.org/10.1145/75246.75248
  8. S. Golestani, 'A self-clocked fair queueing scheme for broadband applications', Proceedings of IEEE INFOCOM'94, pp. 636-646. April 1994, pp. 636-646 https://doi.org/10.1109/INFCOM.1994.337677
  9. M. Katevenis, S. Sidiropouls, and C. Courcousbetis, 'Weighted round-robin cell multiplexing in a general purpose ATM switch chip,' IEEE Journal of Selected Areas in Communications, vol. 9, Oct. 1991, pp. 1265-79 https://doi.org/10.1109/49.105173
  10. M. Shreedhar and George, 'Varghese Efficient fair queueing using deficit round robin', Proceedings of ACM SIGCOMM 1995, pp.231-242 https://doi.org/10.1145/217382.217453
  11. H. Obara, S. Okamoto and Y. Mamazumi, 'INOUT AND OUTPUT QUEUEING ATM SWITCH ARCHITECTURE WITH SPATIAL AND TEMPORAL SLOT RESERVATION CONTROL', IEE Electronics Letters, Vol. 28, No. 1, Jan. 1992, pp. 22-24 https://doi.org/10.1049/el:19920014
  12. A. Mekkittikul and Nick McKeown, 'A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches', Proceedings of IEEE INFOCOM'98, 1998, pp. 792-797 https://doi.org/10.1109/INFCOM.1998.665102
  13. Raj Jain and Shawn A. Routher, 'Packet Trains-Measurements and a New Model for Computer Network Traffic', IEEE Journal on Selected Areas in Communications, Vol. SAC-4, No. 6, September 1986, pp. 986-995 https://doi.org/10.1109/JSAC.1986.1146410