Figure 5.7 The principle of Fair Queuing. 226
Figure 5.8 Operation of limited service IPACT: (a) when only
ONU#3 has upstream traffic; and (b) when all ONUs
have upstream traffic. Here, R1, R2, and R3 represent
request messages from each ONU respectively; data#3
represents user data transmitted from ONU#3, G3
represents grant for ONU#3. In (a), the values of R1 and
R2 are equal to 0 and the value of R3 indicates amount
of upstream user data stored in ONU#3. 230
Figure 5.9 Deficit round-robin (DRR) scheduling. 234
Figure 5.10 Maintaining short round-robin cycle using multiple
queue request. 235
Figure 5.11 An example with two types of requests. 235
Figure 5.12 An IEEE802.3ah REPORT frame with multiple
requests. 236
Figure 5.13 Burst allocation example of ...