J. Kaur and H. M. Vin. Core-stateless guaranteed rate scheduling algorithms. In Proceedings of INFOCOM 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....reserves the required amount of bandwidth on all links along the path. The admitted flow is pinned to the assigned path. This mechanism of admission control and bandwidth allocation would provide per flow guarantees when used in conjunction with different core stateless scheduling mechanisms [5] [10], 11] The key to any admission control mechanism to support guaranteed services is to have the zero false positive property. We prove that this property holds in our architecture. Other measures to test the performance of our architecture are: 1) Response Time: The time it takes for the ....

J. Kaur and H. Vin, "Core-Stateless Guaranteed Rate Scheduling Algorithms, " in Proc. of IEEE Infocom, April 2001.

....deployed and used 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 architecture, proposed by Stoica and Zhang [68, 67] and architectures derived from it (e.g. [45, 57]) 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. SCORE uses this approach to provide end to end delay guarantees ....

J. Kaur and H. M. Vin. Core-stateless guaranteed rate scheduling algorithms. In Proceedings of INFOCOM

No context found.

J. Kaur and H. Vin. Core-stateless guaranteed rate scheduling algorithms. In Proc. of IEEE INFOCOM, volume 3, pages 1484--1492, April 2001.

....the deadline for processing a packet (or a subtask, in Pfair terminology) depends on its eligibility time, which in turn is a function of the deadline of the previous packet of the same flow. Thus, the latest deadline used within each flow must be stored (per flow state) As shown by Kaur and Vin [28], upper bounds on these latest deadlines can be computed based on the state of the same packet at the first node on the end to end path of the flow. Since the first node is an edge router of the network, it maintains per flow state, and can compute deadlines. The edge router can communicate these ....

J. Kaur and H. Vin. Core-stateless guaranteed rate scheduling algorithms. In Proc. of IEEE INFOCOM, pages 1484--1492, Apr. 2001.

....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, ....

....the network to utilize resource efficiently. With the predicted growth in traffic demands [12] this is undesirable. To the best of our knowledge, the only kind of deterministic guar antees provided by work conserving core stateless networks proposed in the literature, are on delay and throughput [13, 16, 17, 25]. Research Contributions In this paper, we propose the first work conserving core stateless network that provides deterministic fairness guarantees. We argue that an end to end notion of proportionate allocation in fair networks is meaningful only when defined across flows that share the same ....

[Article contains additional citation context not shown here]

J. Kaur and H. Vin. Core-stateless Guaranteed Rate Scheduling Algorithms. In Proceedings of IEEE INFOCOM, volume 3, pages 1484--1492, April 2001.

....carry a very large number of flows. The topic of designing scalable network architectures that can export to flows rich service semantics, but without maintaining per flow state or performing per packet flow classification in core routers, has received considerable attention in the recent past [10, 17, 21]. For instance, the Core stateless Jitter Virtual Clock (CJVC) scheduling algorithm [17] and the class of Core stateless Guaranteed Rate (CSGR) algorithms [10] enable a network to provide end to end delay guarantees similar to their core stateful counterparts. CJVC also provides end to end ....

.... per flow state or performing per packet flow classification in core routers, has received considerable attention in the recent past [10, 17, 21] For instance, the Core stateless Jitter Virtual Clock (CJVC) scheduling algorithm [17] and the class of Core stateless Guaranteed Rate (CSGR) algorithms [10] enable a network to provide end to end delay guarantees similar to their core stateful counterparts. CJVC also provides end to end throughput guarantees, but at the expense of making the network non work conserving. There have also been attempts at designing core stateless versions This ....

[Article contains additional citation context not shown here]

J. Kaur and H.M. Vin. Core-stateless Guaranteed Rate Scheduling Algorithms. In Proceedings of IEEE INFOCOM, volume 3, pages 1484-- 1492, April 2001.

....carry a very large number of flows. The topic of designing scalable network architectures that can export to flows rich service semantics, but without maintaining per flow state or performing per packet flow classification in core routers, has received considerable attention in the recent past [10, 17, 21]. For instance, the Core stateless Jitter Virtual Clock (CJVC) scheduling algorithm [17] and the class of Core stateless Guaranteed Rate (CSGR) algorithms [10] enable a network to provide end to end delay guarantees similar to their core stateful counterparts. CJVC also provides end to end ....

.... per flow state or performing per packet flow classification in core routers, has received considerable attention in the recent past [10, 17, 21] For instance, the Core stateless Jitter Virtual Clock (CJVC) scheduling algorithm [17] and the class of Core stateless Guaranteed Rate (CSGR) algorithms [10] enable a network to provide end to end delay guarantees similar to their core stateful counterparts. CJVC also provides end to end throughput guarantees, but at the expense of making the network non work conserving. There have also been attempts at designing core stateless versions # This ....

[Article contains additional citation context not shown here]

J. Kaur and H.M. Vin. Core-stateless Guaranteed Rate Scheduling Algorithms. In Proceedings of IEEE INFOCOM, volume 3, pages 1484-- 1492, April 2001.

No context found.

J. Kaur and H. M. Vin. Core-stateless guaranteed rate scheduling algorithms. In Proceedings of INFOCOM 2001.

No context found.

J. Kaur and H. Vin. Core-stateless guaranteed rate scheduling algorithms. In Proc. of IEEE INFOCOM, pages 1484--1492, April 2001.

No context found.

J. Kaur and H. M. Vin, "Core-stateless guaranteed rate scheduling algorithms," in Proceedings of INFOCOM 2001, 3, pp. 1484--1492, (Anchorage, AK), Apr. 2001.

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