The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Well-Regulated Pseudo-request Dual Round-Robin Matching Arbitration Algorithm for High Performance Input-Queued Switches

고성능 입력 큐스위치를 위한 통제된 슈도요구 이중화 라운드로빈 매칭 조정 알고리즘

  • Published : 2004.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

High-speed scheduling algorithms are required for high-performance input-queued switches to achieve good performance. Various Round-Robin scheduling algonthms for Virtual-Output-Queue (VOQ) switch architectures have been proposed, hke iSLIP, DRRM (Dual Round-Robin Matching). iSLIP can achieve high performance and have already been implemented in hardware. DRRM has been proved to achieve better performance and simpler than iSLIP But neither iSLIP nor DRRM can efficiently solve the problem of the Round-Robm pointers' desynchronization. In this paper, we have proposed "Well-Regulated Pseudo-request Dual Round-Robin Matching" Algorithm. It is developed from DRRM, and can always keep the pointers' desynchronization. Since our algorithm is based on the Round-Robin scheduling, it is also simple to be implemented. And simulation results also show that our proposed algonthm performs pretty well under various, traffic models.

고속 스케듈링 기법은 입력 큐 스위치의 성능을 극대화하기 위해 필요하다 가상 출력큐 스위치 구조에 관하여 지금까지 iSLIP, DRRM 과 같은 라운드로빈 스케듈링 기법이 제안되어 왔다 iSLIP 방식은 높은 성능을 보여주고 있고 이미 하드웨어 구현이 되어 있고 DRRM 또한 iSLIP 보다 간단하고 성능에 더 좋음을 나타내고 있지만 , 울다 라운드로벤의 포인터통기 문제를 효과적으로 풀지 못하고 있다 본 논문에서 제안된 딸고리즘은 DRRM 알고리즘 에 기초로써 새롭게 제안되었고 포인터를 항상 비동기되도록 유지하는 특정이 있다. 또한 라운드로빈 방식을 그대로 견지하므로써 구현이 간편한 특성을 가지고 있다 시뮬레이션 결과에 의하면 제안된 알고리즘은 다양한 트래픽 모델에서 iSLIP 이나 DRRM 보다 더 좋은 성능을 보여주고 있다.

Keywords

References

  1. Awdeh Ra' ed Y., Mouftah H.T., 'Survey of ATM Switch Architectures', Computer Networks & ISDN Szstems, Vol. 27, No. 12, pp. 1567-1613, May 1995 https://doi.org/10.1016/0169-7552(94)00081-4
  2. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, 'High Speed Switch Scheduling for Local Area Networks', ACM Transactions on Computer Szstems, Vol. 11, No.4, pp. 319-352, November 1993 https://doi.org/10.1145/161541.161736
  3. N. Mckeown, M. Izzard, A. Mekkittikul, W Ellersick, and M. Horowitz, 'Tiny Tera; A Packet Switch Core', IEEE Micro, Vol.17, pp. 26-33, January 1997 https://doi.org/10.1109/40.566194
  4. M. Karol, M. Hluchyj, and S. Morgan, 'Input versus output queueing on a space division switch', IEEE Trans. on Commun., Vol. 35, No. 12, pp. 1347-1356, December 1987 https://doi.org/10.1109/TCOM.1987.1096719
  5. N. Mckeown, A. Mekkittikul, V. Anantharam, and J. Walrand, 'Achieving 100% Throughput in an Input-Queued Switch', IEEE Transactions on Communications, Vol. 47, pp. 1260-1267, August 1999 https://doi.org/10.1109/26.780463
  6. A. Mekkittikul, and N. Mckeown, 'A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches", IEEE INFOCOM 98, San Francisco, April 1998
  7. N. Mckeown, 'The iSLIP scheduling algorithm for input-queued switches', IEEF/ACM Trans. Networking, Vol. 7, No. 2, pp. 188-200, April 1999 https://doi.org/10.1109/90.769767
  8. H.J. Chao and J.-S. Park, 'Centralized contention resolution schemes for a large-capacity optical ATM switch', Proc. IEEE ATM Workshop' 97, Fairfax, VA, May 1998
  9. R.I. Chao, 'Saturn: A terabit packet switch using dual round-robin', IEEE Commun. Mag., Vol. 38, No. 12, pp. 78-84, December 2000 https://doi.org/10.1109/35.888261
  10. N. Mckeown, 'Scheduling Cells in an Input-Queued Switch', PhD thesis, University of California at Berkeley, May 1995
  11. D. Anick, D. Mitra, and M. M. Sondhi, 'Stochastic theory of a data-handling system with multiple sources', Bell Szst. Tech. J., Vol. 61, pp. 1871-1894, 1982 https://doi.org/10.1002/j.1538-7305.1982.tb03089.x
  12. H. Heffes and D. M. Lucantoni, 'A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance', IEEE J. Select. Areas Commun., Vol. 4, pp. 856-868, 1988 https://doi.org/10.1109/JSAC.1986.1146393
  13. R. Jain and S. A. Routhier, 'Packet trains: Measurement and a new model for computer network traffic', IEEE J. Select. Areas Commun., Vol. 4, pp. 986-995, April 1986 https://doi.org/10.1109/JSAC.1986.1146410
  14. W. E. Leland, W. Willinger, M. Taqqu, D. Wilson, 'On the self-similar nature of Ethernet traffic', in Proc. SIGCOMM, San Francisco, CA, pp. 183-193, September 1993
  15. G. F. Pfister, ''Hot Spot' contention and combing in multistage interconnection networks", IEEE Trans. on Computers, Vol. C-34, No. 10, pp. 943-948, October 1985 https://doi.org/10.1109/TC.1985.6312198
  16. J.S. Park, 'Design and Analysis of Large-Capacity Multicast Packet Switches', Ph.D. dissertation, Polytechnic University, January 1998