Scalable qDPM/sup 2/ mechanism: admission control for differentiated service networks

This paper examines the problem of achieving the QoS goals in differentiated service (DiffServ) networks, studies a dynamic provisioning mechanism for admission control in the DiffServ network, and proposes the scalable qDPM/sup 2/ mechanism based on the centralized bandwidth broker, distributed measurement based admission control and movable boundary bandwidth management.     

Flow‐Based QoS Management Architectures for the Next Generation Network

At the extremes of the complexity‐performance plane, there are two exemplary QoS management architectures: Integrated Services (IntServ) and Differentiated Services (DiffServ). IntServ performs ideally but is not scalable. DiffServ is simple enough to be adopted in today's core networks, but without any performance guarantee. Many compromise solutions have been proposed. These schemes, called quasi‐stateful IntServ or stateful DiffServ, however, have not attracted much attention due to their inherently compromising natures. Two disruptive flow‐based architectures have been recently introduced: the flow‐aware network (FAN) and the flow‐state‐aware network (FSA). FAN's control is implicit without any signaling. FSA's control is even more sophisticated than that of IntServ. In this paper, we survey established QoS architectures, review disruptive architectures, discuss their rationales, and points out their disadvantages. A new QoS management architecture, flow‐aggregate‐based services (FAbS), is then proposed. The FAbS architecture has two novel building blocks: inter‐domain flow aggregation and endpoint implicit admission control.     

A flexible and distributed architecture for adaptive end-to-end QoS provisioning in next-generation networks

A novel distributed end-to-end quality-of-service (QoS) provisioning architecture based on the concept of decoupling the end-to-end QoS provisioning from the service provisioning at routers in the differentiated service (DiffServ) network is proposed. The main objective of this architecture is to enhance the QoS granularity and flexibility offered in the DiffServ network model and improve both the network resource utilization and user benefits. The proposed architecture consists of a new endpoint admission control referred to as explicit endpoint admission control at the user side, the service vector which allows a data flow to choose different services at different routers along its data path, and a packet marking architecture and algorithm at the router side. The achievable performance of the proposed approach is studied, and the corresponding results demonstrate that the proposed mechanism can have better service differentiation capability and lower request dropping probability than the integrated service over DiffServ schemes. Furthermore, it is shown that it preserves a friendly networking environment for conventional transmission control protocol flows and maintains the simplicity feature of the DiffServ network model.     

Practical and analytical approaches for designing scalable on‐demand policy‐based resource allocation in stateless IP networks

Today the policy‐based management (PBM) approach is recognized as an efficient solution to simplify the complex task of managing and controlling networks. To this end, the Internet Engineering Task Force (IETF) has introduced a reference framework to build PBM systems. However, this framework only addresses the provisioning of relatively long validity period services based on predefined service‐level agreements. Furthermore, very little work addresses the scalability properties of the instantiation of this framework in a real network. This work aims to extend the IETF PBM framework in order to support dynamic provisioning of short‐term services (end‐system signalling) as well as an instantiation scheme that is scalable (distributed provisioning of edge routers). This instantiation scheme is based on the distribution of the provisioning process while keeping centralized only the parts that involve critical resources, namely bandwidth brokerage. The performance properties of the proposed scheme are then demonstrated throughout both extensive experimentation and an analytical study. The extension of this performance analysis to the case where multiple bandwidth brokers are used is also discussed. The results of this work are intended to be used as a guideline to help network operators to design a scalable PBM system in order to offer to their customers services with quality of service assurance on an on‐demand basis. Copyright © 2011 John Wiley & Sons, Ltd.     

Space‐time diversity‐enhanced QoS provisioning for real‐time service over MC‐DS‐CDMA based wireless networks

In order to support the quality‐of‐service (QoS) requirements for real‐time traffic over broadband wireless networks, advanced techniques such as space‐time diversity (STD) and multicarrier direct‐sequence code division multiple access (MC‐DS‐CDMA) are implemented at the physical layer. However, the employment of such techniques evidently affects the QoS provisioning algorithms at the medium access control (MAC) layer. In this paper, we propose a space‐time infrastructure and develop a set of cross‐layer real‐time QoS‐provisioning algorithms for admission control, scheduling, and subchannel‐allocations. We analytically map the parameters characterizing the STD onto the admission‐control region guaranteeing the real‐time QoS. Our analytical analyses show that the proposed algorithms can effectively support real‐time QoS provisioning. Also presented are numerical solutions and simulation results showing that the STD can significantly improve the QoS provisioning for real‐time services over wireless networks. Copyright © 2007 John Wiley & Sons, Ltd.     

