Delivering 100% throughput in a buffered crossbar with round robin scheduling

Berger, Michael

doi:10.1109/hpsr.2006.1709743

Cited by 16 publications

(17 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For a fixed , at time , we have [28]: -, the cumulative number of arrivals to ; -, the number of packets in ; -, the cumulative number of departures from ; -, the cumulative number of arrivals to ; -, the number of packets in ; -, the cumulative number of departures from . For each , we define It is shown in [29] and [30] that for each fixed satisfying (4), (5), and any sequence with as , there exist a subsequence and the continuous functions , where converges to uniformly on compacts as for any (7) Definition 1: Any function obtained through the limiting procedure in (7) is said to be a fluid limit of the switch. Thus, the fluid model equations using our proposed scheduling algorithms are…”

Section: A Constructing Fluid Modelmentioning

confidence: 99%

Feedback-Based Scheduling for Load-Balanced Two-Stage Switches

Yeung

2010

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unlike existing approaches, we show that the efforts made in load balancing and keeping packets in order can complement each other. Specifically, at each middle-stage port between the two switch fabrics of a load-balanced switch, only a single-packet buffer for each virtual output queueing (VOQ) is required. Although packets belonging to the same flow pass through different middle-stage VOQs, the delays they experience at different middle-stage ports will be identical. This is made possible by properly selecting and coordinating the two sequences of switch configurations to form a joint sequence with both staggered symmetry property and in-order packet delivery property. Based on the staggered symmetry property, an efficient feedback mechanism is designed to allow the right middle-stage port occupancy vector to be delivered to the right input port at the right time. As a result, the performance of load balancing as well as the switch throughput is significantly improved. We further extend this feedback mechanism to support the multicabinet implementation of a load-balanced switch, where the propagation delay between switch linecards and switch fabrics is nonnegligible. As compared to the existing load-balanced switch architectures and scheduling algorithms, our solutions impose a modest requirement on switch hardware, but consistently yield better delay-throughput performance. Last but not least, some extensions and refinements are made to address the scalability, implementation, and fairness issues of our solutions.Index Terms-Load-balanced switch, feedback-based switch, two-stage switch.

show abstract

Section: A Constructing Fluid Modelmentioning

confidence: 99%

Feedback-Based Scheduling for Load-Balanced Two-Stage Switches

Yeung

2010

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…The fluid model of a switch operating under a scheduling algorithm is said to be weakly stable if for every fluid model solution D,Z À Á with Zð0Þ ¼ 0,ZðtÞ ¼ 0 for almost every tZ0. From Berger (2006), the switch is rate stable if the corresponding fluid model is weakly stable. Our goal here is to prove that for every fluid model solution D,Z À Á using HRF, ZðtÞ ¼ 0 for almost every t. To prove ZðtÞ ¼ 0 , we will use the following Fact 1 from Dai and Prabhakar (2000):…”

Section: A1 Constructing Fluid Modelmentioning

confidence: 99%

“…We shall sometimes use the notation A ij (Á ,o), Z ij (Á ,o) and D ij (Á ,o) to explicitly denote the dependency on the sample path o. For a fixed o, at time t, we have (Berger, 2006):…”

Section: A1 Constructing Fluid Modelmentioning

confidence: 99%

See 1 more Smart Citation

An efficient single-iteration single-bit request scheduling algorithm for input-queued switches

Yeung

Zhang

2013

Journal of Network and Computer Applications

View full text Add to dashboard Cite

“…In [3], the results were extended to variable size packets. The author in [4] proved that the speedup requirement can be reduced to 2 -liN. However, without speedup, previous throughput results are only limited to uniform traffic loads.…”

mentioning

confidence: 99%

A low complexity scheduling algorithm for a crosspoint buffered switch with 100% throughput

Shen¹,

Panwar²,

Chao³

2008

2008 International Conference on High Performance Switching and Routing

View full text Add to dashboard Cite

Abstract-Crosspoint butTered switches are emerging as the focus of research in high-speed routers. They have simpler scheduling algorithms, and achieve better performance than a bufferless crossbar switch. Crosspoint butTered switches have a buffer at each crosspoint. A cell is first delivered to a crosspoint butter, and then transferred to the output port. With a speedup of two, a crosspoint butTered switch has previously been proved to provide 100% throughput. In this paper, we propose a 100% throughput scheduling algorithm without speedup, called SQUID. With this design, each input/output keeps track of the previously served virtual output queues (VOQs)/crosspoint butters. We prove that SQUID, with a time complexity of G(log N), can achieve 100% throughput without any speedup. Our simulation results also show a delay performance comparable to outputqueued switches. We also present a novel queuing model that models crosspoint butTered switches under uniform traffic.

show abstract

Delivering 100% throughput in a buffered crossbar with round robin scheduling

Cited by 16 publications

References 10 publications

Feedback-Based Scheduling for Load-Balanced Two-Stage Switches

Feedback-Based Scheduling for Load-Balanced Two-Stage Switches

An efficient single-iteration single-bit request scheduling algorithm for input-queued switches

A low complexity scheduling algorithm for a crosspoint buffered switch with 100% throughput

Contact Info

Product

Resources

About