Quality of service guarantees in virtual circuit switched networks

Cruz, R.L.

doi:10.1109/49.400660

Cited by 375 publications

(207 citation statements)

References 20 publications

(13 reference statements)

Supporting

Mentioning

195

Contrasting

Unclassified

Order By: Relevance

“…In addition, it has been shown that a network of Jitter-VC servers can provide the same delay guarantees as a network of Virtual Clock servers [28,42]. Therefore, a network of Jitter-VC servers can provide the same guaranteed service as a network of WFQ servers.…”

Section: Pimentioning

confidence: 89%

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

Section: Pimentioning

confidence: 89%

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

show abstract

“…The most sound and practically relevant QoS model in the networking community was proposed by R. Cruz [7]. The main conceptual results in RTOS literature was presented by Rajkumar et al [16].…”

Section: Related Workmentioning

confidence: 99%

Power minimization in QoS sensitive systems

Wong

Potkonjak

2004

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

Abstract-The majority of modern multimedia and mobile systems have two common denominators: quality-of-service (QoS) requirements, such as latency and synchronization, and strict energy constraints. However, until now no synthesis techniques have been proposed for the design and efficient use of such systems. We have two main objectives: conceptual and synthesis. The conceptual objective is to develop a generic practical technique for the automatic development of online adaptive algorithms from efficient off-line algorithms using statistical techniques.The synthesis objective is to introduce the first design technique for QoS low-power synthesis. We introduce a system of provablyoptimal techniques that minimize energy consumption of streamoriented applications under two main QoS metrics: latency and synchronization. Specifically, we study how multiple voltages can be used to simultaneously satisfy hardware constraints and minimize power consumption while preserving the requested level of QoS. The purpose of the off-line algorithm is threefold. First, it is used as input to statistical software which is used to identify important and relevant parameters of the processes. Second, the algorithm provides buffer occupancy rate indicators. Lastly, it provides a way to combine buffer occupancy and QoS metrics to form a fast and efficient online algorithm. The effectiveness of the algorithms is demonstrated on a number of standard multimedia benchmarks.Index Terms-Low power, quality of service (QoS), synchronization.

show abstract

“…However, in the packet-switching, integrated services models, bounds on the end-to-end performance need to be studied in a networking environment with traffic dynamics, interactions and burstiness far more complex than in the previous case. In this work, we use the deterministic version of the service curves method [2] and particularly Network Calculus (NC) [1], its Min-Plus algebra formulation.…”

Section: Introductionmentioning

confidence: 99%

Equation-Based Dynamic Shaping Algorithm

Elbiaze¹,

Chahed²,

Hebuterne³

et al. 2001

Management of Multimedia on the Internet

View full text Add to dashboard Cite

Abstract. The focus of this paper is the traffic shaping at the access of an network node. We propose a novel algorithm that dynamically shapes the incoming traffic, based on service curves equations, in order to meet the QoS constraints in terms of buffer size or delay. We first estimate arrival parameters within various time intervals in order to make the incoming traffic fit into a token bucket traffic specification (Tspec) format. We then derive the shaping parameters based on deterministic service curves. Those shaping parameters vary dynamically according to the Tspec of every time window.

show abstract

Quality of service guarantees in virtual circuit switched networks

Cited by 375 publications

References 20 publications

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

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

Power minimization in QoS sensitive systems

Equation-Based Dynamic Shaping Algorithm

Contact Info

Product

Resources

About