An Efficient Dynamic Bandwidth Allocation Algorithm with Two-Round Deliberation in Light-Trail Networks

In modern, competitive, and dynamic access networks the underlying bandwidth distribution mechanism has to be capable of understanding user requirements, meeting stringent quality of service (QoS) demands, and satisfying a broad spectrum of user traffic dynamics. Undoubtedly, optical fiber is the dominant transmission medium enabling practical and cost-effective optical infrastructures in the last mile. Passive optical networks (PONs) represent one of the most promising player towards the fiber to the home (FTTH) vision allowing users to experience high quality, demanding multimedia services and applications. The 10-gigabit-capable passive optical network (XG-PON), one of the latest PON standard, incorporates a set of profound conditions a contemporary PON should ensure. Fairness provisioning constitutes one of the most critical features a PON should provide. However, ensuring fairness in an access network with numerous different users, requesting multiple traffic flows in any time, is not a straightforward task. In this work, we focus on the fairness issue by devising an adaptive, efficient, and fair dynamic bandwidth allocation (DBA) scheme called Insistent FAIr STrategy prOcesS (IFAISTOS). IFAISTOS investigates and maintains user traffic profiles. Overloaded users are carefully treated by gaining greater granting windows than other users; however bandwidth monopolization is prevented. Fairness is ensured for all users in terms of traffic load and average delay. A steering, adaptive mechanism records user traffic profiles by changing and defining bandwidth weights proportional to individual traffic needs. Extensive simulation results reveal the efficacy of the proposed DBA in terms of fairness and average packet delay.

An efficient dynamic bandwidth allocation (DBA) algorithm with global priority is proposed for upstream Ethernet passive optical network (EPON) in this paper. The algorithm is hierarchical and it ensures that the excessive bandwidth is allocated fairly according to the priority. The simulation is done using MATLAB by comparing Efficient DBA with global priority to Efficient DBA with local priority. The results show an improvement as high as 11% in terms of the bandwidth utilization and 46% in terms of the delay.

Advances in high speed network communications have raised the bar of delivering demanding multimedia and data services through Ethernet passive optical networks (EPONs). At their relatively low cost, EPONs have become an attractive solution to providing essential services like voice, video, and data communications reliably, while at the same time providing expected guarantees of the delivery of those services in terms of defined quality of service measures. A continuous theme throughout EPON research has been the study of efficient dynamic bandwidth allocation (DBA) as a key factor in achieving fairness in distributing bandwidth amongst remote network units. In our research, we investigate another factor and its effect of network performance and service delivery: cycle demand proportionality (CDP). By observing the patterns of demand in the network on an individual network unit basis cycle after cycle, we can deduce load characteristics of some units over others. We can then make decisions about subsequent grant allocations based on this factor and aim to achieve better results in the process. We simulate EPONs under varying loads and incorporate the use of CDP in conjunction with currently used DBA schemes. In this paper we present results of achieving improvements in delay performance under light-load circumstances for the cyclic polling DBA scheme

Ethernet passive optical networks (EPONs) have emerged as a promising candidate for next-generation broadband access networks. As this technology evolves, the development of efficient dynamic bandwidth allocation (DBA) algorithms has become a key concern. This paper presents the principle and implementation issues of a new DBA scheme. Through detailed analyses some general investigations on the fairness issue and statistical bandwidth multiplexing (SBM) mechanisms existing in EPON are developed. This proposed scheme consistently maintains a robust fairness mechanism in the DBA operation. With the better maintained fairness mechanism, efficient SBM persists at the global level, whereas multiple network performance matrices are improved. Detailed simulation experiments are presented to study the performance and to validate the effectiveness of the proposed algorithm.

