Throughput Analysis of Multicast Scheduling Algorithms by Varying NxN IQ Switch

Authors

  • Jumlesha S Dept. Of CSE, Annamacharya Institute of Technology and Sciences, Tirupati, India
  • Navaz K Dept. Of CSE, Annamacharya Institute of Technology and Sciences, Tirupati, India
  • Athinarayanan S Dept. Of CSE, Annamacharya Institute of Technology and Sciences, Tirupati, India

DOI:

https://doi.org/10.26438/ijcse/v6i9.789792

Keywords:

Multicast, Throughout, MDRR, MDDR, OQSMS

Abstract

Incredible measures of exertion have gone into investigate on multicast switch texture outline and calculations. Switch measure is one of the primary factor which impacts the execution of throughput and deferral. In this work, execution of switch has been investigated by applying the progressed multicast planning calculation OQSMS (Optimal Queue Selection Based Multicast Scheduling Algorithm), due date based round-robin booking calculation MDDR(Multicast Due Date Round Robin) and double round-robin based multicast planning calculation MDRR(Multicast Dual Round Robin). Recreation results demonstrate that OQSMS accomplishes preferred exchanging execution over different calculations under the allowable movement conditions on the grounds that if the switch measure builds, OQSMS will gauge ideal line determination in view of more line mixes so it accomplishes greatest conceivable throughput.

References

N. McKeown, “The iSLIP scheduling algorithm for input-queued switches,” IEEE/ACM Trans. Netw., vol. 7, no. 2, pp. 188–201, Apr. 1999.

N. McKeown and B. Prabhakar, “Scheduling multicast cells in an input queued switch,” in Proc. 1996 IEEE INFOCOM, vol. 1, pp. 271–278.

B. Prabhakar, N. McKeown, and R. Ahuja, “Multicast scheduling for input-queued switches,” IEEE J. Sel. Areas Commun., vol. 15, no. 5, pp. 855–866, June 1997.

A. Bianco and A. Scicchitano, “Multicast support in multi-chip centralized schedulers in input queued switches,” Computer Networks, vol. 53, no. 7, pp. 1040–1049, May 2009.

S. Gupta and A. Aziz, “Multicast scheduling for switches with multiple input-queues,” in Proc. 2002 Symposium on High Performance Interconnects, pp. 28–33.

M. Song and W. Zhu, “Throughput analysis for multicast switches with multiple input queues,” IEEE Commun. Lett., vol. 8, no. 7, pp. 479–481, July 2004.

W. Zhu and M. Song, “Performance analysis of large multicast packet switches with multiple input queues and gathered traffic,” Computer Commun., vol. 33, no. 7, pp. 803–815, May 2010.

B. Prabhakar, N. McKeown, and R. Ahuja, “Multicast scheduling for input-queued switches,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 5, pp. 855–866, 1997.

W. Zhu and M. Song, “Integration of unicast and multicast scheduling in input-queued packet switches,” Computer Networks, vol. 50, pp. 667– 687, April 2006.

Yongbo Jiang, Zhiliang Qiu, Ya Gao, and Jun Li, “Multicast Support in Input Queued Switches with Low Matching Overhead” in IEEE COMMUNICATIONS LETTERS, VOL. 16, NO. 12, DECEMBER 2012.

F.A. Tobagi, “Fast Packet Switch Architectures For Broadband Integrated Service Digital Networks”, Proceedings of the IEEE, Vol.78, No.1, p.p. 90-167, January, 1990

K. Navaz “OQSMS: Optimal Queue Selection Based Multicast Scheduling Algorithm for Input-Queued Switches” on Australian Journal of Basic and Applied Sciences, 9(27) August 2015, Pages: 373-378.

K. Navaz “Multicast Due Date Round-Robin Scheduling Algorithm for Input-Queued Switches” on International Journal of Computer Network and Information Security, 2016, 2, 56-63

Downloads

Published

2025-11-15
CITATION
DOI: 10.26438/ijcse/v6i9.789792
Published: 2025-11-15

How to Cite

[1]
S. Jumlesha, K. Navaz, and S. Athinarayanan, “Throughput Analysis of Multicast Scheduling Algorithms by Varying NxN IQ Switch”, Int. J. Comp. Sci. Eng., vol. 6, no. 9, pp. 789–792, Nov. 2025.

Issue

Section

Research Article