Bandwidth Reservation Scheme Research Articles

A market-based bandwidth charging framework

The increasing demand for high-bandwidth applications such as video-on-demand and grid computing is reviving interest in bandwidth reservation schemes. Earlier attempts did not catch on for a number of reasons, notably lack of interest on the part of the bandwidth providers. This, in turn, was partially caused by the lack of an efficient way of charging for bandwidth. Thus, the viability of bandwidth reservation depends on the existence of an efficient market where bandwidth-related transactions can take place. For this market to be effective, it must be efficient for both the provider (seller) and the user (buyer) of the bandwidth. This implies that: (a) the buyer must have a wide choice of providers that operate in a competitive environment, (b) the seller must be assured that a QoS transaction will be paid by the customer, and (c) the QoS transaction establishment must have low overheads so that it may be used by individual customers without a significant burden to the provider. In order to satisfy these requirements, we propose a framework that allows customers to purchase bandwidth using an open market where providers advertise links and capacities and customers bid for these services. The model is close to that of a commodities market that offers both advance bookings (futures) and a spot market. We explore the mechanisms that can support such a model.

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

A multiprocessor scheduling scheme is presented for supporting hierarchical containers that encapsulate sporadic soft and hard real-time tasks. In this scheme, each container is allocated a specified bandwidth, which it uses to schedule its children (some of which may also be containers). This scheme is novel in that, with only soft real-time tasks, no utilization loss is incurred when provisioning containers, even in arbitrarily deep hierarchies. Presented experiments show that the proposed scheme performs well compared to conventional real-time scheduling techniques that do not provide container isolation.

On Demand Bandwidth Reservation for Real-Time Traffic in Cellular IP Network using Particle Swarm Optimization

Cellular IP network deals with micro mobility of the mobile devices. An important challenge in wireless communication, especially in cellular IP based network, is to provide good Quality of Service (QoS) to the users in general and to the real-time users (users involved in the exchange of real-time packets) in particular. Reserving bandwidth for real time traffic to minimize the connection drop (an important parameter) is an activity often used in Cellular IP network. Particle Swarm Optimization (PSO) algorithm simulates the social behavior of a swarm or flock to optimize some characteristic parameter. PSO is effectively used to solve many hard optimization problems. The work, in this paper, proposes an on demand bandwidth reservation scheme to improve Connection Dropping Probability (CDP) in cellular IP network by employing PSO. The swarm, in the model, consists of the available bandwidth in the seven cells of the cellular IP network. The anytime bandwidth demand for real-time users is satisfied by the available bandwidth of the swarm. The algorithm, used in the model, searches for the availability of the bandwidth and reserves it in the central cell of the swarm. Eventually, it will allocate it on demand to the cell that requires it. Simulation experiments reveal the efficacy of the model.

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Tiered bandwidth reservation scheme for multimedia wireless networks

AbstractIt is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier‐based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright © 2008 John Wiley & Sons, Ltd.

Periodically scheduled burst flows in optical burst switching networks

Providing flexible quality of service (QoS) for multiple classes of traffics is one of the important challenges in the design of optical burst switching (OBS) networks. In this paper, we propose a novel bandwidth reservation scheme for periodically scheduled bursts. Multi-protocol label switching (MPLS) is used to construct reliable burst delivery channels across the network. Meanwhile, best effort bursts are transferred using one-way offset signalling to improve the wavelength efficiency. Our hybrid OBS architecture provides flow level QoS control without compromising the performance of best effort bursts. Simulation results show that our approach is better than early dropping schemes.

Multi-class Bandwidth Reservation Scheme Based on Mobility Prediction for Handoff in Multimedia Wireless/Mobile Cellular Networks

Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to Mobile Terminal (MT) with guaranteed Quality of Service (QoS). The challenge is to maintain the playing continuity of multimedia streams during handoff. In this paper, a bandwidth reservation scheme based on mobility prediction is proposed, to enable high accurate prediction of next crossing cell (target cell) which a MT is going to, in order to avoid too early or over reservation resulting in a waste of resources. The amount of bandwidth to be reserved is dynamically adjusted according to (a) the current position (location) and the extrapolated direction of MT and; (b) the sector and zones of the cell. A Call Admission Control scheme (CAC) is also considered to further guarantee the QoS of real time traffic. The performance of the system is evaluated through discrete event simulation of the wireless cellular environment. Simulation results show that the proposed scheme as compared to several existing schemes is able to reduce the Handoff Call Dropping Probability (HCDP) of real time traffic and the number of terminated ongoing calls of non-real time traffic. In addition, it is efficient to reduce the number of cancelled reservation and subsequently increase the system bandwidth utilization.

