Bandwidth Allocation In Networks Research Articles

Exploiting Video Quality Information With Lightweight Network Coordination for HTTP-Based Adaptive Video Streaming

This paper investigates how video-quality information can be exploited by HTTP-based adaptive streaming clients in their rate adaptation schemes. We also seek to answer the question: How much network coordination is required to achieve quality fairness across multiple competing clients? To that end, we envision a loosely coupled architecture where a lightweight centralized coordinator complements multiple federated quality-aware clients. Instead of actively programming network bandwidth allocation to each client, in our proposed architecture, the central coordinator simply collects quality and buffer level information from individual clients and publishes the aggregate quality statistics as reference. Such global reference statistics help to guide each federated client to self-tune its aggressiveness in its quality-aware adaptation scheme. Testbed-based evaluations show that such a lightweight approach is effective in reaping most of the performance gains previously achieved by a centralized joint optimization scheme. Compared to both state-of-the-art rate-based clients and independent quality-aware clients, our proposed federated quality-aware scheme can save up to 50% of total bandwidth while maintaining comparable aggregate video quality across all clients.

Optimum bandwidth allocation in wireless networks using differential evolution

Wireless networking is experiencing a tremendous growth in new standards of communication and computer applications. Currently, wireless networks exist in various forms, providing different facilities. However, due to some limitations as compared with wired counterparts, wireless networks face several major challenges and one of them is optimum bandwidth allocation. The focus of optimum bandwidth allocation is to reduce the losses and satisfying quality of service (QoS) requirements. In wireless networks, the term bandwidth allocation is attributed as the distribution of bandwidth resources among different users, which affects the serviceability of the entire system. Though many studies related to bandwidth allocation have been reported already, however, only sub-optimal solutions have been provided so far. In this research, we proposed to use the differential evolution (DE) algorithm to allocate bandwidth through a bandwidth reservation scheme in the Cellular IP network, in order to improve the QoS at an acceptable level. DE belongs to a class of evolutionary algorithms (EA), like particle swarm optimization and genetic algorithm. A DE-based method is used which looks for any free bandwidth in the cell or in adjacent cells and provides it to the cell where required. In case, it fails to find the free available bandwidth then it will search the bandwidth which is standby for non real-time users and allocates it to the real-time users that will help in improving the QoS in terms of connection/call dropping probability for real-time users. Simulation results show that the proposed method performs better as compared to previously used EA models for bandwidth allocation.

Downlink Energy Efficiency of Power Allocation and Wireless Backhaul Bandwidth Allocation in Heterogeneous Small Cell Networks

The widespread application of wireless services and dense devices access have triggered huge energy consumption. Because of the environmental and financial considerations, energy-efficient design in wireless networks becomes an inevitable trend. To the best of the authors' knowledge, energy-efficient orthogonal frequency division multiple access heterogeneous small cell optimization comprehensively considering energy efficiency maximization, power allocation, wireless backhaul bandwidth allocation, and user Quality of Service is a novel approach and research direction, and it has not been investigated. In this paper, we study the energy-efficient power allocation and wireless backhaul bandwidth allocation in orthogonal frequency division multiple access heterogeneous small cell networks. Different from the existing resource allocation schemes that maximize the throughput, the studied scheme maximizes energy efficiency by allocating both transmit power of each small cell base station to users and bandwidth for backhauling, according to the channel state information and the circuit power consumption. The problem is first formulated as a non-convex nonlinear programming problem and then it is decomposed into two convex subproblems. A near optimal iterative resource allocation algorithm is designed to solve the resource allocation problem. A suboptimal low-complexity approach is also developed by exploring the inherent structure and property of the energy-efficient design. Simulation results demonstrate the effectiveness of the proposed algorithms by comparing with the existing schemes.

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 millimeter 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 capability 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 Multiple Output (MIMO) downlink employing Zero-Force Beamforming (ZFBF), is chosen as the network utility for the objective function. And a distributed optimization algorithm based on primal and dual decomposition is used to jointly optimize the user association variable xj,i and the wireless backhaul bandwidth factor β. Simulation results reveal that the distributed optimization algorithm jointly optimizing two variables outperforms the conventional SINR-based user association strategies.

Power and Bandwidth Allocation for Cognitive Heterogeneous Multi-Homing Networks

In this paper, an uplink power and bandwidth allocation problem for multiple services with multi-homing technology is formulated for cognitive heterogeneous networks. The joint power and bandwidth allocation with multiple services is subject to constraints in system available bandwidth, proportional fairness transmission rate for non-real-time secondary mobile terminals (MTs), minimum required transmission rate for real-time secondary MTs, interference power for primary base station, and total power consumption for each secondary MT. The joint power and bandwidth allocation problem with multiple services based on risk-return model is formulated as a bargaining game framework, first. Then, an optimal power and bandwidth allocation algorithm utilizing a dual decomposition method is proposed to obtain Nash bargaining solution. Finally, a heuristic algorithm is proposed to reduce computational complexity. Simulation results demonstrate the optimal and heuristic algorithms not only improve the spectrum efficiency, but also guarantee the fairness for secondary MTs with non-real-time service.