Resource allocation is a fundamental task in any PON and it is necessary to have an efficient scheme that reduces delay, maximizes bandwidth usage, and minimizes the resource wastage. A variety of dynamic bandwidth allocation (DBA) and dynamic wavelength and bandwidth allocation (DWBA) algorithms have been proposed which are based on different PONs (e.g., EPON, GPON, XG-PON, 10G EPON, etc.). But to our knowledge, no DWBA scheme for NG-PON2 system, with diverse customers and prioritized traffic, has been proposed yet. In this work, this problem is addressed and five different dynamic wavelength and bandwidth allocation (DWBA) schemes are proposed. First, mixed integer linear programming (MILP) models are developed to minimize the total delay of the high-priority data. Due to the MILP’s high computational complexity, heuristic algorithms are developed based on the MILP model insights. The five heuristic algorithms are: No Block-Split Heuristic (NBH), Equal Block-Split Heuristic (EBH), Priority-Based No Block-Split Heuristic (P-NBH), Priority-Based Equal Block-Split Heuristic (P-EBH), and Priority-Based Decider Block-Split Heuristic (P-DBH). Six priority classes of requests are introduced with the goal of minimizing the total delay for the high-priority data and to lessen the bandwidth wastage of the system. Finally, experiments for the performance evaluation of the five DWBA schemes are conducted. The results indicate that P-NBH, P-EBH, P-DBH schemes show a 47.63% less delay and 30% of less bandwidth wastage on average for the highest priority data transmission than the schemes without priority support (NBH and EBH). Among these five schemes, NBH method has the highest delay, whereas EBH and P-EBH waste more bandwidth than the other schemes. P-DBH is the most efficient among the five, because this scheme offers the lowest delay for high-priority data and the minimum bandwidth wastage for lower priority ones.

Staged optimization algorithms based MAC dynamic bandwidth allocation for OFDMA-PON

A deep learning based dynamic bandwidth allocation method for XG-PON based mobile fronthaul for CRAN

These days there is a clear trend toward extending the reach of passive optical networks to cover large geographical areas, which enables reduction of the number of central offices and hence has the potential of cost saving in network operation. On the other hand, this reach extension necessitates the design of efficient dynamic bandwidth allocation schemes in order to tackle performance degradation caused by the increased propagation delay in long reach PONs. Among many existing approaches, the multithread-based DBA scheme where several bandwidth allocation processes are performed in parallel is considered one of the most effective options to improve network performance in LRPONs. We have found that without proper intercommunication between the overlapped threads, multi-thread DBA may lose efficiency and even perform worse than the conventional singlethread algorithm. With this in mind, this article reviews different inter-thread scheduling schemes for LR-PONs, and proposes a novel approach of integrating the key ideas of the existing ones. Extensive simulation results confirm that our proposed scheme can significantly improve DBA performance for LR-PONs under a variety of scenarios with consideration of different values of network load and reach.

In this paper, we study the problem of bandwidth allocation for ATM network loaded with real-time VBR compressed video traffic. The compressed video traffic is highly bursty in nature as a result of encoding technique and shows time-variant statistical characteristics due to scene changes. These characteristics make it more difficult to manage network recourses and can cause a significant reduction in network utilization. Our proposed scheme adjusts the allocated bandwidth at regular intervals using a multilayer compressed video in the context of congestion control. The dynamic bandwidth allocation scheme adds and drops layers of the video stream during a renegotiation process to react to congestion on very short timescales. Our simulation results show a significant improvement on the performance of the proposed dynamic bandwidth allocation scheme compared with traditional static bandwidth allocation schemes, and also offers several advantages over static bandwidth allocation schemes including it removes the need of accurate traffic parameters declaration by users at call setup phase, it is valid for a wide variety of traffic sources; and it adapts quickly to the variation of traffic sources with small renegotiation intervals.

Heterogeneous networks (HetNets) composed of macrocells and small cells are expected to improve the transmission performance of users significantly. Designing efficient resource allocation schemes, specifically, bandwidth allocation and power allocation schemes for HetNets is of particular importance for it may affect user quality of service (QoS) and network performance severely. In this paper, we consider the resource allocation problem of a HetNet composed of a macrocell and a number of femtocells and propose a resource characteristic and user QoS oriented bandwidth and power allocation algorithm for the femto base stations (FBSs) which share spectrum with the macro base station. By taking into account the service requirements of the femto user equipments (FUEs) and the bandwidth resource characteristics of the network, various bandwidth resource allocation schemes are proposed. Particularly, in the case of slightly insufficient bandwidth resource, we propose a bankruptcy game based bandwidth resource allocation algorithm for the FBSs, and solve the bandwidth allocation problem by means of Shapley value method. To stress the tradeoff between data rate and power consumption, we examine the energy efficiency of the FBSs and formulate the power allocation problem as a multi-objective optimization problem with the objectives of maximizing the energy efficiency of all the FBSs. The optimal power allocation strategy can be obtained by solving the optimization problem via ideal point method and generic algorithm. Simulation results demonstrate the efficiency of the proposed algorithm.

