Bandwidth Allocation Algorithm Research Articles

Self-Adjusting DBA Algorithm for Next Generation PONs (NG-PONs) to Support 5G Fronthaul and Data Services

In this article, we propose a novel dynamic bandwidth allocation (DBA) algorithm for NG-PON networks to jointly support 5G fronthaul and best-effort data services in the same PON channel. The proposed self-adjusting DBA adjusts dynamically the allocation intervals to the current required fronthaul throughput based on the requests reported from the ONUs. It is suitable for dynamic 5G scenarios where, for energy efficiency reasons, the fronthaul connections are dynamically set up and torn down over time: when a new 5G fronthaul connection is set up, the maximum latency of the current connections is guaranteed while when a current 5G fronthaul connection is torn down, the freed transmission resources become available for data services. The only requirement is that the capacity of the channel in the NG-PON network is enough for the throughput of all 5G fronthaul connections supported by the channel. In this way, the proposed self-adjusting DBA algorithm has the advantage of requiring a much lower management coordination between the 5G infrastructure and the NG-PON infrastructure than the one required when the throughput of the 5G fronthaul connections is supported as a guaranteed service.

Dynamic wavelength and bandwidth allocation for supporting diverse customers and prioritized traffic in NG-PON2 networks

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.

Enhanced Resource Allocation Algorithm for Heterogeneous Wireless Networks

In heterogeneous wireless networks, service providers typically employ multiple radio access technologies to satisfy the requirements of quality of service (QoS) and improve the system performance. However, many challenges remain when using modern cellular mobile communications radio access technologies (e.g., wireless local area network, long-term evolution, and fifth generation), such as inefficient allocation and management of wireless network resources in heterogeneous wireless networks (HWNs). This problem is caused by the sharing of available resources by several users, random distribution of wireless channels, scarcity of wireless spectral resources, and dynamic behavior of generated traffic. Previously, resource allocation schemes have been proposed for HWNs. However, these schemes focus on resource allocation and management, whereas traffic class is not considered. Hence, these existing schemes significantly increase the end-to-end delay and packet loss, resulting in poor user QoS and network throughput in HWNs. Therefore, this study attempts to solve the identified problem by designing an enhanced resource allocation (ERA) algorithm to address the inefficient allocation of available resources vs. QoS challenges. Computer simulation was performed to evaluate the performance of the proposed ERA algorithm by comparing it with a joint power bandwidth allocation algorithm and a dynamic bandwidth allocation algorithm. On average, the proposed ERA algorithm demonstrates a 98.2% bandwidth allocation, 0.75 s end-to-end delay, 1.1% packet loss, and 98.9% improved throughput performance at a time interval of 100 s.

Joint Task Assignment and Spectrum Allocation in Heterogeneous UAV Communication Networks: A Coalition Formation Game-Theoretic Approach

Coalition structure is an efficient networking architecture for task implementation in unmanned aerial vehicle (UAV) networks. However, both the formation of coalition and the spectrum resource for intra-coalition communication affect the reconnaissance performance. In this paper, we investigate a cooperative reconnaissance and spectrum access (CRSA) scheme for task-driven heterogeneous coalition-based UAV networks by jointly optimizing task layer and resource layer. Specifically, coalition formation game (CFG) is formulated to jointly optimize task selection and bandwidth allocation. In addition to the traditional Pareto order and selfish order, coalition expected altruistic order maximizing coalitions' utility is proposed. The CFG under the proposed order is proved to be an exact potential game (EPG). Then the existence of stable coalition partition is guaranteed with the help of Nash equilibrium (NE). We propose a joint bandwidth allocation and coalition formation (JBACF) algorithm to achieve stable coalition partition wherein an efficient gradient projection (GP) based method is applied to solve bandwidth allocation. The effectiveness of the proposed scheme and algorithms are demonstrated through in-depth numerical simulations. The results show that our proposed CRSA scheme is superior to non-joint optimization scheme. Also, the proposed order is superior to traditional Pareto order and selfish order.

Enhanced Dynamic Bandwidth Allocation Algorithm for Intelligent Home Networks

