Scheduling for quality of service guarantees via service curves

Sariowan, Hanrijanto; Cruz, R.L.; Polyzos, George C.

doi:10.1109/icccn.1995.540168

Cited by 85 publications

(60 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The concepts of service and arrival curves have been used by Cruz and Sariowan [31], [32], Georgiadis, Guérin, Peris and Rajan [12] to design schedulers that optimize the combination of delay guarantees, buffer and bit rate requirements, and go beyond the initial design ideas of Kalmanek, Kanakia and Restrick [10] and H. Zhang and Ferrari [11]. Some of these schedulers are designed to have have service curves that are not ratelatency, therefore, their properties are not well exploited within the IntServ framework.…”

Section: B Intserv and Service Curvesmentioning

confidence: 99%

Theories and models for Internet quality of service

Firoiu¹,

et al. 2002

View full text Add to dashboard Cite

Abstract-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.

show abstract

Section: B Intserv and Service Curvesmentioning

confidence: 99%

Theories and models for Internet quality of service

Firoiu¹,

et al. 2002

View full text Add to dashboard Cite

show abstract

“…The idea of modeling schedulers with service constraint functions originated in [22], [23], [24], [25], [28], [29], and [45]. Workload and service constraint functions have been used for the direct schedulability test in [45], [46], [47], [48], [49], [50], [51], [52], [53] among many others, but none of them are used for the utilization-based schedulability test.…”

Section: Related Workmentioning

confidence: 99%

A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems

Liu

Zhao

2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-In real-time systems, utilization-based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The test is extremely simple, since it only needs to compare the utilization of the tasks with a predetermined bound. As such, utilization-based schedulability tests are suitable for online use. The challenge is how to derive a reasonable utilization bound for a given system. Most existing results are obtained on a case-by-case basis because of their analytical complexity. In this paper, we develop a flexible and unified representation framework of real-time systems (i.e., tasks and schedulers) based on network calculus techniques. Our representation framework, together with the proposed bound derivation method, leads to a general bound result, which is applicable to a large family of real-time systems.

show abstract

“…This significantly complicates both the data and the control path implementations. For example, admission control requires checking whether a two-piece linear function representing the new reservation ever exceeds an n-piece linear function representing the available link resources (capacity), where, in the worst case, n represents the number of flows [90]. Thus, storing the representation of the available capacity requires an amount of state proportional to the number of flows, which is unacceptable for a stateless solution.…”

Section: Decoupling Bandwidth and Delay Allocationsmentioning

confidence: 99%

“…In the stateful world, several solutions have been proposed to address this problem [90,106,124]. A future direction would be to emulate these solutions in the SCORE/DPS framework.…”

Section: Decoupling Bandwidth and Delay Allocationsmentioning

confidence: 99%

Stateless Core: A Scalable Approach for Quality of Service in the Internet

Stoica¹,

Zhang²

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Today's Internet provides one simple service: best effort datagram delivery. This minimalist service allows the Internet to be stateless, that is, routers do not need to maintain any fine grained information about traffic. As a result of this stateless architecture, the Internet is both highly scalable and robust. However, as the Internet evolves into a global commercial infrastructure that is expected to support a plethora of new applications such as IP telephony, interactive TV, and e-commerce, the existing best effort service will no longer be sufficient. In consequence, there is an urgent need to provide more powerful services such as guaranteed services, differentiated services, and flow protection.Over the past decade, there has been intense research toward achieving this goal. Two classes of solutions have been proposed: those maintaining the stateless property of the original Internet (e.g., Differentiated Services), and those requiring a new stateful architecture (e.g., Integrated Services). While stateful solutions can provide more powerful and flexible services such as per flow bandwidth and delay guarantees, they are less scalable than stateless solutions. In particular, stateful solutions require each router to maintain and manage per flow state on the control path, and to perform per flow classification, scheduling, and buffer management on the data path. Since today's routers can handle millions of active flows, it is difficult, if not impossible, to implement such solutions in a scalable fashion. On the other hand, while stateless solutions are much more scalable, they offer weaker services.The key contribution of this dissertation is to bridge this long-standing gap between stateless and stateful solutions in packet switched networks such as the Internet. Our thesis is that "it is actually possible to provide services as powerful and as flexible as the ones implemented by a stateful network using a stateless network". To prove this thesis, we propose a novel technique called Dynamic Packet State (DPS). The key idea behind DPS is that, instead of having routers maintain per flow state, packets carry the state. In this way, routers are still able to process packets on a per flow basis, despite the fact that they do not maintain any per flow state. Based on DPS, we develop a network architecture called Stateless Core (SCORE) in which core routers do not maintain any per flow state. Yet, using DPS to coordinate actions of edge and core routers along the path traversed by a flow allows us to design distributed algorithms that emulate the behavior of a broad class of stateful networks in SCORE networks.In this dissertation we describe complete solutions including architectures, algorithms and implementations which address three of the most important problems in today's Internet: providing guaranteed services, differentiated services, and flow protection. Compared to existing solutions, our solutions eliminate the most complex operations on both the data and control paths in the network core, i...

show abstract

Scheduling for quality of service guarantees via service curves

Cited by 85 publications

References 18 publications

Theories and models for Internet quality of service

Theories and models for Internet quality of service

A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems

Stateless Core: A Scalable Approach for Quality of Service in the Internet

Contact Info

Product

Resources

About