# Design and Analytical Analysis of a Novel DBA Algorithm with Dual-Polling Tables in EPON

Authors: Jiunn-Ru Lai; Hsin-Yi Huang; Wen-Ping Chen; Luke K. Wang; Ming-Yuan Cho
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Ethernet passive optical network is a point-to-multipoint structure, and an effective media access protocol should be designed for collision avoidance and bandwidth allocation. Most previous researches have aimed to solve the problem using dynamic bandwidth allocation (DBA) algorithms with polling-based schemes. Unfortunately, idle channel time among the polling cycles cannot be overcome efficiently. In this paper, a dual-polling DBA (DP-DBA) algorithm which consists of an interpolling mechanism and an intrapolling mechanism is proposed. The interpolling mechanism helps eliminate the idle time problem while the intrapolling part aggregates the unused bandwidth of the light-loaded users and those due to nondefragmentation of the Ethernet frames of the general users. We also evaluate the performance of the DP-DBA algorithm by a comparison with the interleaved polling with adaptive cycle time (IPACT), the dynamic bandwidth allocation with a modified grant table generation algorithm (DBA2), the Double-Phase Polling (DPP), and the adaptive DBA algorithm with sorting report messages (Sort-DBA) schemes with simulation results. For greater realism with regard to general applications, we also simulate the asymmetric traffic loads at the optical network units (ONUs).The results show that DP-DBA outperforms the other DBA schemes under asymmetric load conditions.


---

## Body

## 1. Introduction

The number of subscribers served by FTTx equipment is strongly increasing [1]. The ongoing of market is prosperous in different regions of the world such as in Asia [2], the United States, and Latin America [3]. Among broadband access network technologies, the Ethernet passive optical network (EPON) is a promising candidate for future ISP last-mile solutions [4]. EPON has many advantages for a subscriber access network, for example, reduced cost of maintenance and ease of upgrade. EPON also has properties which include wide coverage area, reduced fiber deployment, and both multicast and broadcast capacities. Typically, EPON makes use of three wavelength bands, namely, 1310 nm, 1490 nm, and 1550 nm. The 1490 nm wavelength is responsible for downstream broadcast from the optical line terminal (OLT) to multiple optical network units (ONUs). At the upstream side, the 1310 nm wavelength is used for the multiple ONUs to transmit the data to the OLT. However, the shared media access property at the upstream side needs a sophisticated media access control (MAC) for the multiple-to-one structure [5, 6] in different network environments such as heterogeneous propagation delay [7] and long-reach [8]. Accordingly, the performance of these schemes is evaluated by analysis approach [9] and analysis approach [10]. An arbitrary mechanism is needed to prevent simultaneous transmissions and data collision. Therefore, an interleaved polling scheme, called interleaved polling with adaptive cycle time (IPACT), is proposed to cope with this problem by Kramer et al. [11]. With the limited service discipline, this algorithm achieves good performance. However, the idle time issue is not effectively resolved. Further, due to the busty nature of Ethernet traffic and prohibition of fragmentation of Ethernet packets, some ONUs may have less traffic to transmit while other ONUs may have more traffic to transmit and need more bandwidth in each transmission cycle. Consequently, IPACT allocation of bandwidth based on a single ONU is not globally optimized.Assi et al. [12] proposed a DBA algorithm which makes use of the excess bandwidth of lightly loaded ONUs to help the heavily loaded ONUs to transport their bandwidth demand in each transmission cycle, thus improving the performance of limited allocation schemes. To deal with the idle time issue, they proposed an early allocation mechanism, called DBA2, which schedules lightly loaded ONUs without waiting till end of collection of allREPORT messages. In contrast, it schedules heavily loaded ONUs only after the OLT receives allREPORT messages and performs computation for bandwidth allocation. In addition, a fair-excess scheme is applied to DBA2 to obtain high performance for WDM-EPON [13]. Unfortunately, the DBA2 algorithm works well with the idle period only under low or medium traffic loads. Moreover, for high traffic load conditions, ONUs have a bandwidth demand larger than the minimum guaranteed bandwidth, so GATE messages cannot be transmitted early to the ONU for idle time compensation because of not enough number of lightly loaded ONUs. Hence an early DBA mechanism with prediction-based fair excessive bandwidth allocation scheme was proposed in 2008 [14]; however, its prediction scheme cannot correctly estimate the bandwidth requirements. In 2006, Zheng [15] proposed a bandwidth allocation method, which makes use of a tracker value to deal with the idle time problem under high traffic loads. This algorithm improves the DBA2 idle time issue under heavy load conditions. However, due to the redundant overhead of the processing time of the tracker and the regularREPORT messages, bandwidth wastes still exist when the ONU is under heavy load. Further, an unfairness issue arises. It is supposed that when the previous ONUs are operating under a light load condition, the following ONUs can share the remainder bandwidth; but the previous ONUs cannot allot the remainder bandwidth if the following ONUs are operating under a light load. The idle time results from the OLT waiting for the lastREPORT from the last ONU during one cycle. In 2009, Choi et al. [16] proposed a Double-Phase Polling (DPP) algorithm to divide N ONUs into two subgroups; these two subgroups will counteract each other’s idle time to increase the utilization of upstream transmission. However, the performance of DPP algorithm is similar to IPACT with limited service (IPACT-limited) algorithm in uniform traffic condition.In 2010, the authors propose an adaptive DBA algorithm with sorting report messages (Sort-DBA) to tackle the problem of idle time [17]. The minimum guaranteed bandwidth (Bmin⁡) is redefined and the lastREPORT is sent before data transmission of the last ONU during the cycle time. However, the unused bandwidth of the light load ONUs cannot be reallotted for the heavy load ONUs. In 2011, Chan et al. [18] proposed a Local-Traffic-Redirection-Based Dynamic Bandwidth Assignment algorithm to balance the load assignment. The ONUs are divided into two groups, with each group assigned an Action Remote Repeater Number (Action RN) to identify if the destination node belongs to the same group. The unused bandwidth can be used to transmit the data buffered at the heavy load ONUs. However, active remote repeaters are needed. This increases the node complexity and device’s cost. It also violates the passive and low-cost properties of EPON.In 2005, the authors [19] make use of the Multipoint Control Protocol (MPCP) with threshold reporting and with inter- and intra-ONU priority scheduling to solve the DBA and frame fragmentation problem. However, heavy computation and large table space are needed. In 2014, Sue et al. [20] proposed a nonpredictive-based ONU scheduling method designated as active intra-ONU scheduling with proportional guaranteed bandwidth (ASPFB) to improve the unused slot remainder (USR) problem for EPONs. Multiple queue report variables must be updated in the reports by the ONUs in each polling cycle. It incurs somehow computational loads on ONU. In this paper, we take use of the dual-polling mechanism, which involves only two values. As compared to the previous work, our scheme is more suitable for real implementation. In 2006, Chen et al. [21] proposed an efficient and fine scheduling algorithm for bandwidth allocation. With the ONU’s report of the USR value of itself in this round, OLT can arrange the next ONU to start transmission in advance. However, the polling scheme must be the interleaved form. In this paper, our proposed scheme, dual-polling scheme, can be applied to offline or online schemes without any limitation.There is also a trend for the use of WDM-PON in broadband access networks. However, the DBA algorithm for WDM-PON still needs more researches. This present study proposes a dual-polling DBA (DP-DBA) algorithm for utilization improvement and unused bandwidth reallocation. Section2 addresses DP-DBA operation. Simulation results are presented in Section 3. This study is concluded with a few relevant remarks and also addresses the direction of our future research.