Providing and verifying advanced IP services in hierarchical DiffServ networks‐the case of GEANT

The differentiated services (DiffServ) framework is widely proposed as an efficient method for providing advanced IP services to large‐scale networks, with QoS requirements. However, the provisioning of such services in production networks has proved to be more difficult than initially expected, in defining, setting and verifying appropriate Service Level Agreements (SLAs). GEANT, the Gigabit core pan‐European research network, on a pilot basis introduced ‘Premium IP’ service, offering bounded delay and negligible packet loss to the European National Research & Education Networks (NRENs) that it interconnects. However, large scale provisioning of this new service requires the definition of efficient interaction procedures between administrative domains involved and methods for SLA monitoring. This paper focuses on these issues and presents the experience acquired from the early experiments in GEANT, as an example of hierarchical Gigabit multi‐domain environment, enabled with QoS provisioning to its constituent NRENs. This model scales more efficiently than the common peering Internet Service provider (ISP) commercial paradigm. Finally, we outline other options that promise QoS, such as Layer 2 VPNs in MPLS backbones, with non‐standard (yet) mechanisms. Copyright © 2004 John Wiley & Sons, Ltd.     

Enabling novel premium service classes in DiffServ over MPLS‐enabled network

Network resources dimensioning and traffic engineering influence the quality in provisioned services required by the Expedited Forwarding (EF) traffic in production networks established through DiffServ over MPLS‐enabled network. By modeling EF traffic flows and the excess of network resources reserved for it, we derive the range of delay values which are required to support these flows at DiffServ nodes. This enables us to develop an end‐to‐end (e2e) delay budget‐partitioning mechanism and traffic‐engineering techniques within a framework for supporting new premium QoS levels, which are differentiated based on e2e delay, jitter and loss. This framework enables ingress routers to control EF traffic flow admission and select appropriate routing paths, with the goal of EF traffic balancing, avoiding traffic congestion and getting the most use out of the available network resources through traffic engineering. As a result, this framework should enable Internet service providers to provide three performance levels of EF service class to their customers provided that their network is DiffServ MPLS TE aware. Copyright © 2008 John Wiley & Sons, Ltd.     

Multicast Support in DiffServ Using Mobile Agents

Many multicast applications, such as video‐on‐demand and video conferencing, desire quality of service (QoS) support from an underlying network. The differentiated services (DiffServ) approach will bring benefits for theses applications. However, difficulties arise while integrating native IP multicasting with DiffServ, such as multicast group states in the core routers and a heterogeneous QoS requirement within the same multicast group. In addition, a missing per‐flow reservation in DiffServ and a dynamic join/leave in the group introduce heavier and uncontrollable traffic in a network. In this paper, we propose a distributed and stateless admission control in the edge routers. We also use a mobile agents‐based approach for dynamic resource availability checking. In this approach, mobile agents act in a parallel and distributed fashion and cooperate with each other in order to construct the multicast tree satisfying the QoS requirements.     

A differentiated optical services model for WDM networks

This article addresses the issues of scalable end-to-end QoS in metropolitan DWDM networks serving as transit networks for IP access networks. DWDM offering a few wavelengths has been deployed in the past in backbone networks to upgrade point-to-point transmission where sharing is based on coarse granularity. This type of DWDM backbone network, offering a few light-paths, provides no support for QoS services traversing the network. As DWDM networks with larger numbers of wavelengths penetrate the data-centric metro environment, specific IP service requirements such as priority restoration, scalability, dynamic provisioning of capacity and routes, and support for coarse-grain QoS capabilities will have to be addressed in the optical domain in order to achieve end-to-end QoS over a DWDM network. We propose a QoS service model in the optical domain called differentiated optical services (DoS) based on a set of optical parameters that captures the quality and reliability of the optical lightpath     

Architectures and performance evaluation of bandwidth brokers

DiffServ is the basis of contemporary QoS‐enabled networks. Setting up DiffServ QoS requires extensive engineering effort in dimensioning and provisioning, especially for adjacent networks under different administrations linked in a ‘federated’ hierarchy. The bandwidth broker is an entity that is responsible for the management of the resources and the QoS service operation in an automated way. In this paper, we present, test and compare two different architectures of bandwidth brokers: a centralized one and a distributed one. We also deal with the inter‐domain operation of the bandwidth broker in order to perform end‐to‐end provisioning. The paper presents the relevant aspects for inter‐domain operation of a bandwidth broker and focuses on pathfinding issues. We discuss two models for inter‐domain routing through bandwidth brokers, analyzing their advantages and comparing them. Copyright © 2008 John Wiley & Sons, Ltd.     

Proportional delay differentiation provision by bandwidth adaptation of class‐based queue scheduling

Supporting quality of service (QoS) over the Internet is a very important issue and many mechanisms have already been devised or are under way towards achieving this goal. One of the most important approaches is the so‐called Differentiated Services (DiffServ) architecture, which provides a scalable mechanism for QoS support in a TCP/IP network. The main concept underlying DiffServ is the aggregation of traffic flows at an ingress (or egress) point of a network and the marking of the IP packets of each traffic flow according to several classification criteria. Diffserv is classified under two taxonomies: the absolute and the relative. In absolute DiffServ architecture, an admission control scheme is utilized to provide QoS as absolute bounds of specific QoS parameters. The relative DiffServ model offers also QoS guarantees per class but in reference to the guarantees given to the other classes defined. In this paper, relative proportional delay differentiation is achieved based on class‐based queueing (CBQ) scheduler. Specifically, the service rates allocated to the classes of a CBQ scheduler are frequently adjusted in order to obtain relative delay spacing among them. The model presented can also be exploited in order to meet absolute delay constraints in conjunction with relative delay differentiation provision. Simulation experiments verify that our model can attain relative as well as absolute delay differentiation provided that the preconditions posed are satisfied. Copyright © 2004 John Wiley & Sons, Ltd.     

Flow‐Based Admission Control Algorithm in the DiffServ‐Aware ATM‐Based MPLS Network

This paper proposes a flow‐based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi‐Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ‐aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay‐bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ‐aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end‐to‐end delay and path utilization.     

Efficient slice‐aware H.264/AVC video transmission over time‐driven priority networks

This paper proposes a multimedia streaming architecture that combines network and video technologies to handle video traffic over multi‐hop access networks. In this context, resource overprovision typical of current quality of service approaches will become a limiting factor because of the increasing spread of bandwidth‐intensive multimedia applications. The proposed scheme adopts a time‐driven priority scheduling at network nodes and exploits slice classification at the video encoder to differentiate packets. The service guarantees offered by time‐driven priority, together with the packet classification, significantly reduce congestion and increase the video quality at the receiver with respect to the traditional differentiated services (DiffServ) approach, also achieving high resource utilization. This is an important result, as current DiffServ‐based architectures are far from obtaining such resource utilization in conjunction with reasonable delays and jitters. Copyright © 2013 John Wiley & Sons, Ltd.     

Call admission control for QoS provisioning in 4G wireless networks: issues and approaches

This article presents a survey on the issues and the approaches related to designing call admission control schemes for fourth-generation wireless systems. We review the state of the art of CAC algorithms used in the traditional wireless networks. The major challenges in designing the CAC schemes for 4G wireless networks are identified. These challenges are mainly due to heterogeneous wireless access environments, provisioning of quality of service to multiple types of applications with different requirements, provisioning for adaptive bandwidth allocation, consideration of both call-level and packet-level performance measures, and consideration of QoS at both the air interface and the wired Internet. To this end, architecture of a two-tier CAC scheme for a differentiated services cellular wireless network is presented. The proposed CAC architecture is based on the call-level and packet-level QoS considerations at both the wireless and wired parts of the network. A performance analysis model for an example CAC scheme based on this architecture is outlined, and typical numerical results are presented.     

Pricing network resources for adaptive applications

