Minimizing Age of Information in the Uplink Multi-User Networks via Dynamic Bandwidth Allocation

Improving the information freshness is critical for the monitoring and controlling applications in the cellular Internet of Things(IoT).In this paper,we are interested in optimizing the bandwidth allocation dynamically to improve the information freshness of the short packet based uplink status updates,which is characterized by a recently proposed metric,age of information(Ao I).We first design a status update scheme with channel distribution information(CDI).By relaxing the hard bandwidth constraint and introducing a Lagrangian multiplier,we first decouple the multi-MTCD bandwidth allocation problem into a single MTCD Markov decision process(MDP).Under the MDP framework,after variable substitution,we obtain the single-MTCD status update scheme by solving a linear programming problem.Then,we adjust the Lagrangian multiplier to make the obtained scheme satisfy the relaxed bandwidth constraint.Finally,a greedy policy is built on the proposed scheme to adjust the bandwidth allocation in each slot to satisfy the hard bandwidth constraint.In the unknown environment without CDI,we further design a bandwidth allocation scheme which only maximizes the expected sum Ao I drop within each time slot.Simulation results show that in terms of AoI,the proposed schemes outperform the benchmark schemes.

Efficient Bandwidth Allocation and Computation Configuration in Industrial IoT

With the advancement of the Industrial Internet of Things(IoT),the rapidly growing demand for data collection and processing poses a huge challenge to the design of data transmission and computation resources in the industrial scenario.Taking advantage of improved model accuracy by machine learning algorithms,we investigate the inner relationship of system performance and data transmission and computation resources,and then analyze the impacts of bandwidth allocation and computation resources on the accuracy of the system model in this paper.A joint bandwidth allocation and computation resource configuration scheme is proposed and the Karush-Kuhn-Tucker(KKT)conditions are used to get an optimal bandwidth allocation and computation configuration decision,which can minimize the total computation resource requirement and ensure the system accuracy meets the industrial requirements.Simulation results show that the proposed bandwidth allocation and computation resource configuration scheme can reduce the computing resource usage by 10%when compared to the average allocation strategy.

PREDICTION-BASED BANDWIDTH ALLOCATION FOR VBR TRAFFIC

A prediction based bandwidth allocation scheme for transporting MPEG VBR traffic is proposed by using the FARIMA (p,d,q) (fractional autoregressive integrated moving average) model.FARIMA (p,d,q) model is capable of capturing both the long range and short range dependence in the video traffic.A method is suggested to simplify the FARIMA model fitting procedure and hence to reduce the time of traffic modeling and prediction.The simulation experiments show that this scheme can significantly reduce the requirement of buffer size and the frame loss rate.

A Stackelberg Differential Game Based Bandwidth Allocation in Satellite Communication Network

In this paper, a Stackelberg differential game based approach is proposed to solve the bandwidth allocation problems in satellite communication network. All the satellites are divided into two groups, one has high download requirements, and the other one has low download requirements. Each satellites group has its own controller for bandwidth allocation, and can get payments from the satellites for the allocated resources. The relationships between the controllers and satellites are formed as a Stackelberg game. In our model, differential equation is introduced to describe the bandwidth dynamics for the whole satellite communication network. Combine the differential equation and Stackelberg game together, we can formulate the bandwidth allocation problems in satellite communication network as a Stackelber differential game. The solutions to the proposed game is solved based the Bellman dynamic equations. Numerical simulations are given to prove the effeteness and correctness of the proposed approach.

User Association and Wireless Backhaul Bandwidth Allocation for 5G Heterogeneous Networks in the Millimeter-Wave Band