## 2. Dual-Polling DBA Algorithm

The DP-DBA algorithm consists of two polling schemes which are designated as the interpolling and the intrapolling schemes. Two polling tables are included, Layer I polling table and Layer II polling table. The former is designed to record the bandwidth requests and the round-trip time (RTT) from the ONUs under the minimum bandwidth allocation (Bmin⁡). The latter records the extra bandwidth requests of (Bmin⁡) from the heavy load ONUs. The interpolling scheme solves the idle time problem. To reallot the unused bandwidth from the light load ONUs to the heavy load ONUs, the intrapolling scheme is proposed. The operation of the two schemes will now be addressed.


### 2.1. Interpolling Scheme

For general DBA algorithms, an OLT cannot start DBA operation for cycle time(I+1) until receiving all theREPORT messages from the ONUs during cycle time I. After processing the messages, the upstream bandwidth allocation decision for cycle time (I+1) can be made and broadcasted to the ONUs. However, the idle time period at the upstream side between the last transmission data at cycle time I and the first transmission data at cycle time (I+1) is wasted. Referring to [17], we can express the idle period as (1)Tidle=Tdba+RTT+TONU,where the processing time of the DBA algorithm is denoted as Tdba, RTT denotes the round-trip time from ONU to OLT, and TONU denotes the processing time of the ONU.The upstream direction of the line is undoubtedly idled because all ONUs are waiting for the grant messages of the next cycle. Such an idle period degrades the performance in terms of bandwidth utilization. To address the idle period problem and excess bandwidth collection, we propose a novel DBA algorithm that combines the Sort-DBA scheme with a dual-polling mechanism for excess bandwidth redistribution. To eliminate the idle time according to the bandwidth demands of all ONUs, the Sort-DBA scheme can be divided into two cases. The two cases are described as follows.(1) At Least One REPORT Is Long Enough. In Figure 1, during the cycle time I, the RN-1 is arranged to be the last one to transmit data, and it has enough granted bandwidth length to let the OLT send all theGATEs for the ONUs. Note that we can make the ONU piggyback itsREPORT in front of its transmission data by sending theGATE message two times. OneGATE message records the transmission time of theREPORT massage. The other records the granted bandwidth and transmission time in the next cycle. To compensate the idle time, the granted bandwidth of the last ONU in cycle time (I+1) should be greater than the Bimin⁡ which is expressed as(2)Bimin⁡=KiRu×(Tidle-Tg)8,where Ru is the upstream bandwidth, Tg is the guard time for the OLT power level adjustment and data processing, and Ki varies from the minimum value to the contract value according to the SLA (service level agreement). As for the uniform load pattern, K1=K2=⋯=KN=1 and   Bimin⁡=Bmin⁡. To reduce the delay time, the ONUs transmit their data before theREPORT message except the last ONU. The sequence of transmission ordering is arranged according to the sorting sequence of their granted data size. In Figure 1, the sorted sequence of the granted data size of the ONUs in cycle time I is LN-1≥L2≥LN≥⋯≥L5. Therefore, RN-1 is arranged to be the last one to transmit data. After receiving all theREPORTs from the ONUs, the OLT runs the DBA operation and finds that at cycle time (I+1) there is one ONU (here is the ONU1) that matches the requirement of a request length greater than Bmin⁡. The transmission sequence of other ONUs is assigned according to the sorting order of their requested data size. In this case, the idle time is eliminated completely. If more than one ONU has a request length greater than or equal to Bmin⁡ in the cycle time, the OLT will select any ONU as the last ONU, completely eliminating the idle time.Figure 1
An example for the DP-DBA algorithm under high traffic load conditions.(2) No Granted Bandwidths Are Long Enough. The second case is that the OLT cannot find any ONU withREPORT of large enough bandwidth request when all the ONUs are operating at a light traffic load. To deal with this case, a compensation scheme is needed so that other granted data is arranged together during an idle period after the last granted bandwidth so as to use the remainder space of the idle time (designated Lins). One guard time distance (Lg) is necessary between each neighboring granted bandwidth of the ONUs that will be laid out together in the Lins. This is a control overhead of the Sort-DBA scheme. Therefore, to minimize bandwidth waste when using the remainder Lins, each selected granted bandwidth must be larger than Lg to avoid extra waste caused by this process.


### 2.2. Intrapolling Scheme

During each cycle time, if we can assign the remaining bandwidth of the light load ONUs to the heavy load ONUs, then bandwidth utilization can be improved. Design of the intrapolling mechanism is based on this concept. Two polling tables are needed at OLT. Layer I polling table records the bandwidth request (Rir) and RTT of each ONUi. Layer II polling table records the extra bandwidth requests (Riq) from the heavy load ONUs. We can say that the interpolling, which uses Layer I polling table, is used for inter-ONU scheduling. But the intrapolling, which uses Layer II polling table, is used by the OLT to deal with the extra bandwidth distribution. The intrapolling is different from the intra-ONU scheduling, which is performed by the ONU for bandwidth distribution to queues in ONU. Detailed operations are addressed in the following.(
1
) A light load ONUi piggybacks its bandwidth request (Rir) for the next transmission cycle to the OLT. The OLT grants ONUi the assigned bandwidth (Big) according to its bandwidth request (Rir). Next the OLT calculates the remaining bandwidth (Bir) which is defined in the following equation as(3)Bir=Bmin⁡-Rir.The OLT gathers the accumulated remaining bandwidth (Bexcesstotal) which is expressed in the following equation as(4)Bexcesstotal=∑i=1MBir,where M is the number of the light load ONUs. A heavy load ONUk also piggybacks its bandwidth requirement (Rkr) for the next transmission cycle to the OLT. In addition to Rkr, an extra request about the extra need (Rkq) for bandwidth is also piggybacked in the transmission data. Again, the OLT grants the ONUk the assigned bandwidth (Bkg). As for the Rkq, it is recorded in Layer II polling table. Instead of distributing the remaining bandwidth equal to the heavy load ONUs, we make use of a polling scheme to record their extra bandwidth needs in the intrapolling table. Because of the prohibition of frame fragmentation in IEEE 802.3ah, there is still a possibility that if we share the remaining bandwidth to the heavy load ONUs equally or by their weighting, the bandwidth gap to Bmin⁡ may waste bandwidth. The granted excess bandwidth (Bkq) for ONUk is calculated according to the following equation as(5)Bkq=Rkq,ifRkq<BexcesstotalBexcesstotal,ifRkq≥Bexcesstotal.If the extra demand of one specific ONU is satisfied, the entry of that ONU at the intrapolling table will be erased. Otherwise, from the fairness point of view, the precedence of the heavy load ONUk is changed to be the last one in the intrapolling table if it is served in this round of excess bandwidth allocation. Also, Rkq is updated as (Rkq-Bkq). Values in Layer I and Layer II polling tables are overwritten with the latest values from reports from ONUs. Except for the information of the served ONUs in Layer II, values of the fields in both tables are overwritten.We illustrate the DP-DBA operation with the following example. The network settings are shown in Figure2. Suppose that there are five ONUs in the system, ONU1,ONU2,…,ONU5. The distance between the ONUs and OLT is set as 20 Km. The SLA is the same for the ONUs. Other parameters are Tg=1 us, Ru=1 Gb/s, TDBA=0, and TONU=0. Based on (1), we calculate Bmin⁡=24.375 Kbytes. At cycle time I, after all the requests arrive at the OLT, Rir is recorded as in Table 1(a) and Riq is recorded as in Table 1(b). Here, the bandwidth requests are set as follows: R1r=12KB, R2r=23 KB, R3r=24.375 KB, R4r=7.9 KB, and R5r=23.9 KB. The extra need in bandwidth is set as follows: R2q=20 KB, R3q=50 KB, and R5q=19 KB. Consider the remaining bandwidth in (3) and the prohibition of frame fragmentation. The remaining bandwidths (Bir) of each ONU are B1r=12.375 KB, B2r=1.375 KB, B4r=16.475 KB, and B5r=0.475 KB. Then, we have Bexcesstotal=30.7KB which will be distributed to ONU2 and then ONU3 in order. ONU3’s extra bandwidth need is partially satisfied and set to be the last one with lowest priority of the intrapolling table. Note the gap between the requested bandwidth and Bmin⁡ of ONU2 in Table 1, which is a consequence of packet fragmentation being prohibited in IEEE 802.3ah.Table 1
Polling tables of the DP-DBA algorithm.
(a)
Layer I polling table
ONU
R
i
r
RTT
1
12,000
600
2
23,000
880
3
24,375
750
4
7,900
1,100
5
23,900
1,000
(b)
Layer II polling table
ONU
R
i
q
2
20,000
3
50,000
5
19,000
(c)
Layer II polling table after intrapolling
ONU
R
i
q
5
19,000
3
39,300Figure 2
ONU bandwidth requests in the intrapolling scheme for cycle timeI.OLT checks the intrapolling table and decides to assignB2q=20 KB (first priority in the table) and B3q=10.7 KB (second priority). But ONU3 still has extra need for bandwidth. For a fairness basis, the precedence of ONU3 is now changed to be the least one. The updated intrapolling table is shown in Table 1(c).Considering the packet header and the guard time overhead, we can calculate the average system throughput as follows. HereH is the size of the packet header and N is the number of ONUs. The number of light load ONUs is M:(6)ηav=∑i=1NBir+∑i=1MBiqN(H+TgRu)+∑i=1NBir+∑i=1MBiq.The maximum frame length of the system can be expressed as(7)Tmax⁡=NH+TgRu+∑i=1NBir+∑i=1MBiq.


