I. Stoica and H. Zhang. Providing Guaranteed Services Without Per Flow Management. Proc. of ACM SIGCOMM, Sept. 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....routing by indicating the percentage of the traffic rate using link t . form. Other protocols reveal the same behavior although the mechanism is not implemented as an explicit LB NAC. Most bandwidth broker approaches [14, 6, 15] behave the same way and so do some stateless core approaches [16, 17, 18]. A drawback of most of theses approaches is that core routers need to hold AC states per flow. If network resilience is required, these states must be quickly restored in backup machines in case of partial network outage. This must be done before the traffic is rerouted, which entails a huge ....

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management, " Computer Communication Review, vol. 29, October 1999.

....the disadvantage that they have to keep a record for either individual reservations, for tunnel aggregates, or for funnel aggregates. Another approach to guarantee QoS are stateless reservation protocols. We only describe the basic architecture, for further details the reader is referred to [18, 19, 20]. A new reservation is only admitted if its request passes all AC test in the intermediate routers and the destination signals this back to the source. If such a test fails, the message is just discarded or marked to indicate a failure. Packets that are sent by the end systems under reservation ....

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management, " in "Computer Communication Review", vol. 29, October 1999.

....have been dedicated to this area resulting in a lot of prominent progresses. Generally speaking, an appropriate QoS architecture should be devised to resolve the tasks of providing QoS. While a few of such architectural solutions have been tentatively proposed, e.g. IntServ [7] DiffServ [9] DPS [17], there are still a lot of open issues regarding to their feasibility and scalability forming a major area of research topics. One of the most popular application over the internet that could be offered with guaranteed QoS is streaming, particularly voice application. For this real time ....

I. Stoica and H. Zhang. Providing Guaranteed Services without per Flow Management. In Proceedings of SIGCOMM, pages 81-- 94, 1999.

....I. INTRODUCTION HE differentiated service (DiffServ) Internet model is aimed at supporting service differentiation for aggregated traffic in a scalable manner. Many approaches have been proposed to realize this model. At one end of the spectrum, absolute differentiated services [16] 17] [19] seek to provide IntServ type end to end absolute performance guarantees without per flow state in the network core. The user receives an absolute service profile (e.g. guarantees on bandwidth, or end to end delay) For example, assuming that no dynamic routing occurs, the premium service can ....

....dxuan, bettati, zhao# cs.tamu.edu . will focus on a quality of service (QoS) architecture that provides end to end absolute differentiated services. Progress has been made to provide absolute differentiated services for real time applications in networks with rate based scheduling algorithms [19]. In this paper, we consider networks that use static priority schedulers. This type of scheduler is supported in many current routers, and our approaches can therefore be easily realized within existing networks. In order to provide service guarantees, an admission control mechanism has to be in ....

[Article contains additional citation context not shown here]

I. Stoica and H. Zhang, Providing Guaranteed Services Without Per Flow Management, Proceedings of ACM SIGCOMM, 1999.

....at the edge of the core network. In this case, the challenge becomes gaining e#ective control with coarse granularity control information resulting from the aggregation of flow states and control mechanisms. Most of current quantitative di#erentiated service results are based on packet scheduling [95, 96, 27, 71, 48] and admission control techniques [21, 17, 44, 59] In contrast, we present a dynamic bandwidth provisioning framework for quantitative service di#erentiation. Our scheme comprises a pair of node and core provisioning algorithms. The node provisioning algorithm prevents transient violations of ....

....constraints based on time scale and bandwidth granularity. Our Di#Serv provisioning work is the first to demonstrate quantitative service di#erentiation for tra#c aggregates. The state of the art at the time was either quantitative performance guarantee for individual flow (Stoica s CSFQ work [95, 96]) with the packet header carrying the control state or qualitative di#erentiation for tra#c aggregates (Dovrolis work of proportional Di# Serv [27] We realize this by dynamically changing the service weights of an o# the shelf per class weighted scheduler, with an extended virtual queue ....

[Article contains additional citation context not shown here]

I. Stoica and H. Zhang. Providing Guaranteed Services Without Per Flow Management. In Proc. ACM SIGCOMM, September 1999.

