Frame-based multicast switching

Authors:
Michael Tartre;Bill Lin
Affiliations:
University of California, San Diego, La Jolla, CA;University of California, San Diego, La Jolla, CA
Venue:
IEEE Communications Letters
Year:
2010

Citing 6
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
New methods to color the vertices of a graph

Communications of the ACM
Switching and Traffic Theory for Integrated Broadband Networks

Switching and Traffic Theory for Integrated Broadband Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Multicast traffic in input-queued switches: optimal scheduling and maximum throughput

IEEE/ACM Transactions on Networking (TON)
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.00

Visualization

Abstract

This letter considers the multicast scheduling problem for the case where the average rates of flows are known and a fixed frame size is applicable. We present a frame-based decomposition method for computing offline a recurring schedule that can guarantee the specified flow rates with minimum internal speedup, if any. We consider both the no-splitting case, where a multicast cell must be transferred to all its destinations in a single time slot, and the fanout-splitting case, where a multicast cell may take multiple time slots to transfer to all its destinations, transferring only to a subset of its destinations each time.