Internet of Things (IoT) has been seen playing a tremendous change in the Information Technology (IT) environments, and thus its importance has also been realized and played a vital role within Intelligent Home Networks (IHNs). This is because IoT establishes a connection between things and the Internet by utilizing different sensing devices to implement the intelligence to deal with the identification and management of the connected things. IHNs use intelligent systems to perform their daily operations. Meanwhile, these networks ensure comfort, safety, healthcare, automation, energy conservation, and remote management to devices and users. Apart from that, these networks provide assistance in self-healing for faults, power outages, reconfigurations, and more. However, we have realized that more and advanced devices and services continue to be introduced and used in these networks. This has led to competitions of the limited available network resources, services, and bandwidth. In this paper, therefore, we present the design and implementation of a Novel Dynamic Bandwidth Allocation (NoDBA) algorithm to solve the performance bottleneck incurred with IHNs. The proposed algorithm deals with the management of bandwidth and its allocation. In the proposed algorithm, this study integrates two algorithms, namely; Offline Cooperative Algorithm (OCA) and Particle Swarm Optimization (PSO) to improve Quality of Service (QoS). PSO defines the priority limits for subnets and nodes in the network. Meanwhile, OCA facilitates dynamic bandwidth allocation in the network. The Network Simulator-2 (NS-2) was used to simulate and evaluate the NoDBA and it showed improved results compared to the traditional bandwidth allocation algorithms. The obtained results show an average throughput of 92%, average delay of 0.8 seconds, and saves energy consumption of 95% compared to Dynamic QoS-aware Bandwidth Allocation (DQBA) and Data-Driven Allocation (DDA). Keywords: IHNs, Dynamic Bandwidth Allocation, PSO, OCA, QoS

Bandwidth Utilization and Management Algorithms (BUMAs) for NG-EPON

An upcoming capable technology named as Next generation Ethernet passive optical network (NG-EPON); to handle enormous bandwidth and effective distribution requirements for prospective Internet based services. Standardization procedures for NG-EPON are in progress. Transmission of data traffic from Optical Network Units (ONUs) towards Optical Line Terminal (OLT) in NG-EPON is carried out through four wavelengths each operating at a data rate of 25Gbps. Dynamic wavelength and bandwidth allocation (DWBA) algorithms are needed for the efficient arbitration of the bandwidth resources between the subscribers. In this paper, we have proposed two different DWBA algorithms for NG-EPON; DWBA-I and DWBA-II. DWBA-I is a Quality-of-Service based algorithm that has been designed to manage the different types of data traffic in NG-EPON. DWBA-I performs better than the different existing DBA algorithms in terms of packet delay, completion time and packet drop ratio. DWBA-II is an algorithm designed to meet the system requirement specifications of NG-EPON and handle traffic requirements of subscribers in a cost effective manner. DWBA-II algorithm is comparatively analyzed and evaluated with First-Fit-DWBA and Modified-IPACT algorithms. Performance of DWBA-II is better on the basis of average delay, grant utilization, completion time and packets drop ratio. Performance of DWBA-I and DWBA-II has been evaluated through simulation results.

Local voting: A new distributed bandwidth reservation algorithm for 6TiSCH networks

The IETF 6TiSCH working group fosters the adaptation of IPv6-based protocols into Internet of Things by introducing the 6TiSCH Operation Sublayer (6top). The 6TiSCH architecture integrates the high reliability and low-energy consumption of IEEE 802.15.4e Time Slotted Channel Hopping (TSCH) with IPv6. IEEE 802.15.4e TSCH defines only the communication between nodes through a schedule but it does not specify how the resources are allocated for communication between the nodes in 6TiSCH networks. We propose a distributed algorithm for bandwidth allocation, called Local Voting, that adapts the schedule to the network conditions. The algorithm tries to equalize the link load (defined as the ratio of the queue length plus the new packet arrivals, over the number of allocated cells) through cell reallocation by calculating the number of cells to be added or released by 6top. Simulation results show that equalizing the load throughout 6TiSCH network provides better fairness in terms of load, reduces the queue sizes and packets reach the root faster compared to representative algorithms from the literature. Local Voting combines good delay performance and energy efficiency that are crucial features for Industrial Internet-of-Things applications.

FlowTrace: Maximizing the Service Payoff of Heterogeneous Communications Networks