The user association and wireless backhaul bandwidth allocation for a two-tier heterogeneous network （HetNet） in the mil- limeter wave （mmWave） band is proposed in this article. The two-tier HetNet is built up with a macro base station （MBS） and several small cell SBSs, where the MBS is assumed to be equipped with large-scale antenna arrays but the SBSs only have single-antenna capa- bility and they rely on the wireless link to the MBS for backhaul. The sum of logarithmic user rate, which is established according to the result of multi-user Multiple Input Mul- tiple Output （MIMO） downlink employing Zero-Force Beamforming （ZFBF）, is chosen as the network utility for the objective func- tion. And a distributed optimization algorithm based on primal and dual decomposition is used to jointly optimize the user association variable xj,z and the wireless backhaul band- width factor α. Simulation results reveal that the distributed optimization algorithm jointly optimizing two variables outperforms the con- ventional SINR-based user association strate- gies.

Dynamic Bandwidth Allocation and Rate Coordination for DiffServ Environment

This paper presents a novel model for dynamic bandwidth allocation and rate coordination based on DiffServ and a bandwidth broker（BB）. In this model, assignment of bandwidth was made according to a periodic trace of network characteristics per application. And adjustment of transfer rate was accomplished through negotiation with applications by a bandwidth agent. This model was evaluated using network simulator 2 （NS-2）, and distinct improvements were found in respects of delay and packet loss of overall network and single flow. Finally, the model was suggested to be leveraged to multimedia applications with properties of lower delay and lower packet loss.

Review on Dynamic Bandwidth Allocation of GPON and EPON

The passive optical network(PON)technology has been drastically improved in recent years.In spite of using the optical technology,the utilization of the entire bandwidth is a very challenging task.The main categories of PON are the Ethernet passive optical network(EPON)and gigabit passive optical network(GPON).These two networks use the dynamic bandwidth allocation(DBA)algorithm to attain the maximum usage of bandwidth,which is provided in the network dynamically according to the need of the customers with the support of the service level agreement(SLA).This paper will provide a clear review about the DBA algorithm of both technologies as well as the comparison。

A Joint Power and Bandwidth Allocation Method Based on Deep Reinforcement Learning for V2V Communications in 5G

Vehicular communications have recently attracted great interest due to their potential to improve the intelligence of the transportation system.When maintaining the high reliability and low latency in the vehicle-to-vehicle(V2V)links as well as large capacity in the vehicle-to-infrastructure(V2I)links,it is essential to flexibility allocate the radio resource to satisfy the different requirements in the V2V communication.This paper proposes a new radio resources allocation system for V2V communications based on the proximal strategy optimization method.In this radio resources allocation framework,a vehicle or V2V link that is designed as an agent.And through interacting with the environment,it can learn the optimal policy based on the strategy gradient and make the decision to select the optimal sub-band and the transmitted power level.Because the proposed method can output continuous actions and multi-dimensional actions,it greatly reduces the implementation complexity of large-scale communication scenarios.The simulation results indicate that the allocation method proposed in this paper can meet the latency constraints and the requested capacity of V2V links under the premise of minimizing the interference to vehicle-to-infrastructure communications.

Bandwidth allocation algorithm for aggregated tree in optical networks

Wavelength and bandwidth allocation is important for multicast communication in optical networks. In this paper,a new method based on scheduling theory is proposed. The proposed method formulates wavelength bandwidth capacity as a large rectangle and these multicast stream bandwidth requirements as small rectangles. It treats the wavelength and bandwidth allocation question as a rectangle packing problem. The proposed algorithm solves the problem by taking quasi-human strategy with Euclidian distance. It is an effective heuristic algorithm to quickly solve multicast stream bandwidth allocation problem in optical networks by theoretic analysis. Further simulation experiments show the bandwidth allocation algorithm can increase network utilization and have a good fairness performance for unicast stream and multicast stream in optical networks. The results indicate the effectiveness of the algorithm.

Transient Analysis of Bandwidth Allocation Strategies in Broadband ISDN

