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

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

Performance analysis of a loss priority control scheme in an input and output queueing ATM switch

입출력 단에 버퍼를 가지는 ATM 교환기의 손실우선순위 제어의 성능 분석

  • Published : 1997.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.

Keywords

References

  1. Proc. IEEE INFOCOM'89 Scheduling policies for real-time and nonreal-time traffic packet switching node R. Chipalkatti;J. F. Krose;D. Towsley
  2. Math. Oper. Res. v.2 no.1 Analysis of the earliest due date scheduling rule in queueing systems H. M. Goldberg
  3. IEEE Trans. Commun. v.38 no.5 Analysis of a delay-dependent priority discioline in an integrated multiclass traffic fast packet switch Y. Lim;J. E. Kobza
  4. IEEE Trans. Commun. v.39 no.1 Performance study of an input queueing packet switch with two priority classes J. S. C. Chen;R. Guerin
  5. Proc. IEEE INFOCOM'92 Priority performance of ATM switches A. K. Gupta;N. D. Georganas
  6. Proc. IEEE INFOCOM'92 A finite butter two class queue with different scheduling and push-out schemes X. Cheng;I. F. Akyildiz
  7. IEEE/ACM Trans. Networking v.1 no.6 Queueing analysis of a threshold based priority scheme for ATM networks D. Lee;B. Sengupta
  8. Proc. IEEE INFOCOM '91 Nested threshold cell discarding for ATM overload control:Optimization under cell loss constraints D. W. Petr;V. S. Frost
  9. IEEE J. Select. Areas Commun. v.9 no.3 Priority management in ATM switching nodes H. Kroner;G. Hebuterne;P. Boyer;A. Gravey
  10. IEE Proc. Commun. v.142 no.2 Performance analysis of an input and output queueing packet switch with a priority packet discarding scheme J. Y. Lee;C. K. Un
  11. IEEE Trans. Commun. v.38 no.7 Nonuniform traffic analysis on a nonblocking space-division packet switch S.-Q. Li
  12. IEEE Trans. Commun. v.COM-35 no.12 Input versus output queueing on a space-division packet switch M. J. Karol;M. G. Hluchyj;S. P. Morgan
  13. IEEE J. Select. Areas Commun. v.6 no.9 Queueing in high-performance packet switching M. G. Hluchyj;M. J. Karol
  14. Proc. IEEE INFOCOM'91 Performance of trunk grouping in packet switch design S.-Q. Li
  15. Operation Research v.30 no.2 Poisson arrivals see time averages R. W. Wolff
  16. An algorithmic approach Matrix-geometric solutions in stochastic models M. F. Neuts