Massive Internet of Things devices with rapidly growing traffic make heterogeneous communications network a commercial infrastructure. As a critical network metric that represents the value created by the network, the service payoff of the network is positively correlated with the network throughput only when the quality of service (QoS) delivered to data-flows is guaranteed. To maximize the service payoff of the network, we propose a so-called FlowTrace as an QoS guarantee scheme. We first model the upper bound of the service payoff in a network as the maximum posterior service payoff (MPSP). To facilitate online bandwidth allocation and approximate the upper bound of the service payoff, we formulate a dynamic weight-based online bandwidth allocation (DWOBA) problem by designing dynamic weight as the flow metric. To relieve the computational pressure in the centralized network controller and the following bottleneck effect, we then decompose the DWOBA problem to a two-step DWOBA problem. Moreover, we propose a semi-centralized bandwidth allocation algorithm based on parallel edge computing for the two-step DWOBA problem. Simulation results demonstrate that the proposed FlowTrace outperforms prevalent online methods with a 3 $\sim$ 10x service payoff improvement under heavy traffic load and the optimization result reaches 70 $\%$ of the MPSP.

Bandwidth allocation algorithm based on differential BRP models in ethernet PON

With the emergence of new services such as high-definition video, cloud computing and virtual reality, the load's bandwidth prediction ability is necessary to support soaring services request bandwidth with diversified characteristics and requirements. In this paper, a novel bandwidth allocation algorithm based on differential bandwidth request prediction (BRP) models is proposed. This algorithm firstly combines linear prediction and nonlinear prediction. According to different characteristics of services, the linear prediction model and the Kalman-filter prediction model are used to predict request bandwidths of corresponding services. By the differential BRP models, the proposed algorithm can greatly better the accuracy of service's request bandwidth prediction and the efficiency of allocating bandwidth. The simulation results demonstrate that the proposed models and algorithm can reduce network's average delay, increase throughput and bandwidth utilization.

An Energy-Efficient Distributed Dynamic Bandwidth Allocation Algorithm for Passive Optical Access Networks

The rapid deployment of passive optical access networks (PONs) increases the global energy consumption of networking infrastructure. This paper focuses on the minimization of energy consumption in Ethernet PONs (EPONs). We present an energy-efficient, distributed dynamic bandwidth allocation (DBA) algorithm able to power off the transmitter and receiver of an optical network unit (ONU) when there is no upstream or downstream traffic. Our main contribution is combining the advantages of a distributed DBA (namely, a smaller packet delay compared to centralized DBAs, due to less time being needed to allocate the transmission slot) with energy saving features (that come at a price of longer delays due to the longer queue waiting times when transmitters are switched off). The proposed algorithm analyzes the queue size of the ONUs in order to switch them to doze/sleep mode when there is no upstream/downstream traffic in the network, respectively. Our results show that we minimized the ONU energy consumption across a wide range of network loads while keeping delay bounded.

Optimal resource allocation in networked control systems

This study proposes an optimal bandwidth allocation algorithm for a Networked Control System (NCS) that includes a time-driven sensor, event-driven controller and random channels. The authors predict resource demands at the next time step for the random channels, then calculate the resource demands from the event-driven and the time-driven channels. They allocate bandwidths for each channel by solving a convex optimisation problem based on the resource demands. When the total traffic exceeds the total capacity of the network, only the random and event-driven network bandwidths are allocated optimally. For time-driven channels, they increase the sampling period to reduce traffic volume and satisfy the total capacity constraint. This maintains sufficiently slow sampling to improve the quality of service in NCS. An upper bound on the sampling period is set to guarantee sufficiently fast sampling for control dynamics. Simulation results show that the proposed approach minimises network congestion.

Delay and energy efficient dynamic bandwidth allocation algorithm for hybrid optical and wireless sensor networks

Abstract Wireless sensor network (WSN) in the hybrid optical and WSN (HOWSN) utilizes full advantages of broadband access facility. Passive optical network (PON) as the backbone of HOWSN ensures energy efficiency and meets the higher bandwidth demands. However, in the conventional HOWSNs, the sensor nodes of WSN stay in active state for 100% time, i.e., 100% duty cycle, with the optical access networks cause huge amount of energy wastage. This paper presents a new delay and energy efficient (DEE) dynamic bandwidth allocation (DBA) algorithm with multi-threaded polling approach for the optical network units of the HOWSNs. In the proposed scheme, to conserve the energy consumption of HOWSNs, the optical network units (ONUs) connected to the gateway nodes of WSN use 10% duty cycle, whereas the ONUs connected to the data network use 100% duty cycle. The performance of the proposed DEE scheme is evaluated by numerical simulations and compared those to the existing adaptive limited DBA (ALDBA) schemes, i.e., ALDBA1, ALDBA2 and ALDBAM, of HOWSNs. The simulation results prove that the proposed DEE scheme provides up to 32% and 38% more energy savings with lower end-to-end packet delay compared to the existing ALDBA1, ALDBA2 and ALDBAM schemes of HOWSNs, respectively.