....in SODA 2001. School of Computer Science, Tel Aviv University, email: alx math.tau.ac.il. School of Computer Science, Tel Aviv University, email: mansour cs.tau.ac.il. Over the past few years Differentiated Services has attracted a great deal of research interest in the networking community [17], 5] 15] 12] Two basic paradigms were proposed: the Premium service [11] and the Assured service [4] The Premium service model provides to the user the same QoS guarantee as a dedicated line with a predefined bit rate. A Premium service traffic flow is shaped at the entry to the network ....

I. Stoica and H. Zhang, " Providing Guaranteed Services without Per Flow Management," Proceedings of SIGCOM 1999, pp. 81-94.

....and policy constraints are satis ed. The per ow state thus established is maintained by periodic refresh messages to support dynamic multicast group membership and automatic routing changes. It has been widely observed that there are signi cant scalability problems for RSVP [Berson98, Blake98, Stoica99, Baker00] Each network element must keep per ow state and process per ow reservation requests. Even a small reservation entails the transmission of a number of reservation protocol messages, as well as using computation and memory resources within network nodes. The aggregation of reservations ....

Ion Stoica and Hui Zhang. Providing Guaranteed Services Without Per Flow Management. Computer Communication Review, 29(4):81-94, October 1999. Proceedings of SIGCOMM September 1999. (p 19)

....the following operations that should be done at high speeds: packet classification, buffer management and packet scheduling. In this work we investigate the second aspect. Over the past few years Differentiated Services has attracted a great deal of research interest in the networking community [5,12,15,17]. Two basic paradigms were proposed: the Premium service [11] and the Assured service [4] The Premium service model provides to the user the same QoS guarantee as a dedicated line with a predefined bit rate. A Premium service traffic flow is shaped at the entry to the network and hard limited ....

I. Stoica, H. Zhang, Providing guaranteed services without per flow management, in: Proceedings of SIGCOM, 1999, pp. 81--94.

....per packet delay guarantees but is not scalable because of its requirement of per flow state maintenance at all routers. Diffserv is scalable because it does not maintain per flow states in core routers, however, it can not guarantee perpacket delays but only guarantees per flow bandwidth [4] In [5], a novel core stateless architecture was proposed which retained the guaranteed service semantics of Intserv while having scalability of Diffserv. Like any other approach to provide QoS guarantees, corestateless architecture also requires an admission control framework so that network resources ....

....are not suitable candidates to support core stateless guaranteed services. The non availability of such a solution is because the problem of performing distributed admission control is inherently hard. The following observation made in context of corestateless admission control by Stoica and Zhang [5] sums it up perfectly: Maintaining consistent and dynamic state in a distributed environment is itself challenging. Fundamentally, this is because the update operations assume a transaction semantic, which is difficult to implement in a distributed environment. In this paper, we propose a new ....

[Article contains additional citation context not shown here]

I. Stoica and H. Zhang, "Providing Guaranteed Services without Per- flow Management," in Proc. of ACM SIGCOMM, September 1999, pp. 81--94.

.... classes, e.g. 20] Example components of such networks include QoS schedulers [10] 18] diffserv style service level agreements [4] 8] 14] 21] 25] edge based traffic shaping and prioritizing devices, and novel architectures and algorithms for scalable QoS management [6] 7] 18] [19], 25] However, even as the network s infrastructure and services become increasingly sophisticated, the network s clients lack reciprocal tools for validation and monitoring of the network s QoS capabilities. Clients of Service Level Agreements (SLAs) will have monitoring requirements ranging ....

I. Stoica and H. Zhang. Providing guaranteed services without per flow management. In Proceedings of ACM SIGCOMM '99, Cambridge, MA, August 1999.

.... and application classes, e.g. 1] Example components of such networks include QoS schedulers [2] 3] diffserv style service level agreements [4] 5] 6] 7] edge based traffic shaping and prioritizing devices, and novel architectures and algorithms for scalable QoS management [8] 9] [10]. Similar resource management mechanisms, request scheduling policies, and algorithms are also developed for quality of service Web servers [11] 12] 13] 14] However, even as both the network s and Web server s infrastructure and services become increasingly sophisticated, the network s and ....

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management," Proc. ACM SIGCOMM '99, Aug. 1999.

