Performance analysis of a Leaky Bucket scheme with a threshold in the data buffer

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 207
  • Download : 0
We investigate Leaky Bucket (LB) schemes with a threshold in the data buffer, where the leak rate changes depending on the contents of the data buffer. We use a Markov modulated Poisson process (MMPP) as a bursty input traffic. We obtain the limiting distributions of the system state at an embedded point and at an arbitrary time. As performance measures we obtain cell loss probability and mean cell delay. We present some numerical results to show the effects of the threshold value, the rate of token generation, the size of the token pool and the size of the data buffer on the performances of the LB scheme with a threshold. Numerical examples show that the LB scheme with a threshold improves the system performance in comparison with the LB scheme without a threshold. (C) 1997 Published by Elsevier Science B.V.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1997-08
Language
English
Article Type
Article
Keywords

ATM NETWORKS; VOICE

Citation

COMPUTER NETWORKS AND ISDN SYSTEMS, v.29, no.7, pp.781 - 795

ISSN
0169-7552
URI
http://hdl.handle.net/10203/75698
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0