Joint Optimization of Cache Placement and Bandwidth Allocation in Heterogeneous Networks

Content caching at edge of the network has been considered as an effective way to reduce latency and alleviate burden on backhaul. In this paper, cache placement and bandwidth allocation strategies are jointly investigated in a multi-user system of a heterogenous network consisting of one macro base station and multiple small base stations. With the goal of minimizing outage probability, a simulated annealing algorithm-aided cache placement scheme along with an optimized bandwidth allocation via a dual decomposition method is proposed while taking into account the constraints of total available bandwidth, storage capacity of caching nodes, and fairness among users. Unlike previous works, the optimizations of the cache placement and bandwidth allocation are jointly considered in this paper. Meanwhile, in order to guarantee performance of each individual user while optimizing outage probability of the entire system, user fairness is taken into account as well. Simulation results show that, compared with other cache placement and bandwidth allocation schemes, the proposed method can obtain lower outage probability and maintain user fairness.

Modified Hermite Pulse-Based Wideband Communication for High-Speed Data Transfer in Wireless Sensor Applications

With technological advances in the field of communication, the need for reliable high-speed data transfer is increasing. The deployment of large number of wireless sensors for remote monitoring and control and streaming of high definition video, voice and image data, etc. are imposing a challenge to the existing network bandwidth allocation for reliable communication. Two novel schemes for ultra-wide band (UWB) communication technology have been proposed in this paper with the key objective of intensifying the data rate by taking advantage of the orthogonal properties of the modified Hermite pulse (MHP). In the first scheme, a composite pulse is transmitted and in the second scheme, a sequence of multi-order orthogonal pulses is transmitted in the place of a single UWB pulse. The MHP pulses exhibit a mutually orthogonal property between different ordered pulses and due to this property, simultaneous transmission is achieved without collision in the UWB system, resulting in an increase in transmission capacity or improved bit error rate. The proposed schemes for enhanced data rate will offer high volume data monitoring, assessment, and control of wireless devices without overburdening the network bandwidth and pave the way for new platforms for future high-speed wireless sensor applications.

Energy consumption and bandwidth allocation in passive optical networks

A compromise between the energy consumption, at the central office (CO), and the maximum bandwidth capacity, offered to end users of passive optical networks (PON), is demonstrated. Four classes of PON are considered: two are based on consolidated technologies (GPON and XG-PON), and the others are the emerging TWDM-PON and OFDM-PON. By means of the proposed algorithm, we evaluate the distribution of users in a Manhattan topology model regarding power consumption and quality of service (QoS) in two scenarios: 1) fixed split ratio and; 2) flexible power division. According to the results in the first scenario, it is possible to provide bit rates up to 178.1Mb/s per user, for GPON, and 713.6Mb/s per user, for XG-PON, without affecting the QoS even in a high activity network. The second scenario explores “where” and “when” network operators should migrate to higher capacity technologies (when providing bit rates up to 1Gb/s per user) by means of deployment of TWDM-PON and/or OFDM-PON, while keeping a QoS above 20%.

QoE-Aware Bandwidth Allocation for Video Traffic Using Sigmoidal Programming

The problem of bandwidth allocation in networks is traditionally solved using distributed rate allocation algorithms under the general framework of network utility maximization (NUM). Despite many advances in solving the computationally intensive flow assignment problem in NUM, the common but unrealistic assumption of concavity of utility functions undermines the performance of existing systems in providing satisfactory quality of experience (QoE) to consumers of video traffic, the utility function of which is not concave, but sigmoidal. The authors propose to model the bandwidth allocation problem as a sigmoidal programming problem, more closely representing video traffic, and solve this nonconvex optimization problem using an approximation algorithm. Their simulation results for video streaming over a range of tree-shaped content delivery networks indicate improvements of at least 60 percent in average utility/QoE and 45 percent in fairness, while using slightly fewer network resources, compared to two representative methods: proportional fair and max-min fair.

Wireless structural control using stochastic bandwidth allocation and dynamic state estimation with measurement fusion