We study the transient behavior of B-ISDN bandwidth allocation strategies in tills paper. First, we present the united state transition equations and obtain the steady-state probability distribution vector by the matrixgeometric solution method. Second, we treat the problem in a uniform way that establishing the coupled differential equations describing the dynamic flow process of B-ISDN channel with the steady state probability as its initial condition and solve it numerically based on the fourth-order Runge-kutta procedure which allows a good balance between computing time and accuracy. Finally, experiment results and discussion are given to illustrate the effectes of the method presented in this paper and show that the idea and analysis way can be extended to all dynamic traffic controlling and management in B-ISDN systems.

A novel algorithm for Ethernet-passive-optical-network dynamic bandwidth allocation based on threshold

The Ethemet passive optical network （EPON） is the next generation of broad-band network technique. A crucial issue in EPONs is the sharing of uplink bandwidth among optical network units （ONUs）. This article provides a novel dynamic bandwidth allocation algorithm, i.e. threshold dynamic bandwidth allocation （TDBA）, which is based on adaptive threshold, to increase resource utilization. The algorithm uses ONU data-transmitting rate to adjust optical line terminal （OLT） receiving data threshold from an ONU. Simulation results show that this algorithm can decrease average packet delay and increase network throughput in a l 0G EPON system.

An Adaptive Bandwidth Allocation for Energy Efficient Wireless Communication Systems

In this paper, an energy efficient bandwidth allocation scheme is proposed for wireless communication systems. An optimal bandwidth expansion（OBE） scheme is proposed to assign the available system bandwidth for users. When the system bandwidth does not reach the full load, the remaining bandwidth can be energy-efficiently assigned to the other users. Simulation results show that the energy efficiency of the proposed OBE scheme outperforms the traditional same bandwidth expansion（SBE） scheme. Thus, the proposed OBE can effectively assign the system bandwidth and improve energy efficiency.

HSDBA: a hierarchical and scalable dynamic bandwidth allocation for programmable data planes

Dynamic bandwidth allocation(DBA)is a fundamental challenge in the realm of networking.The rapid,accurate,and fair allocation of bandwidth is crucial for network service providers to fulfill service-level agreements,alleviate link congestion,and devise strategies to counter network attacks.However,existing bandwidth allocation algorithms operate mainly on the control plane of the software-defined networking paradigm,which can lead to considerable probing overhead and convergence latency.Moreover,contemporary network architectures necessitate a hierarchical bandwidth allocation system that addresses latency requirements.We introduce a finegrained,hierarchical,and scalable DBA algorithm,i.e.,the HSDBA algorithm,implemented on the programmable data plane.This algorithm reduces network overhead and latency between the data plane and the controller,and it is proficient in dynamically adding and removing network configurations.We investigate the practicality of HSDBA using protocol-oblivious forwarding switches.Experimental results show that HSDBA achieves fair bandwidth allocation and isolation guarantee within approximately 25 packets.It boasts a convergence speed 0.5times higher than that of the most recent algorithm,namely,approximate hierarchical allocation of bandwidth(AHAB);meanwhile,it maintains a bandwidth enforcement accuracy of 98.1%.

Dynamic Wavelength and Bandwidth Allocation Using Adaptive Linear Prediction in WDM/TDM Ethernet Passive Optical Networks

Hybrid wavelength-division-multiplexing(WDM)/time-division-multiplexing(TDM) ethernet passive optical networks(EPONs) can achieve low per-subscriber cost and scalability to increase the number of subscribers. This paper discusses dynamic wavelength and bandwidth allocation(DWBA) algorithm in hybrid WDM/TDM EPONs.Based on the correlation structure of the variable bit rate(VBR) video traffic,we propose a quality-ofservice (QoS) supported DWBA using adaptive linear traffic prediction.Wavelength and timeslot are allocated dynamically by optical line terminal(OLT) to all optical network units(ONUs) based on the bandwidth requests and the guaranteed service level agreements(SLA) of all ONUs.Mean square error of the predicted average arriving rate of compound video traffic during waiting period is minimized through Wiener-Hopf equation.Simulation results show that the DWBA-adaptive-linear-prediction(DWBA-ALP) algorithm can significantly improve the QoS performances in terms of low delay and high bandwidth utilization.