## 2.1. Interpolling Scheme

For general DBA algorithms, an OLT cannot start DBA operation for cycle time(I+1) until receiving all theREPORT messages from the ONUs during cycle time I. After processing the messages, the upstream bandwidth allocation decision for cycle time (I+1) can be made and broadcasted to the ONUs. However, the idle time period at the upstream side between the last transmission data at cycle time I and the first transmission data at cycle time (I+1) is wasted. Referring to [17], we can express the idle period as (1)Tidle=Tdba+RTT+TONU,where the processing time of the DBA algorithm is denoted as Tdba, RTT denotes the round-trip time from ONU to OLT, and TONU denotes the processing time of the ONU.The upstream direction of the line is undoubtedly idled because all ONUs are waiting for the grant messages of the next cycle. Such an idle period degrades the performance in terms of bandwidth utilization. To address the idle period problem and excess bandwidth collection, we propose a novel DBA algorithm that combines the Sort-DBA scheme with a dual-polling mechanism for excess bandwidth redistribution. To eliminate the idle time according to the bandwidth demands of all ONUs, the Sort-DBA scheme can be divided into two cases. The two cases are described as follows.(1) At Least One REPORT Is Long Enough. In Figure 1, during the cycle time I, the RN-1 is arranged to be the last one to transmit data, and it has enough granted bandwidth length to let the OLT send all theGATEs for the ONUs. Note that we can make the ONU piggyback itsREPORT in front of its transmission data by sending theGATE message two times. OneGATE message records the transmission time of theREPORT massage. The other records the granted bandwidth and transmission time in the next cycle. To compensate the idle time, the granted bandwidth of the last ONU in cycle time (I+1) should be greater than the Bimin⁡ which is expressed as(2)Bimin⁡=KiRu×(Tidle-Tg)8,where Ru is the upstream bandwidth, Tg is the guard time for the OLT power level adjustment and data processing, and Ki varies from the minimum value to the contract value according to the SLA (service level agreement). As for the uniform load pattern, K1=K2=⋯=KN=1 and   Bimin⁡=Bmin⁡. To reduce the delay time, the ONUs transmit their data before theREPORT message except the last ONU. The sequence of transmission ordering is arranged according to the sorting sequence of their granted data size. In Figure 1, the sorted sequence of the granted data size of the ONUs in cycle time I is LN-1≥L2≥LN≥⋯≥L5. Therefore, RN-1 is arranged to be the last one to transmit data. After receiving all theREPORTs from the ONUs, the OLT runs the DBA operation and finds that at cycle time (I+1) there is one ONU (here is the ONU1) that matches the requirement of a request length greater than Bmin⁡. The transmission sequence of other ONUs is assigned according to the sorting order of their requested data size. In this case, the idle time is eliminated completely. If more than one ONU has a request length greater than or equal to Bmin⁡ in the cycle time, the OLT will select any ONU as the last ONU, completely eliminating the idle time.Figure 1
An example for the DP-DBA algorithm under high traffic load conditions.(2) No Granted Bandwidths Are Long Enough. The second case is that the OLT cannot find any ONU withREPORT of large enough bandwidth request when all the ONUs are operating at a light traffic load. To deal with this case, a compensation scheme is needed so that other granted data is arranged together during an idle period after the last granted bandwidth so as to use the remainder space of the idle time (designated Lins). One guard time distance (Lg) is necessary between each neighboring granted bandwidth of the ONUs that will be laid out together in the Lins. This is a control overhead of the Sort-DBA scheme. Therefore, to minimize bandwidth waste when using the remainder Lins, each selected granted bandwidth must be larger than Lg to avoid extra waste caused by this process.


## 2.2. Intrapolling Scheme

