Integrated scheduling of unicast and multicast traffic in an input-queued switch

Andrews, Matthew; Khanna, Sankalp; Kumaran, K.

doi:10.1109/infcom.1999.751670

Cited by 50 publications

(38 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [8], it was proved that the multicast scheduling problem is NP-hard, both with and without fanout splitting. In the case of fanout splitting, every partial service causes an increase of the input load, leading to performance penalties.…”

Section: Scheduling Discipline and Queueing Architecturementioning

confidence: 99%

“…Referring to the stochastic version of Lyapunov stability [15], the maximum throughput of the switch can be obtained, as proved in Appendix A, by solving the following optimization problem at each time slot (8) subject to constraints (2), (3), (4), and (5).…”

Section: Optimal Scheduling and Capacity Regionmentioning

confidence: 99%

“…In [8], the multicast scheduling problem was studied in its possible variants (see Section II), and its hardness was proved. Another problem investigated in [8] is the integration of unicast with multicast traffic, suggesting the transfer of unicast cells to their output ports when the multicast schedule leaves those idle, thus, treating multicast traffic as a different class from unicast.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Multicast traffic in input-queued switches: Optimal scheduling and maximum throughput

Marsan

Bianco

Giaccone

et al. 2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-This paper studies input-queued packet switches loaded with both unicast and multicast traffic. The packet switch architecture is assumed to comprise a switching fabric with multicast (and broadcast) capabilities, operating in a synchronous slotted fashion. Fixed-size data units, called cells, are transferred from each switch input to any set of outputs in one time slot, according to the decisions of the switch scheduler, that identifies at each time slot a set of nonconflicting cells, i.e., cells neither coming from the same input, nor directed to the same output.First, multicast traffic admissibility conditions are discussed, and a simple counterexample showing intrinsic performance losses of input-queued with respect to output-queued switch architectures is presented. Second, the optimal scheduling discipline to transfer multicast packets from inputs to outputs is defined. This discipline is rather complex, requires a queuing architecture that probably is not implementable, and does not guarantee in-sequence delivery of data. However, from the definition of the optimal multicast scheduling discipline, the formal characterization of the sustainable multicast traffic region naturally follows. Then, several theorems showing intrinsic performance losses of input-queued with respect to output-queued switch architectures are proved. In particular, we prove that, when using per multicast flow FIFO queueing architectures, the internal speedup that guarantees 100% throughput under admissible traffic grows with the number of switch ports.

show abstract

Section: Scheduling Discipline and Queueing Architecturementioning

confidence: 99%

Section: Optimal Scheduling and Capacity Regionmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Multicast traffic in input-queued switches: Optimal scheduling and maximum throughput

Marsan

Bianco

Giaccone

et al. 2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…It is also stated that "the numerical evaluation of the necessary speedup is prohibitive" and no scaling law has been given for the necessary speedup for 100% throughput. Also, finding the multicast schedule that works with the minimum necessary speedup is NP-hard as shown in [1]. There are obvious ways of simplifying multicast scheduling, such as ruling out fanout splitting.…”

Section: Switch Model and Multicast Trafficmentioning

confidence: 99%

“…One of the main reasons for this is the difficulty of the task. Indeed, it was shown in [1] that "optimal scheduling" of multicast packets is NP-hard over a crossbar switch and in [2] it was proved that the resource speedup necessary to achieve 100% throughput for all admissible multicast traffic grows unbounded with increasing switch size. These results hold even when the crossbar switch is multicast capable, i.e., it is capable of connecting an input to multiple outputs.…”

Section: Introductionmentioning

confidence: 99%

On the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches

Köksal

2008

2008 16th Interntional Workshop on Quality of Service

View full text Add to dashboard Cite

Abstract-We show an isomorphism between maximal matching for packet scheduling in crossbar switches and strictly nonblocking circuit switching in three-stage Clos networks. We use the analogy for a crossbar switch of size n × n to construct a simple multicast packet scheduler of complexity O(n log n) based on maximal matching. We show that, with this simple scheduler, a speedup of O(log n/ log log n) is necessary to support 100% throughput for any admissible multicast traffic. If fanout splitting of multicast packets is not allowed, we show that an extra speedup of 2 is necessary, even when the arrival rates are within the admissible region for mere unicast traffic. Also 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.

show abstract

An Integrated Scheduling for Multiple Loss Priority Traffic in E-PON OLT Switches

Kim¹,

Park²

2003

Architectures for Quality of Service in the Internet

View full text Add to dashboard Cite

Integrated scheduling of unicast and multicast traffic in an input-queued switch

Cited by 50 publications

References 21 publications

Multicast traffic in input-queued switches: Optimal scheduling and maximum throughput

Multicast traffic in input-queued switches: Optimal scheduling and maximum throughput

On the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches

An Integrated Scheduling for Multiple Loss Priority Traffic in E-PON OLT Switches

Contact Info

Product

Resources

About