....known as statistical multiplexing [8] In either case, QoS networks must resolve the unavoidable issue of overloading. This paper analyzes queueing policies under overloading using competitive analysis. In the past few years the networking community has had an increasing interest in QoS networks [6, 12, 13, 14]. A major new paradigm suggested is that of assured service [5] This service has a loose guarantee in which tra#c conforming to the specified pattern is much less likely to be dropped in the network. This approach leads to two types of packets in the system: those of high priority (conformed ....

I. Stoica and H. Zhang. Providing Guaranteed Services without Per Flow Management. Proceedings of SIGCOMM, 1999, pages 81--94.

....e.g. 2] 20] However, the utilization costs Fig. 10. Empirical and guaranteed service rates. Fig. 11. Comparison with baseline scheme. and signaling demands of such architectures remains an open question. Our approach is also related to recent advances in core stateless admission control [26] and scheduling [1] 25] in which edge routers perform per flow management but core routers do not. In particular, a technique termed Dynamic Packet State is introduced in [26] to provide guaranteed service in this scenario: by having ingress routers insert information into packet headers, ....

....remains an open question. Our approach is also related to recent advances in core stateless admission control [26] and scheduling [1] 25] in which edge routers perform per flow management but core routers do not. In particular, a technique termed Dynamic Packet State is introduced in [26] to provide guaranteed service in this scenario: by having ingress routers insert information into packet headers, deterministic QoS guarantees are provided over a scalable network core which does not maintain per flow state nor perform per flow packet scheduling, i.e. the core network is ....

[Article contains additional citation context not shown here]

I. Stoica and H. Zhang, "Providing guaranteed services without per flow management," in Proc. ACM SIGCOMM '99, Cambridge, MA, August 1999.

....guarantees on delay variations for classes of traffic. In essence, providing the EF service to a flow is equivalent to providing a virtual leased line to this flow, which leads to low resource utilization. Thus, it is envisioned that the EF service can only apply to a very limited number of flows [4]. More recently, some research studies have aimed at strengthening the service assurance provided by qualitative relative service models such as the AF service. For instance, the Proportional Differentiated Services model [5] defines a service model with no admission control where the ratios of ....

....1, an ideal service architecture, that is, a service architecture which can be deployed on a large network, should provide strong service guarantees with limited complexity. To this date, the most significant advance in devising such an ideal service is probably the SCORE CSFQ architecture [4]. SCORE tries to reconcile the strength of the IntServ guarantees with the simplicity of the DiffServ architecture, by moving the state information needed to provide IntServ like service guarantees from network routers to IP packets. Unfortunately, SCORE does not alleviate the need for packet ....

I. Stoica and H. Zhang, "Providing guaranteed services without per-flow management," in Proc. ACM SIGCOMM '99, Boston, MA, Aug. 1999, pp. 81--94.