The Differentiated Services framework (DiffServ) has been proposed to provide multiple Quality of Service (QoS) classes over IP networks. A network supporting multiple classes of service also requires a differentiated pricing structure. In this work, we propose a pricing algorithm in a DiffServ environment based on the cost of providing different levels of services, and on long-term average user resource demand of a service class. We integrate the proposed service-dependent pricing scheme with a dynamic pricing and service negotiation environment by considering a dynamic and congestion-sensitive pricing component. Pricing network services dynamically based on the level of service, usage, and congestion allows a more competitive price to be offered, allows the network to be used more efficiently, and provides a natural and equitable incentive for applications to adapt their service requests according to network conditions. We also develop the demand behavior of adaptive users based on a physically reasonable user utility function. Simulation results show that a congestion-sensitive pricing policy coupled with user rate adaptation is able to control congestion and allows a service class to meet its performance assurances under large or bursty offered loads, even without explicit admission control. Users are able to maintain a stable expenditure, and allowing users to migrate between service classes in response to price increases further stabilizes the individual service prices. When admission control is enforced, congestion-sensitive pricing still provides an advantage in terms of a much lower connection blocking rate at high loads.     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

Multi‐step solution for QoS management in wireless mesh networks

Wireless mesh networks (WMNs) as community‐ and city‐wide type networks are required to extend their capability to offer real‐time multimedia services. While technologies exist to support quality of service (QoS) at node level, we propose here a network‐wide multi‐step solution to manage and offer QoS across a WMN. From a provider perspective, the provisioning and fulfillment of QoS‐based services fall under the realms of service management, network and traffic engineering functions. We describe the relevant functions required to design, implement and operate a WMN for providing a qualitative QoS to end‐users. Our proposed solution considers network planning aspects, including node placement, node clustering and frequency assignments, route discovery between ingress–egress points and appropriate QoS provisioning across the network. Route‐level QoS provisioning is defined as the process of allocating resources to the nodes along the identified routes to meet a priori known aggregated traffic demands in order to satisfy the QoS requirements for different types of application. Simulation and experimental tests are conducted to validate the correct behavior of processes/algorithms and to access the solution in achieving QoS for aggregate user traffic. Copyright © 2012 John Wiley & Sons, Ltd.     

A scalable model for interbandwidth broker resource reservation and provisioning

As the Internet evolves into global communication and commercial infrastructure, the need for quality-of-services (QoSs) in the Internet becomes more and more important. With a bandwidth broker (BB) support in each administrative domain, differentiated services (Diffserv) is seen as a key technology for achieving QoS guarantees in a scalable, efficient, and deployable manner in the Internet. In this paper, we present a scalable model for inter-BB resource reservation and provisioning. Our BB uses centralized network state maintenance and pipe-based intradomain resource management schemes that significantly reduce admission control time and minimize scalability problems present in prior research. For inter-BB communication, we design and implement a BB resource reservation and provisioning protocol (BBRP). BBRP performs destination-based aggregated resource reservation based on bilateral service level agreements (SLAs) between peer-BBs. BBRP significantly reduces the BB and border routers state scalability problem by maintaining reservation state based only on destination region. It minimizes inter-BB signaling scalability by using aggregated type resource reservation and provisioning. Both analytical and experimental results verify the BBRP achievements.     

Resource management for QoS support in cellular/WLAN interworking

To provide mobile users with seamless Internet access anywhere and anytime/ there is a strong demand for interworking mechanisms between cellular networks and wireless local area networks in the next-generation all-IP wireless networks. In this article we focus on resource management and call admission control for QoS support in cellular/WLAN interworking. In specific, a DiffServ interworking architecture with loose coupling is presented. Resource allocation in the interworking environment is investigated/ taking into account the network characteristics, vertical handoff, user mobility, and service types. An effective call admission control strategy with service differentiation is proposed for QoS provisioning and efficient resource utilization. Numerical results demonstrate the effectiveness of the proposed call admission control scheme.     

Achieving proportional DiffServ per‐hop behaviour with PLQF

We propose a novel scheme that can provide both delay and loss proportional DiffServ per‐hop behaviour. DiffServ is a framework that can provide different QoS levels to different groups of network users, and eliminate the shortcoming of the best‐effort delivery in today's Internet. The scheme employs probabilistic longest queue first (PLQF) as its forwarding and dropping mechanism. PLQF mainly reacts immediately to the queue‐length fluctuation of each service class, and then decides the probability for each QoS class, which determines the forwarding or dropping behaviour. We couple delay and loss differentiated services in one scheme. The proposed scheme is proven to achieve proportional differentiated services after detailed evaluations. Furthermore, the implementation cost of PLQF is much less than that of the previously proposed schemes, such as WTP and PLR. Copyright © 2003 John Wiley & Sons, Ltd.