Performance analysis of priority leaky bucket scheme with queue-length-threshold scheduling policy

Cited 9 time in webofscience Cited 0 time in scopus
  • Hit : 193
  • Download : 0
The leaky bucket scheme is a promising method that regulates input traffic for preventive congestion control in ATM networks. One of the important problems in ATM networks is meeting the quality of service requirements for real-time and non-real-time traffics. The authors propose a priority leaky bucket scheme with queue-length-threshold scheduling policy. The motivation of this proposed leaky bucket scheme is to meet the quality of service for real-time traffic while providing more improved services for non-realtime traffic. Using the embedded Markov chain method, the authors obtain the joint distribution of the queue lengths, the loss probability and the mean waiting time. Numerical results show the effects of the system parameters such as the buffer size and the token pool size on the performance of the proposed scheme.
Publisher
IEE-INST ELEC ENG
Issue Date
1998-12
Language
English
Article Type
Article
Keywords

ATM NETWORKS

Citation

IEE PROCEEDINGS-COMMUNICATIONS, v.145, no.6, pp.395 - 401

ISSN
1350-2425
URI
http://hdl.handle.net/10203/77338
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 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0