Analytical models for Replicate-At-Send multicasting in shared-memory switches

Ho, J.D.; Singh, Samar; Sharma, Neeraj Kumar

doi:10.1016/s0166-5316(01)00062-1

Cited by 1 publication

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There has been extensive research on the multicast support in share memory switches. [4] and [5] devise a discrete Markov model to study the performance of the mixed traffic, [6] proposes a per-queue threshold to control the admission of mixed cells into the shared buffer, but the work mentioned addresses little on the scheduling policies under mixed traffic. [7] puts forward a mechanism of separated processing of unicast and multicast cells, but the high complexity of such mechanism will cause dear hardware cost and thus prevents its feasible implementation.…”

Section: Introductionmentioning

confidence: 99%

A Sliding-Window Based Efficient Forwarding Mechanism in Shared Memory Switch Fabric

Wang

Zhan

2007

2007 Second International Conference on Communications and Networking in China

View full text Add to dashboard Cite

Shared memory switch fabric is the dominant technology in single board switching and the front switching in high-speed switch systems, over which multicast should be well supported. The currently two important forwarding mechanisms are dedicated multicast queue (DMQ) and address copy queue (ACQ). This paper studies the efficiency of ACQ in terms of memory utility, and proposes a sliding-window based multicast-unicast promiscuous address copy queue (SWPACQ) model. Theoretical analysis and numerical emulation show that SWPACQ is a significant enhancement of ACQ, with its performance at least equivalent with ACQ. In given multicast proportion and fan out, the proposed scheme can demonstrate a considerable improvement.

show abstract

Section: Introductionmentioning

confidence: 99%