....number of flows originating from different edges of the network. In order to alleviate this issue, over the past few years, several core stateless networks have been designed to provide end to end service guarantees without maintaining or using any per flow state at the core routers of a network [6, 7, 13, 16, 18, 20, 21, 25]; this property improves the scalability of the core routers to large number of flows and high speed links. Existing proposals for providing fairness in core stateless networks, however, only provide approximate fairness in the end to end throughput achieved by flows over large time scales [6, 7, ....

....in networks that are non work conserving, in which flows are allocated no more than their reserved rates at any time. In fact, the only known core stateless networks that guarantee deterministically, that flows would receive throughput in proportion to their reserved rates, are non work conserving [21]. Non work conserving networks shape the rate of incoming traffic to a maximum of the reserved rate for a flow; sources are not allowed to achieve larger transmission rates, even if network bandwidth is idle. This property results in high average delays [22] and limits the ability of the network ....

[Article contains additional citation context not shown here]

I. Stoica and H. Zhang. Providing Guaranteed Services Without Per Flow Management. In Proceedings of ACM SIGCOMM, September 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services without per flow management. In Proc. of ACM SIGCOMM, Sept. 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services without per flow management. In Proc. of ACM SIGCOMM, Sept. 1999.

No context found.

I. Stoica and H. Zhang, "Providing guaranteed services without per flow management," in SIGCOMM Symposium on Communications Architectures and Protocols, Boston, MA, August 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services Without Per Flow Management. Proc. of ACM SIGCOMM, Sept. 1999.

No context found.

I. Stoica and H. Zhang. Providing guaranteed services without per flow management. In Proc. of SIGCOMM'99, 1999.

No context found.

I. Stoica and Hui Zhang. Providing Guaranteed Services Without Per Flow Management. In ACM SIGCOMM'99, October 1999.

No context found.

I. Stoica and Hui Zhang. Providing Guaranteed Services Without Per Flow Management. In ACM SIGCOMM'99, October 1999.

No context found.

I. Stoica and H. Zhang, Providing Guaranteed Services Without Per Flow Management, in ACM SIGCOMM'99, Oct. 1999.

No context found.

I. Stoica and Hui Zhang. Providing Guaranteed Services Without Per Flow Management. In ACM SIGCOMM'99, October 1999.

No context found.

I. Stoica and Hui Zhang. Providing Guaranteed Services Without Per Flow Management. In ACM SIGCOMM'99, October 1999.

No context found.

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management",inACM SIGCOMM'99, Oct. 1999.

No context found.

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management," in ACM SIGCOMM'99, Oct. 1999.

No context found.

I. Stoica and H. Zhang, "Providing guaranteed services without per flow management," Proc. ACM SIGCOM'99, pp. 81-94.

No context found.

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management," Proceedings of ACM SIGCOMM'99, Sept. 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services Without Per Flow Management. In Proceedings of ACM SIGCOMM, September 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services Without Per-Flow Management. Technical Report CMU-CS-99-133, Carnegie-Mellon Univ., Pittsburgh, USA, May 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services without Per Flow Management. In Proceedings of ACM SIGCOMM, 1999, pages 81--94.

No context found.

I. Stoica, H. Zhang, Providing Guaranteed Services Without Per Flow Management, SIGCOMM'99, Boston, Oct. 1999

No context found.

I. Stoica and H. Zhang, Providing Guaranteed Services without per Flow Management, in Proceedings of ACM SIGCOMM'99, Cambridge, MA, August 1999.

No context found.

Ion Stoica and Hui Zhang. Providing guaranteed services without per flow management. In Proceedings of ACM SIGCOMM'99, pages 81--94, 1999.

No context found.

I.Stoika and H.Zhang, "Providing Guaranteed Services Without Per Flow Management," in Proceedings ACM SIGCOMM, Sept. 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Service Without Per Flow Management. In ACM SIGCOMM Computer Communication Review , Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, Aug 1999.

No context found.

I. Stoica and H. Zhang. Providing guaranteed services without per flow management. In Proceedings of the 1999.

No context found.

I. Stoica, H. Zhang, "Providing Guaranteed Services Without Per Flow Management" Proceedings of ACM SIGCOMM, 1999.

No context found.

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management," in Proc. Annual Conference of the ACM Special Interest Group on Data Commun. (SIGCOMM), September 1999.

No context found.

I. Stoica and H. Zhang. Providing guaranteed services without per-flow management. In Proceedings of ACM SIGCOMM '99, pages 81--94, Boston, MA, August 1999.

No context found.

I. Stoica and H. Zhang. Providing guaranteed services without per-flow management. Technical Report CMU-CS-99-133, Carnegie Mellon University, May 1999.

No context found.

Ian Stoica and Hui Zhang. Providing Guaranteed Services Without Per-Flow Management. Technical Report CMU-CS-99-133, Carnegie-Mellon University, Pittsburgh, USA, May 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services Without Per-Flow Management. Technical Report CMU-CS-99-133, Carnegie-Mellon Univ., Pittsburgh, USA, May 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services Without Per Flow Management. In Proceedings of ACM SIGCOMM'99, Cambridge, MA, August 1999.

No context found.

I. Stoica and H. Zhang. Providing guaranteed services without per flow management. In Proceedings of ACM SIGCOMM '99, Cambridge, MA, August 1999.

No context found.

I. Stoica and H. Zhang. Providing Guaranteed Services without per Flow Management. In Proceedings of SIGCOMM, pages 81--94, 1999.

No context found.

I. Stoica and H. Zhang. Providing guaranteed services without per flow management. In Proc. ACM Sigcomm, pages 81--94, Sept. 1999.

No context found.

I. Stoica and H. Zhang. Providing guaranteed services without per flow management. In Proceedings of ACM SIGCOMM '99, Cambridge, MA, August 1999.

No context found.

I. Stoica and H. Zhang, "Providing Guaranteed Services Without Per Flow Management," ACM SIGCOMM'99, Boston, MA, Sept 1999.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC