Figure 4

An example for showing the operation of CBR Algorithm. (a) It is assumed that codes , , , and are already assigned to the NRT, NRT, RT, and RT calls, respectively. When a new RT call arrives and requests an , the NRT call assigned to code is reassigned to code as shown by arrow (i), and code can now be assigned to the new call (lines 1–4). (b) It is assumed that all codes except are already assigned some RT and NRT calls, and that the call that is assigned needs a higher rate code to meet its delay requirements. Arrow (ii) shows that the RT call of code is reassigned a new code (lines 5–7). NRT call assigned to code will not receive any code assignment for the current frame. In case, an NRT flow assigned to code requires a fair share of the bandwidth, reassignments are performed as shown by arrow (iii). The NRT call assigned to code is assigned the code assigned to another NRT call whose CRD value is low (lines 8–10).