During each cycle time, if we can assign the remaining bandwidth of the light load ONUs to the heavy load ONUs, then bandwidth utilization can be improved. Design of the intrapolling mechanism is based on this concept. Two polling tables are needed at OLT. Layer I polling table records the bandwidth request (Rir) and RTT of each ONUi. Layer II polling table records the extra bandwidth requests (Riq) from the heavy load ONUs. We can say that the interpolling, which uses Layer I polling table, is used for inter-ONU scheduling. But the intrapolling, which uses Layer II polling table, is used by the OLT to deal with the extra bandwidth distribution. The intrapolling is different from the intra-ONU scheduling, which is performed by the ONU for bandwidth distribution to queues in ONU. Detailed operations are addressed in the following.(
1
) A light load ONUi piggybacks its bandwidth request (Rir) for the next transmission cycle to the OLT. The OLT grants ONUi the assigned bandwidth (Big) according to its bandwidth request (Rir). Next the OLT calculates the remaining bandwidth (Bir) which is defined in the following equation as(3)Bir=Bmin⁡-Rir.The OLT gathers the accumulated remaining bandwidth (Bexcesstotal) which is expressed in the following equation as(4)Bexcesstotal=∑i=1MBir,where M is the number of the light load ONUs. A heavy load ONUk also piggybacks its bandwidth requirement (Rkr) for the next transmission cycle to the OLT. In addition to Rkr, an extra request about the extra need (Rkq) for bandwidth is also piggybacked in the transmission data. Again, the OLT grants the ONUk the assigned bandwidth (Bkg). As for the Rkq, it is recorded in Layer II polling table. Instead of distributing the remaining bandwidth equal to the heavy load ONUs, we make use of a polling scheme to record their extra bandwidth needs in the intrapolling table. Because of the prohibition of frame fragmentation in IEEE 802.3ah, there is still a possibility that if we share the remaining bandwidth to the heavy load ONUs equally or by their weighting, the bandwidth gap to Bmin⁡ may waste bandwidth. The granted excess bandwidth (Bkq) for ONUk is calculated according to the following equation as(5)Bkq=Rkq,ifRkq<BexcesstotalBexcesstotal,ifRkq≥Bexcesstotal.If the extra demand of one specific ONU is satisfied, the entry of that ONU at the intrapolling table will be erased. Otherwise, from the fairness point of view, the precedence of the heavy load ONUk is changed to be the last one in the intrapolling table if it is served in this round of excess bandwidth allocation. Also, Rkq is updated as (Rkq-Bkq). Values in Layer I and Layer II polling tables are overwritten with the latest values from reports from ONUs. Except for the information of the served ONUs in Layer II, values of the fields in both tables are overwritten.We illustrate the DP-DBA operation with the following example. The network settings are shown in Figure2. Suppose that there are five ONUs in the system, ONU1,ONU2,…,ONU5. The distance between the ONUs and OLT is set as 20 Km. The SLA is the same for the ONUs. Other parameters are Tg=1 us, Ru=1 Gb/s, TDBA=0, and TONU=0. Based on (1), we calculate Bmin⁡=24.375 Kbytes. At cycle time I, after all the requests arrive at the OLT, Rir is recorded as in Table 1(a) and Riq is recorded as in Table 1(b). Here, the bandwidth requests are set as follows: R1r=12KB, R2r=23 KB, R3r=24.375 KB, R4r=7.9 KB, and R5r=23.9 KB. The extra need in bandwidth is set as follows: R2q=20 KB, R3q=50 KB, and R5q=19 KB. Consider the remaining bandwidth in (3) and the prohibition of frame fragmentation. The remaining bandwidths (Bir) of each ONU are B1r=12.375 KB, B2r=1.375 KB, B4r=16.475 KB, and B5r=0.475 KB. Then, we have Bexcesstotal=30.7KB which will be distributed to ONU2 and then ONU3 in order. ONU3’s extra bandwidth need is partially satisfied and set to be the last one with lowest priority of the intrapolling table. Note the gap between the requested bandwidth and Bmin⁡ of ONU2 in Table 1, which is a consequence of packet fragmentation being prohibited in IEEE 802.3ah.Table 1
Polling tables of the DP-DBA algorithm.
(a)
Layer I polling table
ONU
R
i
r
RTT
1
12,000
600
2
23,000
880
3
24,375
750
4
7,900
1,100
5
23,900
1,000
(b)
Layer II polling table
ONU
R
i
q
2
20,000
3
50,000
5
19,000
(c)
Layer II polling table after intrapolling
ONU
R
i
q
5
19,000
3
39,300Figure 2
ONU bandwidth requests in the intrapolling scheme for cycle timeI.OLT checks the intrapolling table and decides to assignB2q=20 KB (first priority in the table) and B3q=10.7 KB (second priority). But ONU3 still has extra need for bandwidth. For a fairness basis, the precedence of ONU3 is now changed to be the least one. The updated intrapolling table is shown in Table 1(c).Considering the packet header and the guard time overhead, we can calculate the average system throughput as follows. HereH is the size of the packet header and N is the number of ONUs. The number of light load ONUs is M:(6)ηav=∑i=1NBir+∑i=1MBiqN(H+TgRu)+∑i=1NBir+∑i=1MBiq.The maximum frame length of the system can be expressed as(7)Tmax⁡=NH+TgRu+∑i=1NBir+∑i=1MBiq.


## 3. Analytical Delay

In this section, we propose two models for the IPACT-limited and Sort-DBA schemes’ delay analysis. With the analytical equations in Section3.2, we can explain why the Sort-DBA scheme outperforms the IPACT-limited scheme when the network is medium-loaded. From the model described in Section 3.1, we can see why the improvement made by the Sort-DBA scheme decreases as the network is heavy-loaded.In Section3.1, from the viewpoint of a specific frame arriving at the ONU buffer, we derive a general analytical equation to estimate the delay experienced by this specific frame. Next, in Section 3.2, from the viewpoint of unbalanced ONU loads, we derive equations for deferred traffic of both schemes. The deferred traffic has to wait for another cycle time or more to be delivered. Therefore, less deferred traffic means less average packet delay.


### 3.1. Estimated Delay from the Point of a Specific Frame

Here, we assume there is a specific frame,α, which arrives at the ONU buffer and sees that there are already SLOG bytes in buffer before him. Intuitively, the frames ahead of α must be transmitted and then α can be delivered. In this part, we assume all the ONU loads are balanced. We vary the maximum cycle time Tmax⁡ and SLOG to see the delay experienced by α. Other system parameters are listed as follows: guard time: (= 1 us), idle time: Tidle (= 0 us), number of ONUs: N (= 16), line rate (upstream): RU (= 1 Gbps), report size: Lrequest (= 64 bytes), and unused slot remainder: LUSR (= 503 bytes). First, we calculate the effective granted bandwidth of each ONU during a cycle time:(8)BWeffective=RUN×(Tmax⁡-N×Tg-Tidle)-Lrequest-LUSR.The frames before α may take several rounds of cycles to be delivered. [x] is a function to take the round-down value of x. Besides, according to the polling mechanism, α averagely has to wait half of the cycle time to be reported to the OLT. Now, we derive the average delay equation:(9)D=SLOGBWeffective×Tmax⁡+1RU×SLOG-SLOGBWeffective×BWeffective+Tmax⁡2.We vary the maximum cycle time from 0.5 ms to 4 ms. With SLOG ranging from 1 KB to 10 MB, Figure 3 shows the delay ratio value with different parameter settings. The 2 ms (the maximum cycle time) case is used as the normalized basis.Figure 3
Estimated delay ratio.From the aspect ofSLOF, taking the 1 KB (blue line with diamond shape) case, for example, we can tell that larger Tmax⁡ incurs more delay. However, as for the 1 MB case, the increase of Tmax⁡ can slightly decrease the delay. This accounts for the phenomenon that as the network is heavy-loaded, the slight improvement is made by the Sort-DBA scheme. However, it also implies that increasing Tmax⁡ is not the main reason which accounts for the delay improvement made by the Sort-DBA scheme when the network is medium-loaded. With careful examination, we find that the answer lies in the unbalanced ONU loads.


### 3.2. Delay Analysis under Unbalanced ONU Loads

