Rate-controlled static-priority queueing

Zhang, H.; Ferrari, Domenico

doi:10.1109/infcom.1993.253355

Cited by 223 publications

(116 citation statements)

References 12 publications

Supporting

Mentioning

116

Contrasting

Order By: Relevance

“…Achieving desired rate for different applications running concurrently can also be achieved by rate-controlled-staticpriority as mentioned in [25]. However, this would require a very complicated arbiter at every tile in the system, amounting to a high overhead in terms of chip area.…”

Section: Arbiter Vs Resource Managermentioning

confidence: 99%

Analyzing composability of applications on MPSoC platforms

Kumar

Mesman

Theelen

et al. 2008

Journal of Systems Architecture

View full text Add to dashboard Cite

Section: Arbiter Vs Resource Managermentioning

confidence: 99%

Analyzing composability of applications on MPSoC platforms

Kumar

Mesman

Theelen

et al. 2008

Journal of Systems Architecture

View full text Add to dashboard Cite

“…Example of such schedulers is the Rate-controlled Static Priority (RCSP) scheduler [24]. This preserves the original traffic descriptors of each flow going through it and provides zero packet loss guarantees.…”

Section: Related Workmentioning

confidence: 99%

On the Location-Awareness of Bandwidth Allocation and Admission Control for the Support of Real-Time Traffic in Class-Based IP Networks

Georgoulas

Trimintzios

Pavlou

et al. 2006

Autonomic Management of Mobile Multimedia Services

View full text Add to dashboard Cite

Abstract. The support of real-time traffic in class-based IP networks requires reservation of resources, accompanied by admission control in order to guarantee that newly admitted real-time traffic flows do not cause any violation to the Quality of Service (QoS) perceived by the already established ones. In this paper we highlight certain issues with respect to bandwidth allocation and admission control for supporting real-time traffic in class-based IP networks. We investigate the implications of topological placement of both bandwidth allocation and admission control schemes. We show that their performance depends highly on the location of the employed procedures with respect to the end-users and the various network boundaries. We conclude that the strategies for applying these schemes should be location-aware, because their performance at different points in a class-based IP network can be different and can deviate from the expected performance. Through simulations we also provide a quantitative view of these deviations.

show abstract

“…Among the three, it is easiest to reduce the complexity of the scheduling algorithm as there is a natural tradeoff between the complexity and the flexibility of the scheduler [119]. In fact, a number of techniques have already been proposed to reduce scheduling complexity, including those requiring constant time complexity [98,120,125].…”

Section: Data Path Complexitymentioning

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

Rate-controlled static-priority queueing

Cited by 223 publications

References 12 publications

Analyzing composability of applications on MPSoC platforms

Analyzing composability of applications on MPSoC platforms

On the Location-Awareness of Bandwidth Allocation and Admission Control for the Support of Real-Time Traffic in Class-Based IP Networks

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

Contact Info

Product

Resources

About