Bandwidth Allocation Method by Service for WDM EPON

A WDM(Wavelength Division Multiplexing) EPON(Ethernet Passive Optical Network) is an economical and efficient access network that has attracted significant research attention in recent years. A MAC(Media Access Control) Protocol of PON is based on TDMA(Time Division Multiple Access) basically, we can classify this protocol into a fixed length slot assignment method suitable for leased line supporting Qos(Quality of Service) and a variable length slot assignment method suitable for LAN/MAN with the best ...

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

Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access （TDMA） mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution （NBS） derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.

Stackelberg game theoretic pricing algorithm for bandwidth allocation in cooperative access

Cooperative access among user devices by sharing wireless access bandwidth opens a new paradigm in heterogeneous networks. However, how to stimulate cooperative relay nodes forwarding service data for others and allocating corresponding bandwidth to support it are two key issues in the cooperative access. This paper proposes a Stackelberg game based framework which is benefit participants including relay nodes and client nodes. This framework generalizes the pricing based bandwidth allocation algorithm by the Stackelberg game model, which optimizes the profit of the cooperative relay nodes while guaranteeing the bandwidth requirements of client nodes, We transform the profit maximization problem into a convex problem and solve it using the convex optimization method. The simulation results demonstrate that the proposed framework and corresponding algorithms outperform the bidding weight proportional fairness and fixed value bandwidth allocation ones significantly.

Optimized bandwidth allocation for maximizing user's QoE in hybrid cloud P2P content distribution

Hybrid cloud peer to peer （P2P） system is widely used for content distribution by utilizing user＇s capabilities to relieve the cloud bandwidth pressure. However, as demands for large-size files grow rapidly, it is a challenge to support high speed downloading experience simultaneously in different swarms with limited cloud bandwidth resource in such system. Therefore, it requires an optimized cloud bandwidth allocation to improve overall downloading experience of users. In this paper, we propose a system performance model which characterizes the relationship between cloud uploading bandwidth and user download speed. Based on the model, we study the cloud uploading bandwidth allocation, with the goal of optimizing user＇s quality of experience （QoE） that mainly depends on downloading rate of desired contents. Furthermore, to decrease the computation complexity, we put forward a heuristic algorithm to approximate the optimized solution. Simulation results show that our heuristic algorithm can obtain higher user＇s QoE as compared with two typical bandwidth allocation algorithms.

Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints

In this paper,we study the joint bandwidth allocation and path selection problem,which is an extension of the well-known network utility maximization(NUM)problem,via solving a multi-objective minimization problem under path cardinality constraints.Specifically,such a problem formulation captures various types of objectives including proportional fairness,average delay,as well as load balancing.In addition,in order to handle the"unsplittable flows",path cardinality constraints are added,making the resulting optimization problem quite challenging to solve due to intrinsic nonsmoothness and nonconvexity.Almost all existing works deal with such a problem using relaxation techniques to transform it into a convex optimization problem.However,we provide a novel solution framework based on the linearized alternating direction method of multipliers(LADMM)to split the original problem with coupling terms into several subproblems.We then derive that these subproblems,albeit nonconvex nonsmooth,are actually simple to solve and easy to implement,which can be of independent interest.Under some mild assumptions,we prove that any limiting point of the generated sequence of the proposed algorithm is a stationary point.Numerical simulations are performed to demonstrate the advantages of our proposed algorithm compared with various baselines.

An Improved Dynamic Bandwidth Allocation Algorithm for Ethernet PON

This paper proposes an improved Dynamic Bandwidth Allocation (DBA) algorithm for EPON, which combines static and traditional dynamic allocation schemes. Simulation result shows that the proposed algorithm may effectively improve the performance of packet delay.