With considering the unbalanced ONU loads, we analyze the delay performance of the IPACT-limited and Sort-DBA schemes. Rather than calculation of the delay, we calculate the amount of the deferred traffic during a cycle round for both schemes. It is easy to figure out that if there is more deferred traffic in the IPACT-limited scheme than in the Sort-DBA scheme, more time will be taken for the IPACT-limited scheme to deliver the deferred traffic. Accordingly, the delay performance of the IPACT-limited scheme is deteriorated.Here are the system parameters: number of ONUs:N (= 16), maximum transmission window size: BWIPACT-limitedmin⁡ (= 15 KB), BWSort-DBAmin⁡ (= 24.875 KB), total request bandwidth BWtotalrequest (= 180K to 240K), number of unbalanced ONU pairs (= 1 to 7), and unbalanced factor β (= 0.5 to 0.8).We useK and β to mimic different conditions of the unbalanced ONU loads. For simplicity, we assume there are only three kinds of ONUs, namely, heavy-loaded ONU, medium-loaded ONU, and light-loaded ONU. The traffic load ratio of them is (1+β) : β : (1-β). Now, under the same BWtotalrequest, we derive the total granted bandwidth equations for both schemes:(10)BWtotal-grantIPACT-limited=K×min⁡⁡1+β×BWtotalgrantN,15K=Kxx×+1+β×BWtotalgrantN+(N-2K)×BWtotalgrantN,BWtotal-grantSort-DBA=K×min⁡1+β×BWtotalgrantN,24.875Ksssssss+(1+β)×BWtotalgrantN+(N-2K)×BWtotalgrantN.With the parameter settings, BWtotalrequest={180K,200K,220K,240K} and β={0.5,0.8}, Figure 4 shows the ratio of BWtotal-grantIPACT-limited to BWtotal-grantSort-DBA as a function of number of unbalanced ONU pairs.Figure 4
Total granted size ratio.With the plot, we can tell that with the sameBWtotalrequest increasing of unbalanced ONU pairs results in more reduction of the ratio value. This means there is more deferred traffic in the IPACT-limited scheme. Accordingly, it brings delay improvement to the Sort-DBA scheme over the IPACT-limited scheme. So, we may draw the conclusion that the degree of unbalanced loads has a significant influence on the delay performance of DBA schemes. In addition, the increase of β also results in the reduction of the ratio value which implies improvement in delay performance of the Sort-DBA scheme over the IPACT-limited scheme. Now, we can explain the delay improvement of the Sort-DBA scheme when the network is medium-loaded. But why does the improvement decrease as the network becomes heavy-loaded? The answer lies in the loss of the unbalance. When the requests of all ONUs grow to the maximum transmission window size, there is nearly no unbalanced ONU load and the difference of deferred traffic between the two schemes decreases. The situation now goes back to the model mentioned in the previous section and the improvement becomes less significant.


## 3.1. Estimated Delay from the Point of a Specific Frame

Here, we assume there is a specific frame,α, which arrives at the ONU buffer and sees that there are already SLOG bytes in buffer before him. Intuitively, the frames ahead of α must be transmitted and then α can be delivered. In this part, we assume all the ONU loads are balanced. We vary the maximum cycle time Tmax⁡ and SLOG to see the delay experienced by α. Other system parameters are listed as follows: guard time: (= 1 us), idle time: Tidle (= 0 us), number of ONUs: N (= 16), line rate (upstream): RU (= 1 Gbps), report size: Lrequest (= 64 bytes), and unused slot remainder: LUSR (= 503 bytes). First, we calculate the effective granted bandwidth of each ONU during a cycle time:(8)BWeffective=RUN×(Tmax⁡-N×Tg-Tidle)-Lrequest-LUSR.The frames before α may take several rounds of cycles to be delivered. [x] is a function to take the round-down value of x. Besides, according to the polling mechanism, α averagely has to wait half of the cycle time to be reported to the OLT. Now, we derive the average delay equation:(9)D=SLOGBWeffective×Tmax⁡+1RU×SLOG-SLOGBWeffective×BWeffective+Tmax⁡2.We vary the maximum cycle time from 0.5 ms to 4 ms. With SLOG ranging from 1 KB to 10 MB, Figure 3 shows the delay ratio value with different parameter settings. The 2 ms (the maximum cycle time) case is used as the normalized basis.Figure 3
Estimated delay ratio.From the aspect ofSLOF, taking the 1 KB (blue line with diamond shape) case, for example, we can tell that larger Tmax⁡ incurs more delay. However, as for the 1 MB case, the increase of Tmax⁡ can slightly decrease the delay. This accounts for the phenomenon that as the network is heavy-loaded, the slight improvement is made by the Sort-DBA scheme. However, it also implies that increasing Tmax⁡ is not the main reason which accounts for the delay improvement made by the Sort-DBA scheme when the network is medium-loaded. With careful examination, we find that the answer lies in the unbalanced ONU loads.


## 3.2. Delay Analysis under Unbalanced ONU Loads

With considering the unbalanced ONU loads, we analyze the delay performance of the IPACT-limited and Sort-DBA schemes. Rather than calculation of the delay, we calculate the amount of the deferred traffic during a cycle round for both schemes. It is easy to figure out that if there is more deferred traffic in the IPACT-limited scheme than in the Sort-DBA scheme, more time will be taken for the IPACT-limited scheme to deliver the deferred traffic. Accordingly, the delay performance of the IPACT-limited scheme is deteriorated.Here are the system parameters: number of ONUs:N (= 16), maximum transmission window size: BWIPACT-limitedmin⁡ (= 15 KB), BWSort-DBAmin⁡ (= 24.875 KB), total request bandwidth BWtotalrequest (= 180K to 240K), number of unbalanced ONU pairs (= 1 to 7), and unbalanced factor β (= 0.5 to 0.8).We useK and β to mimic different conditions of the unbalanced ONU loads. For simplicity, we assume there are only three kinds of ONUs, namely, heavy-loaded ONU, medium-loaded ONU, and light-loaded ONU. The traffic load ratio of them is (1+β) : β : (1-β). Now, under the same BWtotalrequest, we derive the total granted bandwidth equations for both schemes:(10)BWtotal-grantIPACT-limited=K×min⁡⁡1+β×BWtotalgrantN,15K=Kxx×+1+β×BWtotalgrantN+(N-2K)×BWtotalgrantN,BWtotal-grantSort-DBA=K×min⁡1+β×BWtotalgrantN,24.875Ksssssss+(1+β)×BWtotalgrantN+(N-2K)×BWtotalgrantN.With the parameter settings, BWtotalrequest={180K,200K,220K,240K} and β={0.5,0.8}, Figure 4 shows the ratio of BWtotal-grantIPACT-limited to BWtotal-grantSort-DBA as a function of number of unbalanced ONU pairs.Figure 4
Total granted size ratio.With the plot, we can tell that with the sameBWtotalrequest increasing of unbalanced ONU pairs results in more reduction of the ratio value. This means there is more deferred traffic in the IPACT-limited scheme. Accordingly, it brings delay improvement to the Sort-DBA scheme over the IPACT-limited scheme. So, we may draw the conclusion that the degree of unbalanced loads has a significant influence on the delay performance of DBA schemes. In addition, the increase of β also results in the reduction of the ratio value which implies improvement in delay performance of the Sort-DBA scheme over the IPACT-limited scheme. Now, we can explain the delay improvement of the Sort-DBA scheme when the network is medium-loaded. But why does the improvement decrease as the network becomes heavy-loaded? The answer lies in the loss of the unbalance. When the requests of all ONUs grow to the maximum transmission window size, there is nearly no unbalanced ONU load and the difference of deferred traffic between the two schemes decreases. The situation now goes back to the model mentioned in the previous section and the improvement becomes less significant.