Implementation of call admission control scheme in next generation mobile communication networks using particle swarm optimization and fuzzy logic systems

In the present and next generation wireless networks, cellular system remains the major method of telecommunication infrastructure. Since the characteristic of the resource constraint, call admission control is required to address the limited resource problem in wireless network. The call dropping probability and call blocking probability are the major performance metrics for quality of service (QoS) in wireless network. Many call admission control mechanisms have been proposed in the literature to decrease connection dropping probability for handoffs and new call blocking probability in cellular communications. In this paper, we proposed an adaptive call admission control and bandwidth reservation scheme using fuzzy logic control concept to reduce the forced termination probability of multimedia handoffs. Meanwhile, we adopt particle swarm optimization (PSO) technique to adjust the parameters of the membership functions in the proposed fuzzy logic systems. The simulation results show that the proposed scheme can achieve satisfactory performance 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.

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.

BANDWIDTH RESERVATION ALGORITHM FOR WIRELESS CELLULAR NETWORKS

This paper presents an advanced bandwidth reservation technique to improve Quality of Service (QoS) by reducing the forced call termination during handoff. One solution to ensure continuity of on-going calls and reduce the forced call termination during handoff is to predict Mobile Station (MS) trajectory and do resource reservation in advance. So, we propose a new scheme that uses an accurate mobility prediction algorithm to predict MS next location and uses this data in bandwidth reservation scheme to improve QoS. The performance of the algorithm is evaluated via simulations. The simulation results show that our algorithm reduces handoff call drop rate without over reserving the resources hence it improves bandwidth utilization and reduces new call blocking rate.

A Predictive Bandwidth Reservation Scheme Using Mobile Positioning and Road Topology Information

In cellular networks, an important practical issue is how to limit the handoff dropping probability efficiently. One possible approach is to perform dynamic bandwidth reservation based on mobility predictions. With the rapid advances in mobile positioning technology, and the widespread availability of digital road maps previously designed for navigational devices, we propose a predictive bandwidth reservation scheme built upon these timely opportunities. In contrast to the common practice of utilizing only incoming handoff predictions at each cell to compute the reservations, our scheme is more efficient as it innovatively utilizes both incoming and outgoing handoff predictions; it can meet the same target handoff dropping probability by blocking fewer new calls. The individual base stations are responsible for the computations, which are shown to be simple enough to be performed in real-time. We evaluate the scheme via simulation, along with five other schemes for comparison. Simulation results show that those schemes that rely on positioning information are significantly more efficient than those that do not. Our scheme's additional use of the road topology information further improves upon this advantage, bringing the efficiency closer to the bound set by a benchmark scheme that assumes perfect knowledge about future handoffs

SLA brokering and bandwidth reservation negotiation schemes for QoS-aware internet

We present a novel Service Level Agreement (SLA)-driven service provisioning architecture, which enables dynamic and flexible bandwidth reservation schemes on a per-user or per-application basis. Various session level SLA negotiation schemes involving bandwidth allocation, service start time and service duration parameters are introduced and analyzed. The results show that these negotiation schemes can be utilized for the benefit of both end users and network providers in achieving the highest individual SLA optimization in terms of key Quality of Service (QoS) metrics and price. The inherent characteristics of software agents such as autonomy, adaptability and social abilities offer many advantages in this dynamic, complex, and distributed network environment especially when performing Service Level Agreements (SLA) definition negotiations and brokering tasks. This article also presents a service broker prototype based on Fujitsu's Phoenix Open Agent Mediator (OAM) agent technology, which was used to demonstrate a range of SLA brokering scenarios.

Multi-threshold bandwidth reservation scheme of an integrated voice/data wireless network

In supporting various integrated services which demand different bandwidth and quality of service (QoS) requirements in these wireless networks, resource provisioning becomes a major issue. Due to the limited nature of the bandwidth of wireless links, it is essential to design wireless mobile networks that furnish effective and dynamic bandwidth allocation policies which not only have to ensure that the system guarantee potentially different QoS requirements and provide the necessary service differentiation from diverse applications, but simultaneously has to fully utilize the scarce wireless bandwidth available. To achieve this goal, we propose a generalized analytical model to investigate the performance of an integrated voice/data wireless mobile network in terms of various performance metrics which include, but are not limited to, voice-call blocking probability, forced termination probability, total channel utilization, and total carried traffic. A complete sharing system with multiple thresholds based on the guard channel policy is proposed and then analyzed using a two-dimensional Markov process.

