Specification of the Controlled-Load Network Element Service

Wroclawski, John

doi:10.17487/rfc2211

Cited by 468 publications

(177 citation statements)

References 5 publications

Supporting

Mentioning

165

Contrasting

Unclassified

Order By: Relevance

“…Examples of such services include the controlled-load service [16] in the IETF's Integrated Services (IntServ) framework, and services in IETF's Differentiated Services (DiffServ) framework that provide probabilistic guarantees and use the token bucket for specifying the maximum amount of traffic that is allowed to enter the network [17].…”

Section: Resultsmentioning

confidence: 99%

Simple tariffs based on price multipliers for ATM VBR services

Courcoubetis

Siris

Stamoulis

2003

Eur. Trans. Telecomm.

View full text Add to dashboard Cite

Abstract. We present an approach for constructing simple time-based tariffs for Variable Bit Rate (VBR) connections from Constant Bit Rate (CBR) prices, using price multipliers that depend on the traffic parameters of the VBR connection and reflect the resource usage of VBR connections relative to CBR connections. Our approach employs an effective bandwidth bound as a proxy for the maximum amount of traffic that conforms to the connection's traffic contract, and thus for the maximum resource usage. We compare the price multipliers computed using our approach with the multipliers published by an actual ATM service provider, and with those computed using a proxy for resource usage that is based on ATM Forum's Generic CAC algorithm. Although our approach is presented in the context of ATM VBR services, it can be applied for creating tariffs for Service Level Agreements (SLAs) where the maximum amount of conforming traffic is given by leaky (or token) bucket constraints.

show abstract

Section: Resultsmentioning

confidence: 99%

Simple tariffs based on price multipliers for ATM VBR services

Courcoubetis

Siris

Stamoulis

2003

Eur. Trans. Telecomm.

View full text Add to dashboard Cite

show abstract

“…The stronger the soft real-time application requirements on delay and jitter become for a virtual link, the shorter is the allowable network distance of the transport resource, which leaves either the site-local network or the use of leased lines as suitable transport resource. Since there exist transport network resources with classification, reservation and other technology-individual mechanisms to enforce QoS of traffic, an ISONI transport network adaptation layer abstracts from transport network technology-individual QoS mechanism like Diffserv [4], Intserv [28] [29] and MPLS [25] (see Fig.1). …”

Section: Isolation Of Networkingmentioning

confidence: 99%

Virtualised e-Learning on the IRMOS real-time Cloud

Cucinotta

Checconi

Kousiouris

et al. 2011

SOCA

View full text Add to dashboard Cite

Providing proper timeliness guarantees to distributed soft real-time applications in a virtualised infrastructure involves the careful use of various techniques at different levels, ranging from real-time scheduling mechanisms at the virtual-machine hypervisor level and QoS-aware protocols at the network level, to proper design methodologies and tools for stochastic modelling and runtime provisioning of the applications. This paper describes the way these techniques were combined to provide strong quality of service guarantees to interactive soft real-time applications in the Cloud Computing infrastructure that has been developed in the con-

show abstract

“…As defined by Wroclawski [121], the Controlled-Load service "tightly approximates the behavior visible to applications receiving best effort service *under unloaded conditions* from the same series of network elements". More precisely, the Controlled-Load service ensures that (1) the packet loss is not significantly larger than the basic error rate of the transmission medium, and (2) the end-to-end delay experienced by a very large percentage of packets does not greatly exceed the end-to-end propagation delay.…”

Section: Controlled-load Servicementioning

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

Specification of the Controlled-Load Network Element Service

Cited by 468 publications

References 5 publications

Simple tariffs based on price multipliers for ATM VBR services

Simple tariffs based on price multipliers for ATM VBR services

Virtualised e-Learning on the IRMOS real-time Cloud

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

Contact Info

Product

Resources

About