Wireless sensor networks are becoming more popular for structural monitoring because of their low installation costs; in addition, coupling structural control with wireless data acquisition can also yield advantages. However, these systems have limited communication bandwidth, limiting their effectiveness as the number of devices in control networks grows large if centralized control approaches are used. Traditional methods for collocating data in wireless structural control network rely on time-budgeted bandwidth or spatial decentralization, where the network is divided into smaller subnetworks. These methods are largely static and typically do not take into account any measure of data quality to prioritize transmissions. This study presents a dynamic approach for bandwidth allocation in wireless structural control networks that relies on an application-specific, autonomous, and controller-aware, carrier sense multiple access with collision detection protocol. Stochastic parameters are derived to strategically alter back-off times in the carrier sense multiple access with collision detection algorithm based on nodal observability and output estimation error. Inspired by data fusion approaches, this paper presents 2 different methods for neighborhood state estimation using a dynamic form of measurement-only fusion. Upon receiving data from the contended wireless medium, each wireless unit fuses incoming data using a precalculated static Kalman gain matrix for the corresponding dynamic neighborhood. Onboard, each wireless unit contains a library of Kalman gain matrices, to accommodate any possible set of communicated data. Both numerical simulations and small-scale laboratory experimental results are presented.

Optimizing bandwidth allocation in elastic optical networks with application to scheduling

We study a problem of optimal bandwidth allocation in the elastic optical networks technology, where usable frequency intervals are of variable width. In this setting, each lightpath has a lower and upper bound on the width of its frequency interval, as well as an associated profit, and we seek a bandwidth assignment that maximizes the total profit. This problem is known to be NP-complete. We strengthen this result by showing that, in fact, the problem is inapproximable within any constant ratio even on a path network. We further derive NP-hardness results and present approximation algorithms for several special cases of the path and ring networks, which are of practical interest. Finally, while in general our problem is hard to approximate, we show that an optimal solution can be obtained by allowing resource augmentation. Some of our results resolve open problems posed by Shalom et al. (2013) [28]. Our study has applications also in real-time scheduling.

Design and Performance Evaluation of Network-assisted Control Strategies for HTTP Adaptive Streaming

This article investigates several network-assisted streaming approaches that rely on active cooperation between video streaming applications and the network. We build a Video Control Plane that enforces Video Quality Fairness among concurrent video flows generated by heterogeneous client devices. For this purpose, a max-min fairness optimization problem is solved at runtime. We compare two approaches to actuate the optimal solution in an Software Defined Networking network: The first one allocates network bandwidth slices to video flows, and the second one guides video players in the video bitrate selection. We assess performance through several QoE-related metrics, such as Video Quality Fairness, video quality, and switching frequency. The impact of client-side adaptation algorithms is also investigated.

Investigation and System Implementation of Flexible Bandwidth Switching for a Software-Defined Space Information Network

This paper proposes and experimentally demonstrates a hybrid switching system that provides flexible bandwidth allocation for future laser and microwave space information networks. First, a switching node structure is designed for laser and microwave hybrid links, and an optimized strategy of flexible bandwidth allocation is presented based on the traffic distribution. Then, we establish a reconfigurable light and microwave hybrid switching system based on microwave photonics. The experimental results indicate that the proposed system can realize microwave frequency conversion and photoelectric hybrid switching. Additionally, bandwidth resources can be allocated flexibly and the bit-error rate of the baseband data is less than 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">−9</sup> . Furthermore, the simulation results of the proposed flexible bandwidth allocation strategy reveal that the spectrum utilization rate is more than 94% when the traffic is saturated.

A Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks

For the problem that traditional IPACT may cause superior USR, this paper constructs the Agent dynamic bandwidth allocation model. Introduced the idea of bargaining game. Proposed a local bandwidth allocation algorithm based on the bargain—bargain. Resequencing the date packets after bargaining according to the user level, delay and the size of packet. It Improves the thinking in traditional IPACT that date packet in order polling. The method may effectively solve the bandwidth allocation problem under the action of many factors. Experiments show that the model can effectively reduce the USR. It can also improve the efficiency of bandwidth allocation.

Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization

Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We also propose a preventive traffic disruption model for virtual wireless networks to minimize the amount of traffic that service providers have to reduce when substrate links fail by incorporating $\ell _{1}$ -norm into the objective function. Due to the large number of constraints in both normal state and link failure states, the formulated problem becomes a large-scale optimization problem and is very challenging to solve using the centralized computational method. Therefore, we propose the decomposition algorithms using the alternating direction method of multipliers that can be implemented in a parallel and distributed fashion. The simulation results demonstrate the computational efficiency of our proposed algorithms as well as the advantage of the formulated model in ensuring the minimal amount of traffic disruption when substrate links fail.

QoT-aware elastic bandwidth allocation and spare capacity assignment in flexible island-based optical transport networks under shared risk link group constraints

