Efficient Bandwidth Reservation Research Articles

A novel efficient cross layer-based bandwidth reservation mechanism for next generation wireless networks

In this paper, a cross-layer-based efficient bandwidth reservation mechanism (CLBRM) is proposed for next generation wireless networks. Application layer and network layer are involved in the design of the cross-layer architecture. Cross-layer architecture is used to reduce the delay. Shared database is used to implement the cross-layer architecture which allows to share the information among the application layer and the network layer. Bandwidth is reserved based on the type of requests and past history of the users. Four types of requests are used in this paper and priority is assigned among these requests. Two queues are maintained for last two priority requests and pre-emption of these requests is incorporated in order to serve the highly prioritised requests in a better way. The QoS parameters like delay, throughput, blocking probability, and dropping probability are used to evaluate the performance of the proposed mechanism. The performance of the proposed mechanism, CLBRM is compared with the data driven allocation (DDA) scheme (Fan et al., 2016) and proved to perform better.

Performance of Dynamic Priority Based Interference Aware Channel Allocation in Wireless Mesh Networks for Energy Conservation

The Dynamic Wireless Mesh Network (DWMN) infrastructure is a pair or multiple dynamic nodes with networking capability to communicate with one another utilising Sink Nodes (SN). Due to its mobile nature, it is termed as Dynamic in nature. SN traverses over the predefined path over the Wireless Mesh Network. As the nodes engage into mobility, the neighbourhood table should be updated at a minimum rate of once every five seconds. The alarming fact in WMN is, Energy to transmit a bit is equivalent to computing hundreds of instructions at that instant. Hence there is a need to concentrate on energy dimension of DWMN. A node loses certain amount of energy while transmitting and receiving the packet, hence there is a minor decline in the initial energy of the node. The existing value of energy at a moment after transmitting and receiving the packet is coined as Residual Energy. The energy consumed by the node for transmitting and receiving the packet over the particular time frame is coined as Average Energy. Network Simulator v.2 tool has been utilised to simulate network creation with multiple mobile nodes for packet transmission or reception and packet drop conditions due to interference. Bandwidth Reservation (BR) for energy analysis is done by both Priority Based Interference Aware Bandwidth Reservation (PBIABR) and Interference Aware Bandwidth Reservation (IABR) for many flowing rates under dynamic scenario. Channel Priority plays a vital role to opt the channel which posses less interference for efficient bandwidth reservation for PBIABR. The opted channel will have the minimal channel interference effect. IABR posses the controllability character for data flow to establish end-to-end communication over Multi-Radio Multi-Channel (MRMC) - Wireless Mesh Network. This research paper focuses on deep analysis of Residual Energy (joule) compared with Interval (sec) and Average Energy (joule) compared with Interval (sec) under dynamic scenario for multiple flow rates by implementing PBIABR and IABR criteria.

An efficient bandwidth reservation policy for data-intensive applications in cloud

Recently, more and more data-intensive applications have been deployed in cloud platforms due to its cost-effective and elastic capability. Although computing resources (i.e., CPU and RAM) can be provisioned in on-demand manner, the network bandwidth has enforce certain admission controlling for providing desirable quality-of-service (QoS). As a result, data-intensive applications often suffer from high delay during the phase of bulk data transferring between computing nodes. In this paper, we present an integrated bandwidth reservation algorithm, which combines different admission controlling policies and minimises the finishing time for all jobs in an online manner. Performance evaluation on a real-world cloud platform shows that the proposed reservation algorithm can ensure efficient bulk data transferring even when the system is facing heavy workloads.

An efficient bandwidth reservation policy for data-intensive applications in cloud

Recently, more and more data-intensive applications have been deployed in cloud platforms due to its cost-effective and elastic capability. Although computing resources (i.e., CPU and RAM) can be provisioned in on-demand manner, the network bandwidth has enforce certain admission controlling for providing desirable quality-of-service (QoS). As a result, data-intensive applications often suffer from high delay during the phase of bulk data transferring between computing nodes. In this paper, we present an integrated bandwidth reservation algorithm, which combines different admission controlling policies and minimises the finishing time for all jobs in an online manner. Performance evaluation on a real-world cloud platform shows that the proposed reservation algorithm can ensure efficient bulk data transferring even when the system is facing heavy workloads.

Burstiness-Aware Bandwidth Reservation for Ultra-Reliable and Low-Latency Communications in Tactile Internet

The Tactile Internet that will enable humans to remotely control objects in real time by tactile sense has recently drawn significant attention from both academic and industrial communities. Ensuring ultra-reliable and low-latency communications with limited bandwidth is crucial for Tactile Internet. Recent studies found that the packet arrival processes in Tactile Internet are very bursty. This observation enables us to design a spectrally efficient resource management protocol to meet the stringent delay and reliability requirements while minimizing the bandwidth usage. In this paper, both model-based and data-driven unsupervised learning methods are applied in classifying the packet arrival process of each user into high or low traffic states, so that we can design efficient bandwidth reservation schemes accordingly. However, when the traffic-state classification is inaccurate, it is very challenging to satisfy the ultra-high reliability requirement. To tackle this problem, we formulate an optimization problem to minimize the reserved bandwidth subject to the delay and reliability requirements by taking into account the classification errors. Simulation results show that the proposed methods can save 40%-70% bandwidth compared with the conventional method that is not aware of burstiness, while guaranteeing the delay and reliability requirements. Our results are further validated by the practical packet arrival processes acquired from experiments using a real tactile hardware device.

Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms

Memory bandwidth in modern multi-core platforms is highly variable for many reasons and it is a big challenge in designing real-time systems as applications are increasingly becoming more memory intensive. In this work, we proposed, designed, and implemented an efficient memory bandwidth reservation system, that we call MemGuard. MemGuard separates memory bandwidth in two parts: guaranteed and best effort. It provides bandwidth reservation for the guaranteed bandwidth for temporal isolation, with efficient reclaiming to maximally utilize the reserved bandwidth. It further improves performance by exploiting the best effort bandwidth after satisfying each core's reserved bandwidth. MemGuard is evaluated with SPEC2006 benchmarks on a real hardware platform, and the results demonstrate that it is able to provide memory performance isolation with minimal impact on overall throughput.

Mobility-Prediction-Aware Bandwidth Reservation Scheme for Mobile Networks

Bandwidth is an extremely valuable and scarce resource in mobile networks; therefore, efficient mobility-aware bandwidth reservation is necessary to support multimedia applications (e.g., video streaming) that require quality of service (QoS). In this paper, we propose a distributed bandwidth reservation scheme called the mobility-prediction-aware bandwidth reservation (MPBR) scheme. The objective of MPBR is to reduce handoff call dropping rate and maintain acceptable new call blocking rate while providing efficient bandwidth utilization. MPBR consists of 1) a handoff time estimation (HTE) scheme that aims to estimate the time windows when a user will perform handoffs along the path to his destination, 2) an available bandwidth estimation (ABE) scheme that aims to estimate in advance available bandwidth, during the computed time windows in the cells to be traversed by the user to his destination, and 3) an efficient call admission control (ECaC) scheme that aims to control bandwidth allocation in the network cells. The simulation results show that MPBR outperforms existing schemes in terms of reducing handoff call dropping rate.

Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning

Large-scale collaborative e-science requires fast and reliable data transfer with guaranteed performance, which is made possible by reserving bandwidth as needed in advance in high-performance networks. In scientific applications, users typically know the data size, the data available time, and the deadline to finish the data transfer, and they always wish to achieve the earliest possible finish time or the minimum time duration for the data transfer. On the other hand, the network service provider wishes to serve as many users' bandwidth reservation requests (BRRs) as possible to maximize the network resource utilization without compromising their deadlines. Such multi-objective requirements and high system throughput call for a fast and efficient bandwidth reservation strategy that can quickly discover various reservation options in a time-varying network environment. We propose two bandwidth reservation algorithms with rigorous optimality proofs to compute the reservation options with the earliest completion time and with the shortest duration for a local BRR. Our algorithms aim to achieve the balanced resource utilization for the network system. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of execution time, success ratio, success ratio of BRRs with different priorities and searched complexity of BRRs in comparison with similar scheduling algorithms.

Optimal Channel Allocation Algorithm with Efficient Bandwidth Reservation for Cellular Networks

growth of mobile users increasing in the present scenario and because of limited bandwidth available, there is a need to efficiently use the bandwidth available. The quality of service can be maximized by efficient bandwidth reservation. In this paper, the cross layer based bandwidth reservation scheme is proposed which initially reserves some amount of bandwidth for handoff flows. After that the bandwidth can be increased for handoff flows by the base station based on the user mobility. The user may not only go straight but also left, right and backwards. This paper considers all possibilities of user movements and bandwidth is reserved accordingly. Therefore making the base stations to dynamically increase the reserved bandwidth for handoffs when the initially reserved bandwidth is insufficient reduces the end to end delay and increases the throughput of the system. The proposed system performance is compared with the legacy systems and is shown to be better.

CHANNEL SHARING SCHEME FOR CELLULAR NETWORKS USING MDDCA PROTOCOL IN WLAN

In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. When mobile hosts move from one cell to another cell, to provide uninterrupted service, the new cell should have enough channels to support the ongoing communication of the mobile hosts that moved into the cell. If channels are statically allocated, a cell may run out of channels when large number of mobile hosts moves to a cell, thus degrading the quality of service. To overcome this problem, dynamic channel allocation approaches have been proposed which allocate channels to cells on demand, thus increasing channel utilization and hence improving the quality of service. A distributed dynamic channel allocation algorithms gained a lot of attention due to their high reliability and scalability. The cell that wants to borrow a channel has to wait for replies from all its interference neighbors and hence, is not fault-tolerant. This work aims to propose a Distributed dynamic channel allocation algorithm to make use of the available channel efficiently. It can tolerate the failure of mobile nodes as well as static nodes and enhance the quality of service by making efficient reuse of channels. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.

