Advance reservations for predictive service

Degermark, Mikael; Köhler, Torsten; Pink, Stephen; Schelén, Olov

doi:10.1007/bfb0019247

Cited by 47 publications

(24 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Incidentally, the work reported in this paper has been extended in [DKPS95] to support advance reservations. The authors of [DKPS95] have also replicated some of our results on their independently developed network simulator.…”

mentioning

confidence: 91%

A measurement-based admission control algorithm for integrated services packet networks

Jamin

Danzig

Shenker

et al. 1995

SIGCOMM Comput. Commun. Rev.

100

147

View full text Add to dashboard Cite

Abstract-Many designs for integrated services networks offer a bounded delay packet delivery service to support real-time applications. To provide bounded delay service, networks must use admission control to regulate their load. Previous work on admission control mainly focused on algorithms that compute the worst case theoretical queueing delay to guarantee an absolute delay bound for all packets. In this paper we describe a measurement-based admission control algorithm for predictive service, which allows occasional delay violations. We have tested our algorithm through simulations on a wide variety of network topologies and driven with various source models, including some that exhibit longrange dependence, both in themselves and in their aggregation. Our simulation results suggest that measurement-based approach combined with the relaxed service commitment of predictive service enables us to achieve a high level of network utilization while still reliably meeting delay bound. I. BOUNDED DELAY SERVICES AND PREDICTIVE SERVICEThere have been many proposals for supporting real-time applications in packet networks by proSugih Jamin was supported in part by the Uniforum Research Award and by the Office of Naval Research Laboratory under contract N00173-94-P-1205. At USC, this research is supported by AFOSR award number F49620-93-1-0082, by the NSF small-scale infrastructure grant, award number CDA-9216321, and by equipment loan from Sun Microsystems, Inc. viding some form of bounded delay packet delivery service. When a flow requests real-time service, it must characterize its traffic so that the network can make its admission control decision. Typically, sources are described by either peak and average rates [FV90] or a filter like a token bucket [OON88]; these descriptions provide upper bounds on the traffic that can be generated by the source. The traditional real-time service provides a hard or absolute bound on the delay of every packet; in [FV90], [CSZ92], this service model is called guaranteed service. Admission control algorithms for guaranteed service use the a priori characterizations of sources to calculate the worst-case behavior of all the existing flows in addition to the incoming one. Network utilization under this model is usually acceptable when flows are smooth; when flows are bursty, however, guaranteed service inevitably results in low utilization [ZF94].Higher network utilization can be achieved by weakening the reliability of the delay bound. For instance, the probabilistic service described in [ZK94] does not provide for the worst-case scenario, instead it guarantees a bound on the rate of lost/late packets based on statistical characterization of traffic. In this approach, each flow is allotted an effective bandwidth that is larger than its average rate but less than its peak rate. In most cases the equivalent bandwidth is computed based on a statistical model [Hui88], [SS91] or on a fluid flow approximation [GAN91], [Kel91]) of traffic. 1 If one can precisely characterize traffic a prior...

show abstract

mentioning

confidence: 91%

A measurement-based admission control algorithm for integrated services packet networks

Jamin

Danzig

Shenker

et al. 1995

SIGCOMM Comput. Commun. Rev.

100

147

View full text Add to dashboard Cite

show abstract

“…The probability of preemption can be controlled by either monitoring immediate requests when admitting advance reservations, or vice versa, by monitoring advance reservations when admitting immediate requests. When advance reservation requests are made far in advance, the information obtained from monitoring present traffic will not be useful for advance admission control (Degermark, Kohler, Pink & Schelen 1995). Most of the active flows would have finished at the crucial time anyway.…”

Section: Resource Sharing Between Immediate and Advance Reservationsmentioning

confidence: 99%

Sharing Resources through Advance Reservation Agents

Schelén

Pink

1997

Building QoS Into Distributed Systems

Self Cite

View full text Add to dashboard Cite

We propose an architecture where clients can make advance reservations through agents responsible for advance admission control. The agents allocate resources in the routers just before they are needed for packet forwarding. In this paper we show that network resources can be shared between immediate and advance reservations without being pre-partitioned. The admission control schemes for immediate and advance reservations still operate with little interaction.Admission control decisions for immediate reservations use information about resources to be allocated for advance reservations in the near future. An important parameter in the admission control algorithm is the so called lookahead time, i.e., the point at which we actually start making resources available for approaching advance reservations by rejecting immediate requests. In our model, preemption of immediate reservations is made in cases where the admission control cannot make resources available through rejection of immediate requests. The risk of preemption can be varied by changing the lookahead time when making immediate admission control.We explore, with simulations, the effects of providing advance reservations according to this model. The results show the cost in terms of resource utilization, rejection probability and preemption probability.

show abstract

“…The only assumption we make about the network is that it can provide network resource guarantees based either on some rate-based or real-time channel approach [2,24]. We also assume that the network provides some mechanism for in-advance reservations of bandwidth [5,10,23]. The clients consist of either desktop computers with support for digital video or a set-top-box devoted solely for viewing compressed video.…”

Section: Video Serversmentioning

confidence: 99%

“…For stored video-on-demand services, the ability to provide reservations of bandwidth in advance can make the job of resource allocation easier [16]. The work on resource reservation schemes have identified two key components that are necessary for resource reservations: the bandwidth requirement (level) and the duration that the bandwidth requirement is needed [10,5,23]. Without providing these, the authors argue that resource reservations in-advance then becomes a difficult task.…”

Section: A Video-on-demand Resource Reservation Schemementioning

confidence: 99%

Providing VCR functionality in a constant quality video-on-demand transportation service

Feng

Jahanian

Sechrest

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems

View full text Add to dashboard Cite

The use of bandwidth smoothing techniques for the delivery of prerecorded compressed video has been shown to be an effective technique in reducing the network bandwidth requirements needed to play back video. Any fixed allocation scheme can affect the ability to allow for VCR functions. In this paper, we examine the impacts that bandwidth smoothing techniques have on the delivery of stored video. We introduce the notion of VCR-window, which allows users to have full VCR functionality in a limited window while not requiring increases in the bandwidth reservations. In addition, we introduce a resource reservation scheme that can be used with the VCR-window for the delivery of stored video. To test the applicability of the VCR-window in video-on-demand systems, we have digitized 15 full-length movies for experimental data. Our results indicate that we can provide time-limited VCR functionality while retaining a fairly high network utilization.

show abstract

Advance reservations for predictive service

Cited by 47 publications

References 8 publications

A measurement-based admission control algorithm for integrated services packet networks

A measurement-based admission control algorithm for integrated services packet networks

Sharing Resources through Advance Reservation Agents

Providing VCR functionality in a constant quality video-on-demand transportation service

Contact Info

Product

Resources

About