High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks

Bennett, Jon C. R.; Stephens, D.C.; Zhang, Hui

doi:10.1109/icnp.1997.643677

Cited by 44 publications

(20 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This increase in start-time is comparable to that of some techniques which attempt to reduce the implementation complexity of scheduling algorithms, such as the technique presented in [3], and furthermore, this worst-case scenario is highly unlikely in a core network which handles a large number of flows. Consider another scenario.…”

mentioning

confidence: 83%

Preserving quality of service guarantees in spite of flow aggregation

Cobb

2002

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-We investigate how quality of service may be guaranteed to a flow of packets in the presence of flow aggregation. For efficiency, multiple flows, known as the constituent flows, are merged together resulting in a single aggregate flow. After the network node where the aggregation occurs, packet schedulers are aware of the aggregate flow, but are unaware of its constituent flows. In spite of this, we show that quality of service may be guaranteed to the constituent flows, provided the aggregation is performed fairly. When the delay bound of a flow is de-coupled from the flow's reserved rate, flow aggregation preserves the delay bound. When the delay bound of a flow is coupled to the flow's reserved rate, flow aggregation preserves, and in some cases improves, the delay bound.

show abstract

mentioning

confidence: 83%

Preserving quality of service guarantees in spite of flow aggregation

Cobb

2002

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…r-~c = Exp^2 nc{tl) )- (7)(8)(9)(10) In addition, since fi nc (t) > r inc (t)/C, for any t, the following inequality follows trivially…”

Section: T") By Assuming That R Inc (T) Is a Continuous Function Omentioning

confidence: 95%

“…The operations can be as simple as deciding whether to drop or queue the packet (e.g., FRED), or as complex as manipulation of priority queues (e.g., Fair Queueing). While a number of techniques have been proposed to reduce the complexity of the per packet operations [9,94,99], and commercial implementations are available in some intermediate class routers, it is still unclear whether these algorithms can be cost-effectively implemented in high-speed backbone routers because all these algorithms still require packet classification and per flow state management. In this chapter, we address the complexity problem by describing a solution based on Dynamic Packet State to provide fair bandwidth allocation within a SCORE domain.…”

Section: Introductionmentioning

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

“…The second complication is in each rate group, sorting among different sessions should be avoided. Therefore, a newly backlogged session will be assigned a value at least as large as that of the tail of the backlogged sessions in the rate group [3] but still in the range . In dual-rate session grouping, there are three additional complications regarding the overflow of the timestamp and sorting in the rate group.…”

Section: Maintaining Cell Sequencementioning

confidence: 99%

“…To implement PFQ algorithms with LBT and GBT properties, Stephens et al [3], [7] proposed a scheduler architecture which is also applied in a cell-based scheduler in [8]. In this architecture, sessions with same rate are grouped together and the scheduler only supports a fixed number of rates.…”

Section: Introductionmentioning

confidence: 99%

Improving service rate granularity by dual-rate session grouping in cell-based schedulers

Yang

Dong

Papavassiliou

et al.

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)

View full text Add to dashboard Cite

Abstract-In this paper we propose a scheme referred to as dualrate session grouping to improve the service rate granularity for cell-based schedulers. In this scheme a session is split into two subsessions to provide the average service rate that a user requires. By applying dual-rate session grouping, the utilization of bandwidth and fairness among users can be improved, while the complexity of the scheduling algorithm remains the same as the conventional scheme. The overall computational complexity of the dual-rate session grouping does not increase with the rate granularity that is only limited by the available memory space. Several implementation issues are also presented in this paper.

show abstract

High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks

Cited by 44 publications

References 19 publications

Preserving quality of service guarantees in spite of flow aggregation

Preserving quality of service guarantees in spite of flow aggregation

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

Improving service rate granularity by dual-rate session grouping in cell-based schedulers

Contact Info

Product

Resources

About