Large-scale not-for-profit Internet Service Providers (ISPs), such as National Research and Education Networks (NRENs) often have significant amounts of underutilized bandwidth because they provision their network capacity for the rare event that all clients utilize their purchased bandwidth. However, traffic policers are still applied to enforce committed purchase rates and avoid congestion. We present the design and initial evaluation of an SDN/OpenFlow solution that maximizes the network link utilization by user-defined fair allocation of spare bandwidth, while guaranteeing minimum bandwidth for each client.

To date, the mainstream ethernet passive optical network (EPON) bandwidth allocation schemes as well as the new IEEE 802.3ah Ethernet in the first mile Task Force specifications have been centralized, relying on a component in the central office [optical line termination (OLT)] to provision upstream traffic. Hence, the OLT is the only device that can arbitrate time-division access to the shared channel. Since the OLT has global knowledge of the state of the entire network, this is a centralized control plane in which the OLT has centralized intelligence. This paper proposes novel distributed EPON architectures, and in the process proves that these distributed networking architectures and the associated bandwidth allocation algorithms and protocols have characteristics that make them far better suited for provisioning quality of service (QoS) schemes necessary for properly handling data, voice, video, and other real-time streaming advanced multimedia services over a single line. Specifically, this paper proposes a novel ethernet over star coupler-based PON architecture that uses a fully distributed time-division multiple-access (TDMA) arbitration scheme. Supported by the decentralized scheme, this paper proposes several QoS-based dynamic bandwidth allocation (DBA) algorithms in which the OLT is excluded from the implementation of the time slot assignment. In contrast with the mainstream centralized EPON architectures that combine priority queuing [intra-optical network unit (ONU) scheduling] with DBA schemes (inter-ONU scheduling), the proposed distributed EPON architecture supports differentiated services through the integration of both scheduling mechanisms at the ONU (intra-ONU scheduling). The introduction of this integration feature that can only be supported by a decentralized architecture provides better QoS guarantees. Furthermore, in addition to the added flexibility and reliability, the overall performance of the proposed decentralized EPON architecture and the associated bandwidth allocation algorithms are shown to be at least as efficient as their centralized counterparts.

The predictability of network traffic is an important and widely studied topic because it can lead to the solutions to get more efficient dynamic bandwidth allocation, admission control, congestion control and better performance of wireless networks. In this chapter, firstly, the authors briefly describe a number of traffic models that include time series models, artificial neural networks models, wavelet-based models, and support vector machine-based models. Secondly, they give the prediction method and metrics of measuring the accuracy of a prediction. Finally, they examine the feasibility of applying support vector machine into the prediction of actual traffic in WLANs and evaluate the performance of different prediction models such as ARIMA, FARIMA, and artificial neural network, wavelet-based and support vector machine-based models for the prediction of the real WLANs traffic.

This paper presents a new dynamic and adaptive bandwidth allocation scheme to prevent handoff failure due to lack of resources in mobile cellular networks, known as the measurement-based preassignment (MPr) technique. This technique is particularly useful in micro/pico cellular networks which offer quality of service (QoS) guarantees against call dropping. The proposed MPr scheme distinguishes itself from the well-known guarded channel based schemes in that it allows the handoff calls to utilize a pre-reserved channel pool before competing for the shared channels with new call arrivals. The key advantage of the proposed MPr scheme is that it can easily derive the number of channels that needs to be reserved for handoff based on a pre-determined call dropping probability, without the need for solving the often complex Markov chain required in guarded channel schemes, thus making the proposed MPr scheme simple and efficient for implementation. In addition, the MPr scheme is dynamical in that it can adjust the number of reserved channels for the handoff according to the traffic changes in the system.

Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems