On a Class of Time Varying Shapers with Application to the Renegotiable Variable Bit Rate Service

A shaper is a system that stores incoming bits in a buffer and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper is time invariant if the traffic constraint is defined by a fixed arrival curv

The Renegotiable Variable Bit Rate Service

A shaper is a system that stores incoming bits in a buffer and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper is time invariant if the traffic constraint is defined by a fixed arrival curve, it is time varying if the condition on the output is given by a time varying traffic contract. This occurs, for example, with renegotiable variable bit rate (RVBR) services. We focus on the class of time varying shapers called time varying leaky bucket shapers, such shapers are defined by a fixed numbers of leaky buckets, whose parameters (rate and bucket size) are changed at specific transition moments. We assume that the bucket levels are kept unchanged at those transition moments (``no reset`` assumption). Our main finding is an input-output characterisation for this class of time varying shapers. Then we apply it to the tradeoff in optimising the RVBR service, assuming that a perfect prediction of future traffic can be made. We provide an algorithm that solves the problem of finding, at any renegotiation, the parameters for a RVBR service when the knowledge of the input traffic is limited to the next interval (local optimisation problem). We illustrate the impact of the ``no-reset`` assumption by analyzing on some examples the losses that occur when the source chooses the opposite approach, namely, the ``reset`` approach

The Renegotiable Variable Bit Rate Service: Characterisation and prototyping

he traffic generated by multimedia applications presents a high degree of burstiness that can hardly be described by a static set of traffic parameters. We present a dynamic QoS negotiation scheme applied to a prototype application that provides temporized data transfer. The dynamic and efficient usage of the resources can be reached with the introduction of the renegotiable variable bit rate (RVBR) service, which is based on the renegotiation of the traffic specification. We describe and discuss the RVBR service and how it applies to resource reservation for Internet traffic with RSVP. We propose an architecture design that we evaluate by accomplishing a prototype implementation, whose performance is measured with temporized file transfer using real MPEG2 video traces. The results we obtained indicate that renegotiation is an efficient mechanism for accommodating traffic fluctuations over the burst time-scale and that the RVBR service can be easily implemented in real applications, using available technology

An example of dynamic QoS negotiation

The traffic generated by multimedia applications presents a high degree of burstiness that can be hardly described by a static set of traffic parameters. The following paper presents a dynamic QoS negotiation scheme applied to a video streaming application. In applications that uses RSVP, the dynamic and efficient usage of the resources can be reached with the introduction of the renegotiable variable bit rate (RVBR) service, which is based on the renegotiation of the traffic specification. In this paper we describe and discuss the RVBR service and how it applies to resource reservation for Internet traffic with RSVP. For that we propose an architecture design that we evaluate by accomplishing a prototype implementation, whose performance are measured with real MPEG2 video traces. The results we obtained indicate that renegotiation is an efficient mechanism to accommodate traffic fluctuations over the burst time-scale, and that RVBR service can be easily implemented, to this aim, in real applications, using available technology

Renegotiable VBR service