This paper focuses on the problem of provisioning multi-granularity static lightpath connections with fault-tolerant requirements in survivable island-based translucent optical networks with traffic grooming capabilities. The problem is tackled for the first time, to the best of our knowledge, taking into account both Quality of Transmission (QoT) and Shared Risk Link Group (SRLG) constraints. A two phase heuristic algorithm is proposed relying on a novel generic purpose-built auxiliary graph model that may support various factors of network heterogeneity (i.e., network nodes with different wavelength-conversion, regeneration and traffic grooming capabilities), and represent numerous network constraints related mainly to QoT requirements and network-resources. The purpose of the proposed heuristic is to optimize the utilisation of the available network resources and hence the network throughput through the simultaneous use of traffic grooming and two resource sharing techniques namely the Generalized Backup-Backup multiplexing (GBBM) and the Generalized Adaptive Primary-Backup Multiplexing (GAPBM) which are combined for the first time, as far as we know, under a static traffic scenario, and performed in such a way that 100% QoT-aware SRLG-fault recoverability is still guaranteed for all serviced lightpath requests. The performances of the proposed solution are demonstrated through multiple simulation experiments conducted on different network topologies.

Joint Power and Bandwidth Allocation in Wireless Cooperative Localization Networks

Cooperative localization can enhance the accuracy of wireless network localization by incorporating range information among agent nodes in addition to those between agents and anchors. In this paper, we investigate the optimal allocation of the restricted resources, namely, power and bandwidth, to different nodes. We formulate the optimization problems for both synchronous networks and asynchronous networks, where one way and round trip measurements are applied for range estimation, respectively. Since the optimization problems are nonconvex, we develop an iterative linearization-based technique, and show by comparison with brute-force search that it provides near-optimal performance in the investigated cases. We also show that especially in the case of inefficient anchor placement and/or severe shadowing, cooperation among agents is important and more resources should be allocated to the agents correspondingly.

Bandwidth Expansion and Allocation in Wireless Communication Networks

Bandwidth Expansion and Allocation in Wireless Communication Networks

A Micro-Finance Model for Spectrum Management in Wireless Networks

This paper incorporates the idea of micro-financing into bandwidth allocation in wireless networks. Resource allocation in heterogeneous wireless networks has been widely studied from the perspective of maximizing the system utilization or maximizing the carried traffic in the network. However, measurements show that the distribution of signal strength at different parts of a region is similar to the income distribution in an economic framework, wherein certain users are starved of spectrum causing “spectrum poverty” or “spectrum access poverty” to those users. This paper proposes a micro-finance model-based spectrum usage etiquette to help those with poor spectrum availability, loan spectrum from different service providers for small periods of time, and thus alleviate spectrum poverty. We price each user according to the credit history of the user. Results indicate micro-financing-based spectrum etiquette results in overall benefit for the entire system. Numerical results show 20–50% increase in the overall system utilization for the micro-finance model-based spectrum etiquette, compared to the traditional spectrum allocation model. Individually, the micro-finance model results in a 50–75% reduction in the new call blocking and 30–80% in call dropping performance for delay in-tolerant traffic and 25–50% reduction in the mean delay for delay tolerant traffic. To the best of our knowledge, this is the first research on micro-finance based spectrum etiquette to improve overall system performance.

Joint Downlink Cell Association and Bandwidth Allocation for Wireless Backhauling in Two-Tier HetNets With Large-Scale Antenna Arrays

The problem of joint downlink cell association (CA) and wireless backhaul bandwidth allocation (WBBA) in two-tier cellular heterogeneous networks (HetNets) is considered. Large-scale antenna array is implemented at the macro base station (BS), while the small cells within the macro cell range are single-antenna BSs and they rely on over-the-air links to the macro BS for backhauling. A sum logarithmic user rate maximization problem is investigated considering wireless backhauling constraints. A duplex and spectrum sharing scheme based on co-channel reverse time-division duplex (TDD) and dynamic soft frequency reuse (SFR) is proposed for interference management in two-tier HetNets with large-scale antenna arrays at the macro BS and wireless backhauling for small cells. Two in-band WBBA scenarios, namely, unified bandwidth allocation and per-small-cell bandwidth allocation scenarios, are investigated for joint CA-WBBA in the HetNet. A two-level hierarchical decomposition method for relaxed optimization is employed to solve the mixed-integer nonlinear program (MINLP). Solutions based on the General Algorithm Modeling System (GAMS) optimization solver and fast heuristics are also proposed for cell association in the per-small-cell WBBA scenario. It is shown that when all small cells have to use in-band wireless backhaul, the system load has more impact on both the sum log-rate and per-user rate performance than the number of small cells deployed within the macro cell range. The proposed joint CA-WBBA algorithms have an optimal load approximately equal to the size of the large-scale antenna array at the macro BS. The cell range expansion (CRE) strategy, which is an efficient cell association scheme for HetNets with perfect backhauling, is shown to be inefficient when in-band wireless backhauling for small cells comes into play.