作者: B. Khasnabish
关键词:
摘要: A simple learning-algorithm-based method for dynamically sharing a pool of bandwidth (BW) by multiple categories traffic in asynchronous transfer mode (ATM) networks is proposed. For constant bit rate (CBR)-type traffic, only the maximum consumable BW defined, whereas other categories, minimum portion guaranteed when they are sufficiently active. The remaining shared on basis pre-assigned priority level, discard eligibility, and current activity cells specific category. Functions (1) fast reward penalty (FRFP), (2) slow (FRSP), (3) (SRSP), (4) (SRFP) Their impact achievability dynamic investigated.