## 4. Simulation Results and Discussions

We compare the performance of our proposed DP-DBA to five other well-known schemes, that is, IPACT with fixed service (IPACT-fixed), IPACT with limited service (IPACT-limited), DBA2 with fair-excess (DBA2-FE), Double-Phase Polling (DPP), and Sort-DBA [11, 12, 16, 17]. The performance metrics include average transfer delay and average grant length. Simulations are conducted by SIMSCRIPT II.5. The simulation setup parameters are described as follows. We use the Poisson traffic generation for packet arrival. The interarrival time of the packets follows the exponential distribution. The IP packet length at each ONU is generated according to the packet size distribution of the MCI backbone OC-3 links [22]. The mean size is about 353.8 bytes. The upstream total bandwidth (Ru) is 1 Gbps. The distance between the OLT and each ONU is 20 Km. The buffer size at an ONU is 1 Mbyte. The guard time (Ru) is 1 μs. The size of theREPORT is 64 bytes. The number of ONUs is 15. For the IPACT-fixed, IPACT-limit, and DBA2-FE schemes, Bmin⁡ is calculated to be 15 Kbytes according to their definition. For the Sort-DBA and DP-DBA schemes, Bmin⁡ is defined as 24.876 Kbytes. In addition to using the uniform load of the ONUs as input, we also make use of the asymmetrical load to evaluate the performance in terms of the transfer delay, average queue delay, and average granted data length.


### 4.1. ONU Balanced Traffic Load

Figure5 shows the simulation results for the average transfer delay of five schemes, that is, IPACT-fixed, IPACT-limited, DBA2-FE, Sort-DBA, and our DP-DBA. Here an ONU uniform traffic load pattern is used. Later, the simulation results will illustrate how the ONU traffic load pattern affects the performance of all five schemes. As seen in Figure 5, the x-axis is the offered load and the y-axis is the average transfer delay. At about 56 Mbps, the average transfer delay of the DBA2-FE scheme rises quickly. For the other schemes, the curves rise at approximately 62~64 Mbps. We can see that the DP-DBA and Sort-DBA perform the best among the different schemes. This is because the REPORT message of the last ONU is delivered in advance of the data transfer, so DBA operation at the OLT can be started early. Under the condition of at least one heavy load ONU, the idle time problem can be solved completely since the OLT can deliver GATE messages to all ONUs in time. This significantly reduces waiting time and wasted bandwidth. In contrast, if all ONUs have heavy load requests above Bmin⁡, the early allocation mechanism of DBA2 with a fair-excess scheme cannot solve the idle time problem perfectly, resulting in decreased system performance. Regarding the IPACT-fixed scheme, the fixed bandwidth assignment mechanism cannot deal with the idle time issue so it performs better than the DBA2-FE scheme. However, the assigned bandwidth of the light load ONUs is wasted, thus lowering the performance. In the DPP scheme, we can see the delay improvement of the DPP scheme over the DBA2-FE scheme. With this reason, due to the group separation, there is the possibility that the idle time appears when the loads of the other group are not large enough. The performance of the DPP scheme lies between the DBA2-FE and the IPACT-limited schemes.Figure 5
Average transfer delay per ONU for IPACT-fixed, IPACT-limited, DPP, DBA2-FE, Sort-DBA, and DP-DBA schemes under ONU balanced traffic load.Figure6 shows the average granted data length as a function of the offered load under an ONU balanced traffic load. At medium load, the Sort-DBA and DP-DBA schemes increase the demand length of each ONU to Bmin⁡ to eliminate idle time, so the average granted data length per ONU is more than the other DBA schemes. However, DP-DBA has a shorter granted data length than the Sort-DBA scheme at heavy load. The reason is that the intrapolling scheme of DP-DBA makes use of remaining bandwidth of the overloaded ONUs to reduce the average granted data length. For IPACT-fixed and IPACT-limited schemes, a maximum transmission window of 15 Kbytes is specified for each ONU to ensure that the cycle time is no more than 2 ms for delay-sensitive applications. As for the IPACT-fixed scheme with our traffic model, we find that the average granted data length per ONU in one cycle under heavy load is only 14.5 Kbytes. This is because the prohibition of fragmentation to Ethernet frames makes the ONU unable to fully utilize the maximum transmission window with FIFO queue discipline. The average granted data length with the IPACT-limited scheme is even smaller than that with IPACT-fixed scheme for light to high loads because the IPACT-limited scheme always grants the requested data with the real load demand of each ONU so as to obtain the shortest transmission cycle. The average granted data length with the DBA2-FE scheme is close to 15 Kbytes. This is because the DBA2-FE scheme always allocates the remaining idle slots to other ONUs when the transmission demand is excessive. In this figure, we can also find that the average granted data length of the DPP scheme increases rapidly when the offered load goes beyond 59 Mbps. This is consistent with the delay performance of the DPP scheme in Figure 5.Figure 6
Average granted data length per ONU for IPACT-fixed, IPACT-limited, DPP, DBA2-FE, Sort-DBA, and DP-DBA schemes.The performance difference between DP-DBA and the other schemes is not significant because under ONU uniform traffic load conditions all ONUs are underBmin⁡ or all ONUs need extra bandwidth to transmit data. Therefore, the intrapolling scheme of DP-DBA cannot be used efficiently since, under heavy load condition, the remaining bandwidth for reallocation is very limited.


### 4.2. ONU Asymmetrical Traffic Load