In this work we address the problem of supporting the QoS requirements for applications while efficiently allocating the network resources. We analyse this problem at the source node where the traffic profile is negotiated with the network and the traffic is shaped according to the contract. We advocate VBR renegotiation as an efficient mechanism to accommodate traffic fluctuations over the burst time-scale. This is in line with the Integrated Service of the IETF with the Resource reSerVation Protocol (RSVP), where the negotiated contract may be modified periodically. In this thesis, we analyse the fundamental elements needed for solving the VBR renegotiation. A source periodically estimates the needs based on: (1) its future traffic, (2) cost objective, (3) information from the past. The issues of this estimation are twofold: future traffic prediction given a prediction, the optimal change. In the case of a CBR specification the optimisation problem is trivial. But with a VBR specification this problem is complex because of the multidimensionality of the VBR traffic descriptor and the non zero condition of the system at the times where the parameter set is changed. We, therefore, focus on the problem of finding the optimal change for sources with pre-recorded or classified traffic. The prediction of the future traffic is out of the scope of this thesis. Traditional existing models are not suitable for modelling this dynamic situation because they do not take into account the non-zero conditions at the transient moments. To address the shortfalls of the traditional approaches, a new class of shapers, the time varying leaky bucket shaper class, has been introduced and characterised by network calculus. To our knowledge, this is the first model that takes into account non-zero conditions at the transient time. This innovative result forms the basis of Renegotiable VBR Service (RVBR). The application of our RVBR mathematical model to the initial problem of supporting the applications' QoS requirements while efficiently allocating the network resources results in simple, efficient algorithms. Through simulation, we first compare RVBR service versus VBR service and versus renegotiable CBR service. We show that RVBR service provides significant advantages in terms of resource costs and resource utilisation. Then, we illustrate that when the service assumes zero conditions at the transient time, the source could potentially experience losses in the case of policing because of the mismatch between the assumed bucket and buffer level and the policed bucket and buffer level. As an example of RVBR service usage, we describe the simulation of RVBR service in a scenario where a sender transmits a MPEG2 video over a network using RSVP reservation protocol with Controlled-Load service. We also describe the implementation design of a Video on Demand application, which is the first example of an RVBR-enabled application. The simulation and experimentation results lead us to believe that RVBR service provides an adequate service (in terms of QoS guaranteed and of efficient resource allocation) to sources with pre-recorded or classified traffic

An example of traffic-accomodating application

The traffic generated by multimedia applications presents a great amount of burstiness, which can hardly be described by a static set of traffic parameters. The dynamic and efficient usage of the resources is one of the fundamental aspects of multimedia networks: the traffic specification should first reflect the real traffic demand, but optimise, at the same time, the resources requested. This paper presents an example of application able to accommodate its traffic to managing QoS dynamically. The paper is focused on the technique used to implement the Dynamic Reallocation Scheme (RVBR) taking into account problems deriving from delay during the reallocation phase

A Model for Dynamic QoS Negotiation Applied to an MPEG4 Applications

The traffic generated by multimedia applications presents a great amount of burstiness, which can hardly be described by a static set of traffic parameters. The dynamic and efficient usage of the resources is one of the fundamental aspects of multimedia networks: the traffic specification should first reflect the real traffic demand, but optimise, at the same time, the resources requested. This chapter presents: a model for dynamically renegotiating the traffic specification (RVBR), how this can be integrated with the traffic reservation mechanism RSVP, and an example of application able to accommodate its traffic to managing QoS dynamically. The remaining of this chapter is focused on the technique used to implement RVBR) taking into account problems deriving from delay during the renegotiation phase and on the performance of the application with MPEG4 traffic

Theories and Models for Internet Quality of Service

We survey recent advances in theories and models for Internet Quality of Service (QoS). We start with the theory of network calculus, which lays the foundation for support of deterministic performance guarantees in networks, and illustrate its applications to integrated services, differentiated services, and streaming media playback delays. We also present mechanisms and architecture for scalable support of guaranteed services in the Internet, based on the concept of a stateless core. Methods for scalable control operations are also briefly discussed. We then turn our attention to statistical performance guarantees, and describe several new probabilistic results that can be used for a statistical dimensioning of differentiated services. Lastly, we review recent proposals and results in supporting performance guarantees in a best effort context. These include models for elastic throughput guarantees based on TCP performance modeling, techniques for some quality of service differentiation without access control, and methods that allow an application to control the performance it receives, in the absence of network support

Advances in Internet Quality of Service

We describe recent advances in theories and architecture that support performance guarantees needed for quality of service networks. We start with deterministic computations and give applications to integrated services, differentiated services, and playback delays. We review the methods used for obtaining a scalable integrated services support, based on the concept of a stateless core. New probabilistic results that can be used for a statistical dimensioning of differentiated services are explained; some are based on classical queuing theory, while others capitalize on the deterministic results. Then we discuss performance guarantees in a best effort context; we review: methods to provide some quality of service in a pure best effort environment; methods to provide some quality of service differentiation without access control, and methods that allow an application to control the performance it receives, in the absence of network support