A modified max-min fair dynamic bandwidth allocation algorithm for XG-PONs

Gravalos, I.; Yiannopoulos, K.; Papadimitriou, Georgios I.; Varvarigos, Emmanouel

doi:10.1109/noc.2014.6996828

Cited by 10 publications

(18 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Modification of the Max-Min Fair DBA is designed for XG-PON networks. The modification originated from the Max-Min Fair DBA algorithm, which was developed for G-PON networks [10]. Implementation of this algorithm without changes specific for the XG-PON network caused long delays.…”

Section: Modified Max-min Fair Dbamentioning

confidence: 99%

“…We have developed our XG-PON simulator specially for testing DBA algorithms performance. In the simulator we implemented the static assignment, and three DBA algorithms, namely hybrid reporting allocation (HYRA) [8], gigaPON access network (GIANT) [9], and modified Max-Min [10]. Algorithms were tested for transmission delay and amount of bandwidth waste.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficiency Tests of DBA Algorithms in XG-PON

et al. 2019

View full text Add to dashboard Cite

Sophisticated dynamic bandwidth allocation (DBA) algorithms can dramatically improve or worsen throughput and delay in whole networks. It is very important to choose the right DBA algorithm. Our work tests static assignment and three DBA algorithms, namely GigaPON Access Network DBA, Hybrid Reporting Allocation, and modified Max–Min Fair. All tests were made on our simulator of ten-gigabit passive optical network DBA specially developed for testing DBA algorithms. The tests verify delay of each optical network unit and amount of waste with bandwidth. This paper describes how the used DBA algorithms work and the processes involved in DBA algorithms.

show abstract

Section: Modified Max-min Fair Dbamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficiency Tests of DBA Algorithms in XG-PON

et al. 2019

View full text Add to dashboard Cite

show abstract

“…• Unsaturated ONUs obtain same amount of the remaining bandwidth. Given the max-min fair algorithm, each allocation for ONU n during frame t with grant size W n t is calculated from the following steps [30]: 1) Initialization: Sort ONU demands in an increasing order in set S. Set grant size W n t of ONUs to zero. 2) Calculate available bandwidth:…”

Section: A Max-min Fair Dba Algorithmmentioning

confidence: 99%

Simulations of Grant Allocation in NG-PON2 Networks Using OPNET Modeler

Horváth

Cymorek

Münster

et al. 2018

JCOMSS

View full text Add to dashboard Cite

PONs (Passive Optical Networks) are the most promising networks for the future. In 1998, the first standard of PONs was developed. Since that time, quality of optical transmissions and technologies has been massively improved and today's standards are capable of transferring an enormous amount of data. For example, NG-PON2 networks are able to transfer up to 40 Gbit/s, which means these networks provide subscribers with a symmetric bandwidth up to 10 Gbit/s using 4 different wavelengths. The higher transmission speeds are required, the more sophisticated bandwidth allocation reflecting requirements of each ONU (Optical Network Unit) in real-time is necessary. This article deals with implementation of NG-PON2 networks using OPNET Modeler and simulations of static and dynamic grants allocations. We also present a modification of dynamic bandwidth allocation for increasing the free bandwidth of idle ONU to heavily loaded ONU(s). We propose a simplified NG-PON2 (Next-Generation PON stage 2) network, for example, activation machine for ONUs is not implemented. At present, OPNET Modeler is being used to simulate EPON (Ethernet PON) networks that use a different approach for data transmission. Thanks to its own implementation, basic data transmission in NG-PON2 networks, and simulations of algorithms for dynamic bandwidth allocation can be achieved.

show abstract

“…The voids in S-AMGAV can be filled using simple grant sizing schemes, such as constant-credit or linear-credit schemes, or by using the schemes that are more complex, such as employing max-min fair principles [45] or traffic-prediction algorithms. In this paper, we use the linear-credit scheme, which allocates extra bandwidth in proportion to the load of the ONUs.…”

Section: A Basic Ideamentioning

confidence: 99%

“…Several algorithms have been proposed in which the transmission grant sizes exceed the reported queue depths [8,14,45]. Even so, these algorithms pre-grant users independently of load, which is not optimal (see Section III).…”

Section: Below)mentioning

confidence: 99%

Synergized-Adaptive Multi-GATE Polling With Void Filling: Overcoming Performance Degradation in LR-PONs

Dixit

Lannoo

Colle

et al. 2015

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Several dynamic bandwidth allocation (DBA) algorithms have been proposed for long-reach passive optical networks (LR-PONs). The gains in the current protocols, however, are incremental and limited to a specific range of loads. Using an analytical framework, we first examine the main sources of performance degradation specific to LR-PONs. From this, we conclude that there is a large scope for improvement in the performance by using an optimal cycle length, which is not influenced by reach, and which polls users according to their reported load while providing opportunities for pre-granting bandwidth at the optical network units. The fraction of bandwidth that is pre-granted should be decreased with load. To tailor these optimal design concepts in a DBA algorithm, we propose Synergized-Adaptive Multi-GATE polling with Voidfilling (S-AMGAV), which reduces both the delay bound and packet loss rate by at least 50% when compared to the stateof-the-art DBAs like interleaved polling with adaptive cycle time (IPACT), IPACT with grant estimation (IPACT-GE), multi-thread polling (MTP), double phase polling (DPP), gate driven (GD), and AMGAV. S-AMGAV also maintains simplicity of the protocol while removing bandwidth inefficiencies prevailing in the existing protocols. We verify the usefulness of the algorithm through both analytical modeling and simulations.

show abstract

A modified max-min fair dynamic bandwidth allocation algorithm for XG-PONs

Cited by 10 publications

References 14 publications

Efficiency Tests of DBA Algorithms in XG-PON

Efficiency Tests of DBA Algorithms in XG-PON

Simulations of Grant Allocation in NG-PON2 Networks Using OPNET Modeler

Synergized-Adaptive Multi-GATE Polling With Void Filling: Overcoming Performance Degradation in LR-PONs

Contact Info

Product

Resources

About