Rate controlled servers for very high-speed networks

Kalmanek, Charles; Kanakia, Hemant; Keshav, Srinivasan

doi:10.1109/glocom.1990.116472

Cited by 245 publications

(91 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since the use of explicit reservation isolates connections from each other, it can provide better service quality guarantees. Hence, for the experiments described in this paper we choose a explicit reservation policy, using the HRR scheduling mechanism to allocate bandwidth at switches [KKK90]. The HRR scheduling discipline guarantees a minimum service rate to a connection independent of the traffic generated by other connections.…”

Section: Rate Reservationmentioning

confidence: 99%

“…The parameters used to define the rate for a connection are the quantum which defines the number of packets that can be sent per round and the interval which defines the number of rounds to skip when the rate of the connection is less than one packet per round. The reader is referred to [KKK90] for a more complete description of the mechanism and possible implementation strategies.…”

Section: Rate Reservationmentioning

confidence: 99%

“…Second, we show that allocating bandwidth to aggregates of connections results in superior performance specially in counteracting the degradation in the performance of adaptive control schemes as the transfer times become smaller vis-a-vis the end to end delay in the network. Third, we compare the effectiveness of adaptive and fixed bandwidth allocation using the HBH and Hierarchical Round Robin (HRR) scheduling schemes [KKK90] as examples. Our results indicate that the likelihood of exceeding a desired transfer time requirement with the HBH scheme is lower than the blocking probability with the HRR scheme.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Study of Bandwidth Allocation Strategies for Interactive Image Applications

Mishra

Tripathi

1995

Computer Networks, Architecture and Applications

View full text Add to dashboard Cite

Image applications are expected to consume a significant portion of the bandwidth of future integrated service networks. In this paper, we examine the effectiveness of various bandwidth allocation mechanisms for this class of applications. First, we describe how a rate based hop by hop (HBH) congestion control scheme, proposed previously by us for controlling data traffic, may be modified to control the flow of image traffic. The performance of the modified HBH scheme as measured by the average image transfer times is shown to be within 15-30% of an unachievable lower bound. We also compare the effectiveness of the HBH scheme with a hierarchical round robin (HRR) scheme that reserves bandwidth before commencing each image transfer. Our results indicate that the likelihood of exceeding a desired transfer time requirement with the HBH scheme is lower than the blocking probability with the HRR scheme. Moreover, the average transfer times achieved with the HBH scheme are much lower. However, the variation of the transfer time is very small with the HRR scheme. We also show that the HBH scheme may be used to effectively trade transfer time vs image quality.

show abstract

Section: Rate Reservationmentioning

confidence: 99%

Section: Rate Reservationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Study of Bandwidth Allocation Strategies for Interactive Image Applications

Mishra

Tripathi

1995

Computer Networks, Architecture and Applications

View full text Add to dashboard Cite

show abstract

“…Examples of such schemes that are work conserving are: Static Priority [123], Weighted Round Robin [52], Virtual Clock [127], Weighted Fair Queueing [31], and Delay Earliest Deadline Due [124]. Similarly, examples of non-work conserving disciplines are: Stop-and-Go [44], JitterVirtual Clock [126], Hierarchical Round Robin [63], and Rate Controlled Static Priority [123].…”

Section: Packet Schedulingmentioning

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

“…Framed round robin has the effect of "smoothing" the traffic stream arriving at the downstream switch, which affects the amount of buffering needed at that switch. Framed round robin is a subset of a scheduling discipline known as Hierarchical Round Robin (Kalmanek et al 1990).…”

Section: Xunet 2 Cell Schedulermentioning

confidence: 99%

A scheduling discipline and admission control policy for Xunet 2

Saran¹,

Keshav²,

Kalmanek³

et al. 1994

Network and Operating System Support for Digital Audio and Video

View full text Add to dashboard Cite

Xunet 2 is a collaborative research program with a goal of understanding the fundamental issues in the performance of ATM networks. These networks are expected to carry a mixture of constant bit rate traffic, variable bit rate traffic and computer traffic spanning a wide range of performance requirements. This paper describes these service requirements and matches them with performance guarantees that can be provided by the scheduling discipline supported by an experimental ATM switch. The scheduler supports per-virtual-circuit queueing and several priorities of round robin service in order to segregate real-time and non-real-time traffic and provide fair sharing for bursty computer traffic. Detailed simulations show that real-time traffic can be efficiently integrated with non-real-time traffic using appropriate call admission policies and enhancements to traditional round robin scheduling. While the present study is focused on providing quality of service guarantees in the Xunet 2 network, the design of the scheduler and the call admission policies are relevant to ATM networks in general.

show abstract

Rate controlled servers for very high-speed networks

Cited by 245 publications

References 7 publications

A Study of Bandwidth Allocation Strategies for Interactive Image Applications

A Study of Bandwidth Allocation Strategies for Interactive Image Applications

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

A scheduling discipline and admission control policy for Xunet 2

Contact Info

Product

Resources

About