Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

DISCRETE-TIME ANALYSIS OF OVERLOAD CONTROL FOR BURSTY TRAFFIC

  • Published : 2001.01.01

⟨ Previous Next ⟩

Abstract

We consider a queueing system under overload control to support bursty traffic. The queueing system under overload control is modelled by MMBP/D1/K queue with two thresholds on buffer. Arrival of customer is assumed to be a Markov-modulated Bernoulli process (MMBP) by considering burstiness of traffic. Analysis is done in discrete-time case. Using the generating function method, we obtain the stationary queue length distribution. Finally, the loss probability and the waiting time distribution of a customer are given.

Keywords

References

  1. IEEE Trans. Commun. v.37 Overload control in a finite message storage buffer S-Q Li
  2. Performance Evaluation v.17 Transient analysis of a switched Poisson arrival queue under overload control D.S.Lee;S-Q. Li
  3. IEEE Trans. Commun. v.37 Study of information loss in packet voice systems S-Q. Li
  4. J. of Applied Mathematics and Stochastic Analysis v.20 Queueing system with queue length dependent service times, with application to cell discarding scheme in ATM networks Knessl;C.Tier
  5. IEE Proc. Commun. v.143 Discrete-time analysis of the leaky bucket schema with threshold-based token generation intervals B.D.Choi;D.I.Choi
  6. IEEE J. Selected Areas Commun. v.4 A Markov-modulated characterization of packetized voice and data traffic and related statistical multiplexer performance H.Heffes;D.M.Lucantoni
  7. Probability in the Engineering and Informational Sciences v.12 $Geo^{X1}$,$Geo^{X2}$/D/c HOL priority queueing system with random order selection within each priority class B.D.Choi;Y.Lee;D.I.Choi
  8. Asynchronous transfer mode networks: Performance Issues Raif O,Onvural