Rate quantization and the speedup required to achieve 100% throughput for multicast over crossbar switches

Authors:
Can Emre Koksal
Affiliations:
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2010

Citing 9
Cited 0

Nonblocking Broadcast Switching Networks

IEEE Transactions on Computers
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks

IEEE Transactions on Computers
Multirate multicast switching networks

Theoretical Computer Science
Switching and Traffic Theory for Integrated Broadband Networks

Switching and Traffic Theory for Integrated Broadband Networks
Multicast traffic in input-queued switches: optimal scheduling and maximum throughput

IEEE/ACM Transactions on Networking (TON)
On guaranteed smooth scheduling for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Asymptotic Performance Limits of Switches With Buffered Crossbars Supporting Multicast Traffic

IEEE Transactions on Information Theory
On the speedup required for work-conserving crossbar switches

IEEE Journal on Selected Areas in Communications
Extending the Birkhoff-von Neumann switching strategy for multicast - On the use of optical splitting in switches

IEEE Journal on Selected Areas in Communications - Part Supplement

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of providing quality-of-service (QoS) guarantees for multicast traffic over crossbar switches has received limited attention despite the popularity of its counterpart for unicast traffic. Providing a 100% throughput to all admissible multicast traffic has been shown to be a very difficult task, and it requires a very high speedup in the switching fabric. In this paper, we introduce the concept of rate quantization and use rate quantization to show an analogy between packet scheduling in crossbar switches and circuit switching in three-stage Clos networks. We exploit the analogy to adopt circuit-switching algorithms in wide-sense and strict-sense nonblocking Clos networks in order to construct nonblocking packet schedulers for unicast and multicast traffic. We illustrate a simple multicast nonblocking packet scheduler, for which a speedup of 6 log n/log log n is sufficient to support 100% throughput for any admissible multicast traffic in an n x n crossbar switch. Moreover, we revisit some problems in unicast switch scheduling. We illustrate that the analogy provides useful perspectives, and we give a simple proof for a well-known result.