A dynamic multiple-threshold bandwidth reservation (DMTBR) scheme for QoS provisioning in multimedia wireless networks

Next-generation wireless networks target to provide quality of service (QoS) for multimedia applications. We study the wireless systems that support two QoS requirements: keeping the handoff dropping probability less than a predefined QoS threshold while maintaining relative priorities for different traffic classes based on blocking probability. To achieve this goal, a dynamic multiple-threshold bandwidth reservation (DMTBR) scheme, which is capable of granting differential priorities to different traffic classes and to new and handoff traffic for each class by dynamically adjusting bandwidth reservation thresholds, is proposed. In this scheme, the thresholds are obtained in two steps. The initial values are estimated based on instantaneous network traffic situation, then the thresholds will be further adapted according to the instantaneous network QoS status. In times of network congestion, a preventive measure is taken to throttle the new connections. Another contribution of this paper is to generalize the concept of relative priority and hence give the network operator more flexibility to adjust admission control policy by taking into account some dynamic factors such as offered load. The extensive simulations are conducted for two purposes. First, we verify the performance of the proposed scheme and show our scheme performs well under various traffic loads. Second, we demonstrate that the DMTBR scheme gains more advantages when taking the offered load into consideration.

An Efficient Scheduling Discipline for Packet Switching Networks Using Earliest Deadline First Round Robin

This paper addresses a frame-oriented scheduling discipline, EDF-RR (earliest deadline first round robin), for OQ (output-queued) switch architecture and data traffic consisting of fixed-length cells. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a repeatedly-transferred frame. Each cell that is going to be transferred in the frame is assigned a virtual release time and a virtual deadline according to the bandwidth reservation scheme. The transmitting order of the cells in the frame is determined by non-preemptive non-idling EDF algorithm so that cells of a backlogged session in the frame are distributed as uniformly as possible. Through the analysis applying real-time scheduling theory and network calculus as well as network simulation, EDF-RR takes the advantage of O(1) computational complexity, and possesses tight delay bounds and lenient buffer requirements. The proposed scheduling discipline is appropriate for distributed real-time systems as we show that sessions can be configured based on message traffic models and deadline requirements. Also, a modified version of EDF-RR, called EDF-DRR, can be applied as traffic regulator when jitter requirements exist among active sessions.

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.

Aggregate History of User Mobility Pattern for QoS Provisioning in Multimedia Wireless Networks

Multimedia traffic is expected to be included in the next generation of wireless networks. As in wireline networks, the wireless network must also be capable of providing guaranteed quality-of-service (QoS) over the lifetime of mobile connections. In this paper, a bandwidth reservation scheme incorporating a user mobility prediction is proposed to manage the QoS of the networks. The mobility prediction scheme is developed based on the aggregate history of mobile users. Based on the mobility prediction, bandwidth is reserved to guarantee the uninterrupted handoff process. Simulation results demonstrate that the proposed scheme can guarantee the required QoS requirements in terms of handoff call dropping probability and new call blocking probability while maintaining efficient bandwidth utilization.

Bandwidth-Reservation Scheme Based on Road Information for Next-Generation Cellular Networks

Channel-reservation techniques have been widely studied in cellular networks in order to meet the desired quality-of-service requirements. In this paper, a distributed predictive channel-reservation scheme, called the road-map-based channel-reservation scheme (RMCR), and a call-admission-control algorithm are proposed. The goal is to reduce the handoff-dropping probability and to improve the bandwidth utilization. In the RMCR scheme, we assume that base stations (BSs) are equipped with road-map information and that mobile stations (MSs) are equipped with global positioning systems (GPS) devices. MSs periodically report their GPS location information to their BSs. Based on the location information of the MSs at two consecutive epochs, the BSs estimate the speed and moving direction of the MSs. Furthermore, the BSs estimate the probability that the MSs will enter the neighboring cells based on their velocity and the road-map information stored in the BSs. The BSs then compute the amount of bandwidth to be reserved, based on such estimation. With the road-map information, the BSs can make a more-accurate prediction on the user's mobility and, hence, reduce unnecessary bandwidth reservation. Simulation results show that RMCR is capable of keeping the handoff-dropping probability low and allocating bandwidth to new/handoff calls efficiently. We also show that RMCR is robust with respect to system parameters such as user's speed, the density of roads, the accuracy of mobility measurement, and so on.

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.