An adaptive bandwidth reservation scheme for 4G cellular networks using flexible 2-tier cell structure

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in packet-switched fourth generation mobile communication networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in fourth generation mobile communication networks, particularly when the handoff traffic is heavy. In this paper, an adaptive two-tier scheme, which employs grey prediction theory and swarm intelligence techniques, is proposed to reduce the forced termination probability of multimedia handoffs. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in the literature when performance metrics are measured in terms of the forced termination probability for the handoffs, the call blocking probability for the new connections and bandwidth utilization.

An efficient approach for distributed dynamic channel allocation with queues for real-time and non-real-time traffic in cellular networks

We are witnessing these days a rapid growth of mobile users. Therefore, frequency spectrum must be efficiently utilized, as available frequency spectrum is limited. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility. The direction of user mobility may not be straight always, but the user may also go left, right or backwards. Thus, QoS can be improved, if the channel reservation is made based upon the user mobility and the location of the user. We devise here a new algorithm that deals with multiple traffic systems by modifying the existing DDCA algorithm [Krishna, P.V., Iyengar, N.Ch.S.N., 2008. Optimal channel allocation algorithm with efficient channel reservation for cellular networks. International Journal of Communication Networks and Distributed Systems 1 (1), 33–51]. This algorithm reserves more channels for hot cells, less number of channels for cold cells and an average number of channels for the medium cells. Furthermore, we maintain queues for all types of calls. We model the system by a three-dimensional Markov Chain and compute the QoS parameters in terms of the blocking probability of originating calls and the dropping probability of handoff calls. The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.

Adaptive resource reservation schemes for proportional DiffServ enabled fourth-generation mobile communications system

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in packet-switched fourth generation mobile communication networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in fourth generation mobile communication networks, particularly when the handoff traffic is heavy. In this paper, two self-adaptive bandwidth reservation schemes, which adopt support vector regression and swarm intelligence techniques, respectively, are proposed to reduce the forced termination probability of multimedia handoffs. Meanwhile, a proportional differentiated service model is incorporated into our schemes to accommodate new metrics used in processing handoffs in next generation networks. The simulation results show that both the proposed schemes can achieve superior performance than the representative bandwidth-reserving schemes in the literature when performance metrics are measured in terms of the forced termination probability for the handoffs, the call blocking probability for the new connections and bandwidth utilization.

Application of support vector machines to bandwidth reservation in sectored cellular communications

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in sectored cellular networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in the sectored cellular communications, particularly when the handoff traffic is heavy. In this paper, a self-adaptive bandwidth reservation scheme, which adopts support vector machines technique, is proposed to reduce the forced termination probability. Meanwhile, a channel-borrowing technique is used to decrease the new call-blocking probability of real-time traffic. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in sectored cellular networks in the literature when performance metrics are measured in terms of the forced termination probability and the new call- blocking probability.

A self-adaptive bandwidth reservation scheme for sectored cellular communications

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in sectored cellular networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in the sectored cellular communications, particularly when the handoff traffic is heavy. In this paper, a self-adaptive bandwidth reservation scheme, which employs a neural fuzzy bandwidth-reserving estimator, is proposed to reduce the forced termination probability. Meanwhile, a channel borrowing technique is used to decrease the new call blocking probability of real-time traffic. The simulation results show that our scheme can achieve superior performance than traditional fixed bandwidth-reserving scheme in sectored cellular networks when performance metrics are measured in terms of the forced termination probability and the new call blocking probability.

Dynamic-grouping bandwidth reservation scheme for multimedia wireless networks

In wireless networks carrying multimedia traffic (voice, video, data, and image), it becomes necessary to provide a quality-of-service(QoS) guarantee for multimedia traffic connections supported by the network. In order to provide mobile hosts with high QoS in the next-generation wireless networks, efficient and better bandwidth reservation schemes must be designed. This paper presents a novel dynamic-grouping bandwidth reservation scheme as a solution to support QoS guarantees in the next-generation wireless networks. The proposed scheme is based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks. We establish several reservation time sections, called groups, according to the mobility information of mobile hosts of each base station. The amount of reserved bandwidth for each base station is dynamically adjusted for each reservation group. We use the dynamic-grouping bandwidth reservation scheme to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization. The simulation results show that the dynamic-grouping bandwidth reservation scheme provides less connection-blocking rate and less connection-dropping rate and achieves high bandwidth utilization.

An efficient bandwidth reservation and call admission control scheme for wireless mobile networks

With increasing use of mobile units for various applications, it has become imperative to provide services with quality of service (QoS) guarantees. Efficient utilization of the available bandwidth is an important issue in any QoS provisioning scheme. To this end, we propose techniques for bandwidth reservation and call admission control for wireless mobile networks. Our proposed techniques utilize the available bandwidth efficiently to provide QoS guarantee with reduced new call rejection and handoff call blocking. We have analyzed the performance of our scheme through extensive simulation studies. The results appear promising.