Generalized dynamic frame sizing algorithm for finite-internal-buffered networks

Authors:
Ching-Min Lien;Cheng-Shang Chang
Affiliations:
Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.;Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.
Venue:
IEEE Communications Letters
Year:
2009

Citing 4
Cited 0

Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Multicast traffic in input-queued switches: optimal scheduling and maximum throughput

IEEE/ACM Transactions on Networking (TON)
Throughput Region of Finite-Buffered Networks

IEEE Transactions on Parallel and Distributed Systems
On guaranteed smooth switching for buffered crossbar switches

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we generalize the Dynamic Frame Sizing (DFS) algorithm proposed in [2] for CICQ switches to a network of queues subject to multicast traffic flows. Under the assumption of Bernoulli arrival processes for the multicast flows, we show that the DFS algorithm guarantees 100% throughput and there are at most two packets in each internal queue.