ITU TWDM-PON module for ns-3

Optical fiber access systems are one of the driving forces behind the success of the Internet. Time- and wavelength-division multiplexing passive optical network (TWDM-PON) is regarded as the key technology for future Internet access networks. In this paper, we propose an ITU TWDM-PON module for the ns-3 network simulator and describe its concept and design specifications. The proposed module is developed based on the XG-PON module for ns-3. It can simulate G.989 standard-compliant data packet transmission in the upstream and downstream directions using multiple wavelength channels. It enables us to evaluate the performance issues that arise with the TWDM-PON development, including various dynamic bandwidth allocation and dynamic wavelength allocation algorithms. The proposed module is expected to become a good platform for studying future access networks composed of TWDM-PON and mobile networks by enabling us to simulate dynamic wavelength and bandwidth allocation.

Optimized Dynamic Bandwidth Allocation Algorithm for Optical Access Networks

Abstract Bandwidth assignment is a key issue in optical access networks, so an efficient mechanism is required for dynamic distribution of limited resources in the uplink channel among competing subscriber optical network units (ONUs). This paper presents a novel optimized dynamic bandwidth allocation (ODBA) algorithm for hybrid WDM/TDM passive optical networks. ODBA algorithm operates using information frame length of the subscriber’s ONUs and their information arrival rate; both of these factors finalize the assigned transmission capacity to the users. The system performance under differing offered traffic loads is evaluated in terms of network throughput, average delay and channel utilization. Further, the proposed ODBA scheme is validated by performing a comparative analysis with well-known algorithms.

Efficient Resource Allocation in Tactile-Capable Ethernet Passive Optical Healthcare LANs

Communication networks for healthcare environments support various application types and should be capable of providing them with the required Quality of Service (QoS) in terms of reliable data delivery, considerable data rate and low latency. The introduction of Tactile Internet (TI) healthcare applications is expected to upgrade the level of provided services to patients. The requirements of these applications are very stringent and a major requirement is that the existing network infrastructure must support them. Passive Optical Networks (PONs) have been proposed as an ideal candidate to support such demanding environments. One of the major challenges of such networks, which significantly affects the provided QoS, is the effective resource allocation in both the time and the wavelength domains. The existing resource allocation algorithms for PONs were designed without considering the stringent requirements of TI applications thus making PON support for TI inefficient. In this paper, a new double per priority queue dynamic wavelength and bandwidth allocation algorithm is presented. This algorithm allocates the network resources efficiently and fairly using several techniques, in order to meet the QoS demands of Tactile and other types of healthcare applications. Extensive simulation results indicate the effectiveness of the proposed algorithm to provide the required QoS for medical applications under various simulation scenarios whereas other well-known schemes are shown to lack such support.

Flexible Multi-Thread Dynamic Bandwidth Allocation Algorithm in VPONs Based on LR WDM/TDM PON

With the smooth upgrade of the access network, multiple tuning-time devices will coexist in the long-reach access network, and the subsequent problems of high round-trip time (RTT) and optical network unit (ONU) tuning delay need to be solved urgently. In this paper, a multi-thread multiple tuning-time devices coexistence (MT-MTDC) bandwidth allocation algorithm is proposed. This algorithm can solve the problems of high RTT and ONU tuning delay in virtual passive optical network (VPON) based on long-reach wavelength division multiplexing/time division multiplexing passive optical network (LR WDM/TDM PON). Firstly, Multi-threaded polling mechanism is introduced into multi-mode coexistence VPON. Next, the number of wavelengths and threads is selected adaptively to ensure high bandwidth utilization. Then, the mechanism of dynamically adjusting the thread window is proposed. The mechanism strengthens the collaboration ability between threads and solves the degradation problem of the multi-thread algorithm. Furthermore, the construction of tuning buffer and the setting of time flag effectively solve the problem of more frequent ONU tuning pressure and ONU transmission conflict caused by multi-threaded polling algorithm. Finally, by comparing with the multi-thread longest-first first-available (MT-LFFA) algorithm and the multi-tuning-time ONU scheduling (MOS) algorithm, the proposed algorithm demonstrates its effectiveness in terms of polling cycle time, average tuning delay, bandwidth utilization and average packet delay.

