Virtual time reference system: a unifying scheduling framework for scalable support of guaranteed services

Zhang, Z.-L.; Duan, Zhenhai; Hou, Y. Thomas

doi:10.1109/49.898750

Cited by 48 publications

(47 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The virtual time reference system does not mandate any specific scheduling mechanisms to be implemented in a network domain as long as their abilities to provide delay guarantees can be characterized using the notion of error term. In fact, in [53] it is shown that almost all known scheduling algorithms can thus be characterized, be they core stateless or stateful. In addition, the virtual time reference system leads to the design of a set of new core stateless scheduling algorithms (both rate-based and delay-based).…”

Section: End-to-end Delay Bounds and Qos Abstraction Of Datamentioning

confidence: 99%

“…In [53] it is shown that using the reference/update rule in (21) the virtual spacing and reality check properties of virtual time stamps are satisfied at every router.…”

Section: A Dynamic Packet State and Virtual Time Reference Systemmentioning

confidence: 99%

“…As a result, using the dynamic packet state approach, per-flow end-to-end QoS guarantees similar to those provided by IntServ can be supported without perflow management at core routers. In section III-A we will provide an overview of the virtual time reference systema unifying scheduling framework to provide scalable support for guaranteed services based on the dynamic packet state approach [53].…”

Section: Architectures For Scalable Qos Supportmentioning

confidence: 99%

“…In [55] Stoica and Zhang demonstrated that a core stateless version of Jitter Virtual Clock (Jitter-VC) can be implemented using the dynamic packet state technique to attain the same end-to-end delay bound without per-flow management. Their scheme was generalized by Zhang et al in [53], where using the dynamic packet state approach, a general core stateless framework -the virtual time reference system (VTRS) -was developed to provide scalable support for guaranteed services. The key construct in the virtual time reference system is the notion of packet virtual time stamps, which are referenced and updated as packets traverse each core router.…”

Section: A Dynamic Packet State and Virtual Time Reference Systemmentioning

confidence: 99%

See 3 more Smart Citations

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: End-to-end Delay Bounds and Qos Abstraction Of Datamentioning

confidence: 99%

“…In [53] it is shown that using the reference/update rule in (21) the virtual spacing and reality check properties of virtual time stamps are satisfied at every router.…”

Section: A Dynamic Packet State and Virtual Time Reference Systemmentioning

confidence: 99%

Section: Architectures For Scalable Qos Supportmentioning

confidence: 99%

Section: A Dynamic Packet State and Virtual Time Reference Systemmentioning

confidence: 99%

See 2 more Smart Citations

Theories and models for Internet quality of service

Firoiu¹,

et al. 2002

View full text Add to dashboard Cite

show abstract

“…Since we have published the first papers [101,104], several new and interesting results have been reported. They include both extensions and improvements to the original CSFQ algorithm [18,25,111], and generalizations of our solution to provide guaranteed services [129,130]. In addition, DPS-like techniques have been used to develop new types of applications such as IP traceback [91].…”

Section: Contributionsmentioning

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

Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

Stamoulis

Giannakis

Information Technology: Transmission, Processing and Storage

View full text Add to dashboard Cite

Virtual time reference system: a unifying scheduling framework for scalable support of guaranteed services

Cited by 48 publications

References 22 publications

Theories and models for Internet quality of service

Theories and models for Internet quality of service

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

Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

Contact Info

Product

Resources

About