On Iterative Scheduling for Input-Queued Switches With a Speedup of $2-1/N$

Hu, Bing; Yeung, Kwan L.; Zhou, Qian; He, Chunzhi

doi:10.1109/tnet.2016.2541161

Cited by 14 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, the speedup decreases packet delays [27]. The larger speedup value as a consequence has a higher implementation cost [28]. Typically, in the packet switches that use a speedup, speedup is required for both, the internal links and the switch fabric [28].…”

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

“…The larger speedup value as a consequence has a higher implementation cost [28]. Typically, in the packet switches that use a speedup, speedup is required for both, the internal links and the switch fabric [28]. If the speedup value is SP, then the internal links rate is SP times higher than the external links rate.…”

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

“…This expansion of the straightforward approach additionally increases the implementation costs since the switch fabric should accommodate (at its inputs and outputs) bundles of links instead of individual links. The speedup of switch fabric requires faster reconfigurations of the switch fabric in order to properly switch the packets that are incoming over internal links with speedup [28]. Usually, the switch fabric speedup is considered to be more critical from the design point of view [28].…”

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

“…The speedup of switch fabric requires faster reconfigurations of the switch fabric in order to properly switch the packets that are incoming over internal links with speedup [28]. Usually, the switch fabric speedup is considered to be more critical from the design point of view [28]. However, the LB-BvNGS does not require speedup of switch fabric even in the case when the internal links use speedup [24].…”

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

See 3 more Smart Citations

Multicast Load-Balanced Birkhoff-Von Neumann Switch With Greedy Scheduling

Durkovic

Cica

2020

IEEE Access

View full text Add to dashboard Cite

Internet traffic is still exhibiting an exponential growth. This exponential growth will certainly be continued given the Internet of Things (IoT) and Internet of Everything (IoE) predictions regarding the number of devices connected to the Internet in the near future. Also, many popular multicast services such as IPTV, distance learning, content distribution, distributive interactive gaming, collaborative computing and others are rapidly increasing amount of the Internet multicast traffic, thus, significantly contributing to the Internet traffic growth. The routers are typically designed to cope with unicast traffic. Multicast traffic can negatively impact performance of such routers and cause significant degradation of overall network performance. Hence, due to increasing importance and increasing amount of multicast traffic, there is a great need for a scalable switch architecture that efficiently forwards both unicast and multicast traffic. In this paper, we propose a novel scalable, efficient and frugal multicast switch architecture based on load balanced Birkhoff-von Neumann switch with greedy scheduling that achieves stable performance even at very high traffic loads. The proposed switch is compared to other popular multicast switch solutions. Comparison shows that our proposed multicast switch architecture outperforms other solutions in all tested common traffic scenarios at the most critical (highest) traffic loads. INDEX TERMS Packet switching, multicast, high speed networks.

show abstract

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

Section: Regular Node Packet Forwarding Pseudocodementioning

confidence: 99%

See 2 more Smart Citations

Multicast Load-Balanced Birkhoff-Von Neumann Switch With Greedy Scheduling

Durkovic

Cica

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Thus, flow control between the line cards and switch fabrics is unnecessary. Besides, each output port of CQ switches makes arbitrations independently, thus a centralised scheduler with high complexity is not needed, unlike in most input-queued switches [7,8]. Furthermore, CQ switches do not need memory speedup which is required by output-queued and shared-memory switches [9].…”

Section: Introductionmentioning

confidence: 99%

Improved analytical model for performance evaluation of crosspoint‐queued switch under uniform traffic

2017

View full text Add to dashboard Cite

In this study, a crosspoint-queued (CQ) switch that features a buffer size larger than one and employs the workconserving random scheduling algorithm under uniform Bernoulli i.i.d. traffic is investigated through both theoretical analysis and simulation. The effect of the crosspoint buffer state on switch performance is modelled and quantified. A novel method for calculating the throughput and delay of a CQ switch with a given switch size, input load, and buffer size is proposed. Compared with existing models, the proposed calculation model offers a simpler and more accurate result, and can serve as a theoretical guide in designing high-speed switch fabrics.

show abstract