In real EPON systems, the ONU traffic load pattern is not uniform. Thus, we simulate the performance of the same five schemes mentioned in Section4.1 in terms of average transfer delay, average queuing delay, and average granted data length. In fact, it will be seen that our proposed DP-DBA performs well, especially in the asymmetrical load case for our intrapolling scheme. The asymmetrical settings are described as follows. The number of ONUs is 15 and one-third of them are light load, one-third are medium load, and one third are heavy load. The bandwidth requirement ratio of light load, medium load, and heavy load is 1 : 2 : 3. Other settings are the same as those used in part Section 4.1. Referring to Figure 4, the simulation setting is close to the number of unbalanced ONU pairs being equal to 5 and the unbalanced factor β being equal to 0.5. In the following figures, we will see that the ratio of the granted bandwidth size in IPACT-LS over that in the IPACT-limited scheme over that in DP-DBA decreases more when applying the asymmetric traffic load as compared to that with symmetric traffic load.The average ONU transfer delay is shown in Figure7. The x-axis is the offered load (Mbps) which varies according to the generated traffic at each ONU. The y-axis is the simulation results for the average transfer delay measured in milliseconds. We can see the difference of average transfer delay for the balanced traffic load (Figure 5) and the asymmetrical traffic load. There are three sections of strongly rising curves among the five schemes. The initial rising sections are due to the heavy load ONUs. Figure 7 shows that DP-DBA performs the best because it is the last curve to start rising, that is, at about 67 Mbps. Excepting the IPACT-fixed scheme which starts rising early, DP-DBA can make use of 2 Mbps more than the Sort-DBA and IPACT-limited schemes. This is because of the intrapolling scheme of DP-DBA. The IPACT-fixed scheme uses the fixed bandwidth allocation mechanism and wastes most of the bandwidth which can be reassigned to the heavy load ONUs, which leads to early rising in the average transfer delay. As the traffic load increases, the medium load ONUs start to contribute to rising average transfer delay. Finally, all the ONUs are overloaded, and there is little performance difference among the four schemes except the DBA2-FE. This is because there is little room for bandwidth to be assigned for heavy load ONUs. Thus, DP-DBA performs as well as the other schemes. Note that the DBA2-FE scheme suffers from more average transfer delay than the other schemes under heavy load conditions. This is due to the failure of the early allocation mechanism, which results from all ONUs being overloaded. The idle time problem results in significant increase to the average transfer delay of the DBA2-FE scheme.Figure 7
Average transfer delay per ONU for the IPACT-fixed, IPACT-limited, DPP, DBA2-FE, Sort-DBA, and DP-DBA schemes under ONU asymmetrical traffic load.In Figure7, the average transfer delay of the DPP scheme behaves similarly to other schemes under ONU asymmetrical traffic load. When the offered load goes beyond 120 Mb/s and that means all ONUs are heavy-loaded, the performance of the DPP scheme is close to the IPACT-limited scheme.We collect the average queuing delay results of DP-DBA and the Sort-DBA scheme for further analysis regarding the performance difference between them under varying offered traffic load conditions. Figure8 shows that, under light offered traffic load, the heavy load ONUs of DP-DBA can achieve 67 Mbps while those ONUs of the Sort-DBA scheme achieve only 65 Mbps. This is because the intrapolling mechanism of DP-DBA helps the heavy load ONUs make use of the unused bandwidth of the medium and light load ONUs. As the offered load increases, there is less bandwidth that can be allotted to ONUs with extra bandwidth requirements. Then the performance difference between DP-DBA and the Sort-DBA schemes becomes less significant.Figure 8
ONU average queuing delay under an asymmetrical load pattern.Figure9 shows the average granted data length at the ONUs for the five schemes. According to the simulation settings, Bmin⁡ is calculated as 15 Kbytes for the IPACT-fixed, IPACT-limited, and DBA2-FE schemes and 24.876 Kbytes for the Sort-DBA and DP-DBA schemes. DP-DBA still performs the best among the five schemes because the average granted data length of ONUs can fully utilize the bandwidth Bmin⁡ with the help of intrapolling table. The Sort-DBA and IPACT-limited schemes also have the ability to adjust the frame size dynamically according to the bandwidth requests from the ONUs. However, they do not allot the remaining bandwidth to the heavy load ONUs. According to the IEEE 802.3ah, frame fragmentation is prohibited, resulting in the frame size of the IPACT-limited scheme being 14.5 Kbytes instead of 15 Kbytes (Bmin⁡). The DBA2-FE scheme achieves the least average granted data length due to the idle time problem which comes from failure of the early allocation scheme. Meanwhile, the frame fragmentation problem of IEEE 802.3ah also contributes to the decrease of the average granted data length. Note that, under an asymmetrical traffic load, the DBA2-FE scheme cannot perform as well as it does in the balanced load condition. Besides, the average granted data length the DPP scheme grows in a way similar to that of the IPACT-limited scheme, especially when the network load is larger than 70 Mb/s.Figure 9
Average granted data length per ONU for IPACT-fixed, IPACT-limited, DBA2-FE, DP-DBA, and Sort-DBA schemes under an asymmetrical traffic load.The presented simulation results show that the proposed DP-DBA method achieves higher utilization under most load conditions than the other DBA algorithms. With the help of the intrapolling mechanism, the remaining bandwidth can be assigned to the heavy load ONUs, thereby reducing the queuing time of the data. The idle time can be eliminated if there is at least one ONU which requests bandwidth more thanBmin⁡. DP-DBA performs better when the ONU traffic load pattern is asymmetrical. Such settings are closer to the real world network environment.


## 4.1. ONU Balanced Traffic Load

Figure5 shows the simulation results for the average transfer delay of five schemes, that is, IPACT-fixed, IPACT-limited, DBA2-FE, Sort-DBA, and our DP-DBA. Here an ONU uniform traffic load pattern is used. Later, the simulation results will illustrate how the ONU traffic load pattern affects the performance of all five schemes. As seen in Figure 5, the x-axis is the offered load and the y-axis is the average transfer delay. At about 56 Mbps, the average transfer delay of the DBA2-FE scheme rises quickly. For the other schemes, the curves rise at approximately 62~64 Mbps. We can see that the DP-DBA and Sort-DBA perform the best among the different schemes. This is because the REPORT message of the last ONU is delivered in advance of the data transfer, so DBA operation at the OLT can be started early. Under the condition of at least one heavy load ONU, the idle time problem can be solved completely since the OLT can deliver GATE messages to all ONUs in time. This significantly reduces waiting time and wasted bandwidth. In contrast, if all ONUs have heavy load requests above Bmin⁡, the early allocation mechanism of DBA2 with a fair-excess scheme cannot solve the idle time problem perfectly, resulting in decreased system performance. Regarding the IPACT-fixed scheme, the fixed bandwidth assignment mechanism cannot deal with the idle time issue so it performs better than the DBA2-FE scheme. However, the assigned bandwidth of the light load ONUs is wasted, thus lowering the performance. In the DPP scheme, we can see the delay improvement of the DPP scheme over the DBA2-FE scheme. With this reason, due to the group separation, there is the possibility that the idle time appears when the loads of the other group are not large enough. The performance of the DPP scheme lies between the DBA2-FE and the IPACT-limited schemes.Figure 5
Average transfer delay per ONU for IPACT-fixed, IPACT-limited, DPP, DBA2-FE, Sort-DBA, and DP-DBA schemes under ONU balanced traffic load.Figure6 shows the average granted data length as a function of the offered load under an ONU balanced traffic load. At medium load, the Sort-DBA and DP-DBA schemes increase the demand length of each ONU to Bmin⁡ to eliminate idle time, so the average granted data length per ONU is more than the other DBA schemes. However, DP-DBA has a shorter granted data length than the Sort-DBA scheme at heavy load. The reason is that the intrapolling scheme of DP-DBA makes use of remaining bandwidth of the overloaded ONUs to reduce the average granted data length. For IPACT-fixed and IPACT-limited schemes, a maximum transmission window of 15 Kbytes is specified for each ONU to ensure that the cycle time is no more than 2 ms for delay-sensitive applications. As for the IPACT-fixed scheme with our traffic model, we find that the average granted data length per ONU in one cycle under heavy load is only 14.5 Kbytes. This is because the prohibition of fragmentation to Ethernet frames makes the ONU unable to fully utilize the maximum transmission window with FIFO queue discipline. The average granted data length with the IPACT-limited scheme is even smaller than that with IPACT-fixed scheme for light to high loads because the IPACT-limited scheme always grants the requested data with the real load demand of each ONU so as to obtain the shortest transmission cycle. The average granted data length with the DBA2-FE scheme is close to 15 Kbytes. This is because the DBA2-FE scheme always allocates the remaining idle slots to other ONUs when the transmission demand is excessive. In this figure, we can also find that the average granted data length of the DPP scheme increases rapidly when the offered load goes beyond 59 Mbps. This is consistent with the delay performance of the DPP scheme in Figure 5.Figure 6
Average granted data length per ONU for IPACT-fixed, IPACT-limited, DPP, DBA2-FE, Sort-DBA, and DP-DBA schemes.The performance difference between DP-DBA and the other schemes is not significant because under ONU uniform traffic load conditions all ONUs are underBmin⁡ or all ONUs need extra bandwidth to transmit data. Therefore, the intrapolling scheme of DP-DBA cannot be used efficiently since, under heavy load condition, the remaining bandwidth for reallocation is very limited.


## 4.2. ONU Asymmetrical Traffic Load

In real EPON systems, the ONU traffic load pattern is not uniform. Thus, we simulate the performance of the same five schemes mentioned in Section4.1 in terms of average transfer delay, average queuing delay, and average granted data length. In fact, it will be seen that our proposed DP-DBA performs well, especially in the asymmetrical load case for our intrapolling scheme. The asymmetrical settings are described as follows. The number of ONUs is 15 and one-third of them are light load, one-third are medium load, and one third are heavy load. The bandwidth requirement ratio of light load, medium load, and heavy load is 1 : 2 : 3. Other settings are the same as those used in part Section 4.1. Referring to Figure 4, the simulation setting is close to the number of unbalanced ONU pairs being equal to 5 and the unbalanced factor β being equal to 0.5. In the following figures, we will see that the ratio of the granted bandwidth size in IPACT-LS over that in the IPACT-limited scheme over that in DP-DBA decreases more when applying the asymmetric traffic load as compared to that with symmetric traffic load.The average ONU transfer delay is shown in Figure7. The x-axis is the offered load (Mbps) which varies according to the generated traffic at each ONU. The y-axis is the simulation results for the average transfer delay measured in milliseconds. We can see the difference of average transfer delay for the balanced traffic load (Figure 5) and the asymmetrical traffic load. There are three sections of strongly rising curves among the five schemes. The initial rising sections are due to the heavy load ONUs. Figure 7 shows that DP-DBA performs the best because it is the last curve to start rising, that is, at about 67 Mbps. Excepting the IPACT-fixed scheme which starts rising early, DP-DBA can make use of 2 Mbps more than the Sort-DBA and IPACT-limited schemes. This is because of the intrapolling scheme of DP-DBA. The IPACT-fixed scheme uses the fixed bandwidth allocation mechanism and wastes most of the bandwidth which can be reassigned to the heavy load ONUs, which leads to early rising in the average transfer delay. As the traffic load increases, the medium load ONUs start to contribute to rising average transfer delay. Finally, all the ONUs are overloaded, and there is little performance difference among the four schemes except the DBA2-FE. This is because there is little room for bandwidth to be assigned for heavy load ONUs. Thus, DP-DBA performs as well as the other schemes. Note that the DBA2-FE scheme suffers from more average transfer delay than the other schemes under heavy load conditions. This is due to the failure of the early allocation mechanism, which results from all ONUs being overloaded. The idle time problem results in significant increase to the average transfer delay of the DBA2-FE scheme.Figure 7
Average transfer delay per ONU for the IPACT-fixed, IPACT-limited, DPP, DBA2-FE, Sort-DBA, and DP-DBA schemes under ONU asymmetrical traffic load.In Figure7, the average transfer delay of the DPP scheme behaves similarly to other schemes under ONU asymmetrical traffic load. When the offered load goes beyond 120 Mb/s and that means all ONUs are heavy-loaded, the performance of the DPP scheme is close to the IPACT-limited scheme.We collect the average queuing delay results of DP-DBA and the Sort-DBA scheme for further analysis regarding the performance difference between them under varying offered traffic load conditions. Figure8 shows that, under light offered traffic load, the heavy load ONUs of DP-DBA can achieve 67 Mbps while those ONUs of the Sort-DBA scheme achieve only 65 Mbps. This is because the intrapolling mechanism of DP-DBA helps the heavy load ONUs make use of the unused bandwidth of the medium and light load ONUs. As the offered load increases, there is less bandwidth that can be allotted to ONUs with extra bandwidth requirements. Then the performance difference between DP-DBA and the Sort-DBA schemes becomes less significant.Figure 8
ONU average queuing delay under an asymmetrical load pattern.Figure9 shows the average granted data length at the ONUs for the five schemes. According to the simulation settings, Bmin⁡ is calculated as 15 Kbytes for the IPACT-fixed, IPACT-limited, and DBA2-FE schemes and 24.876 Kbytes for the Sort-DBA and DP-DBA schemes. DP-DBA still performs the best among the five schemes because the average granted data length of ONUs can fully utilize the bandwidth Bmin⁡ with the help of intrapolling table. The Sort-DBA and IPACT-limited schemes also have the ability to adjust the frame size dynamically according to the bandwidth requests from the ONUs. However, they do not allot the remaining bandwidth to the heavy load ONUs. According to the IEEE 802.3ah, frame fragmentation is prohibited, resulting in the frame size of the IPACT-limited scheme being 14.5 Kbytes instead of 15 Kbytes (Bmin⁡). The DBA2-FE scheme achieves the least average granted data length due to the idle time problem which comes from failure of the early allocation scheme. Meanwhile, the frame fragmentation problem of IEEE 802.3ah also contributes to the decrease of the average granted data length. Note that, under an asymmetrical traffic load, the DBA2-FE scheme cannot perform as well as it does in the balanced load condition. Besides, the average granted data length the DPP scheme grows in a way similar to that of the IPACT-limited scheme, especially when the network load is larger than 70 Mb/s.Figure 9
Average granted data length per ONU for IPACT-fixed, IPACT-limited, DBA2-FE, DP-DBA, and Sort-DBA schemes under an asymmetrical traffic load.The presented simulation results show that the proposed DP-DBA method achieves higher utilization under most load conditions than the other DBA algorithms. With the help of the intrapolling mechanism, the remaining bandwidth can be assigned to the heavy load ONUs, thereby reducing the queuing time of the data. The idle time can be eliminated if there is at least one ONU which requests bandwidth more thanBmin⁡. DP-DBA performs better when the ONU traffic load pattern is asymmetrical. Such settings are closer to the real world network environment.


## 5. Conclusion

This paper has proposed a dual-polling DBA algorithm for EPON systems. The proposed scheme consists of two main elements, namely, the interpolling and intrapolling mechanisms. Interpolling mechanism is designed to deal with the idle time problem. For choosing oneONUi whose request bandwidth is larger than Bmin⁡, the OLT assigns the ONUi to be the last of the transmission ONU sequence and makes ONUi transmit its REQUEST before data transmission. The transmission order of the other ONUs is arranged according to their bandwidth REQEST size. After collecting the unused bandwidth from the light load ONUs, the intrapolling mechanism helps in assigning the unused bandwidth from the light load ONUs to the heavy load ONUs. It works very well when the ONU load pattern is asymmetrical. The proposed DP-DBA is being compared with the IPACT, DBA2-FE, and Sort-DBA schemes in terms of average transfer delay and average granted data length. Simulation results show that DP-DBA outperforms the other schemes when the offered traffic load is experiencing overload conditions. In particular when the traffic pattern is asymmetrical, DP-DBA is superior to the other systems because of the intrapolling mechanism. By reallocation of the unused bandwidth from the light load ONUs to the heavy load ONUs, the average transfer delay can be reduced significantly thanks to the reduction of packet queuing time at the ONUs.



---

*Source: 919278-2015-10-08.xml*