QoS-Aware Bandwidth Allocation and Concurrent Scheduling for Terahertz Wireless Backhaul Networks

In recent years, with the spectrum resources in low frequency bands becoming increasingly insufficient, the carrier frequency of wireless communication has started its evolution to the Terahertz (THz) frequency band, and meanwhile the THz communication system has become one of the research hot spots. In this paper, we investigate the problem of concurrent transmission scheduling for THz wireless backhaul network. To increase the weighted sum of completed flows with their quality of service (QoS) requirements satisfied in THz wireless backhaul network, we propose an algorithm of QoS-aware bandwidth allocation and concurrent scheduling (IHQB). Considering the priority of the flow, the reciprocal of the priority is taken as the weight of the flow. In this algorithm, QoS awareness and bandwidth allocation are exploited to achieve more successfully scheduled flows and higher network throughput. The concurrent scheduling with the maximum independent set (MIS) is allocated to different frequency bands. And the mentioned MIS is obtained from the conflict graph which has been established under the conditions of half-duplex and interference threshold. Simulation results show that IHQB performs better than other algorithms in terms of the weighted sum of completed flows and system throughput, especially compared with STDMA.

Data Distribution Optimization Strategy in Wireless Sensor Networks With Edge Computing

Resource-constrained wireless sensor networks (WSNs) impose a substantial challenge to the transmission and processing of non-redundant perceptual data. Moreover, breakthroughs in this area have opened up a new dimension that integrates edge computing technology in wireless sensor networks. However, achieving reliable data distribution in wireless sensor networks with edge computing (EWSN) and balancing the link bandwidth and node energy resources have become challenging problems. In this article, we propose a joint bandwidth allocation and energy consumption (JBAEC) algorithm for distributing different perceptual data to different sensor nodes of the EWSN by considering the available transmission links between the source sensor and destination nodes under the condition of early perceived energy. Therefore, we first establish the model of different data packet types and energy detection costs. Second, we describe the problem of effective bandwidth allocation and prove its NP-hard feature. In addition, we formulate the bandwidth allocation problem as an optimization problem that is divided into the two states of sufficient energy and lack of energy. Afterwards, we present an available node selection (ANS) algorithm for sorting the available relay nodes under the condition of different energy-sufficient nodes. The effective transmission network construction (ETNC) algorithm selects the available transmission links based on the set of available nodes. Finally, we implement the JBAEC algorithm by using the NS-2 simulator and present extensive simulation results to verify the data distribution efficiency of the JBAEC algorithm in the EWSN.

A learning algorithm for TWDM-PON’ DWBA with 5G fronthaul networks

Abstract Time and wavelength-division multiplexed passive optical network (TWDM-PON) is expected to be the fronthaul networks of 5G, which requires low latency and large bandwidth. In this paper, we propose a Q-learning based dynamic wavelength and bandwidth allocation (DWBA) algorithm for TWDM-PON. Simulation results show that the proposed DWBA algorithm can reduce the number of active channels by 40% and provide larger bandwidth with same wavelength number in comparation with the existing algorithms while satisfying the latency requirement of 5G fronthaul networks.

Wavelength and Bandwidth Allocation for Mobile Fronthaul in TWDM-PON

Time- and wavelength- division multiplexed passive optical network (TWDM-PON) has attracted considerable attention for the next generation optical access systems. Among potential applications of TWDM-PON, a major application is the support of mobile fronthaul streams between radio units (RUs) and distributed units (DUs) in the centralized radio access network (C-RAN) architecture, which consists of central units (CUs), DUs, and RUs. The upstream fronthaul traffic that an optical line terminal (OLT) receives is expected to become highly bursty due to the variable data rate generated by employing new functional split options and the synchronization of data transmission between neighboring RUs caused by time-division duplex (TDD). However, there has been no wavelength and bandwidth allocation scheme for TWDM-PON that is designed to efficiently accommodate fronthaul streams satisfying the strict delay requirement. Therefore, in this paper we propose a novel wavelength and bandwidth allocation algorithm that can minimize the number of active wavelength channels considering the high burstiness and delay requirement of fronthaul data transmission. Through computer simulations it was confirmed that the number of active wavelength channels can be reduced by 50% with the proposed algorithm, and thus more RUs can be efficiently accommodated using TWDM-PON.