대한전기학회논문지:시스템및제어부문D (The Transactions of the Korean Institute of Electrical Engineers D)

대한전기학회 (The Korean Institute of Electrical Engineers)
권호 표지

입력큐 교환기에서의 우선순위 파이프라인 순환 스케줄링

Pipelined and Prioritized Round Robin Scheduling in an Input Queueing Switch

  • 발행 : 2003.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Input queued switch is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queued. The input queued switch, however, suffers the HOL-Blocking, which limits its throughput to 58%. To overcome HOL-Blocking problem, many input-queued switch controlled by a scheduling algorithm. Most scheduling algorithms are implemented based on a centralized scheduler which restrict the design of the switch architecture. In this paper, we propose a simple scheduler called Pipelined Round Robin (PRR) which is intrinsically distributed by each input port. We presents to show the effectiveness of the proposed scheduler.

키워드

참고문헌

  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