On priority scheduling algorithm at ATM switches with multi-class output buffers

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 349
  • Download : 0
In this paper, we present a priority scheduling algorithm at ATM switches with multi-class output buffers in which the service rate of each class buffer is dynamically adjusted. The service rate is computed periodically by a control scheme. We derive the design Formulas of the control scheme tc, ensure that each class buffer occupancy converges to its desired operating point related to QoS requirement. Moreover, through dynamic service rate control in the proposed scheduling algorithm. the available channel capacity can be estimated exactly. it may be used for rate control of ABR traffic and call admission control of the other real-time traffic (CBR, VER, etc.).
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
1999-01
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E82B, no.1, pp.34 - 38

ISSN
0916-8516
URI
http://hdl.handle.net/10203/68581
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 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0