International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 8, No. 2, 8 Feb. 2016
Cover page and Table of Contents: PDF (size: 590KB)
Multicast Due Date Round-Robin Scheduling Algorithm for Input-Queued Switches
Full Text (PDF, 590KB), PP.56-63
Views: 0 Downloads: 0
Author(s)
Index Terms
Due Date, Grant, Multicast, Request, Scheduling
Abstract
In recent years, the Internet has incremented the several incipient applications that rely on multicast transmission. This paper discusses the challenges of scheduling algorithms for multicast in high-speed switches that reduces the overhead of adaptation by selecting a HOL (Head of Line Cell) using Round Robin pointer. The objective of this paper is to design a scheduling algorithm called MDDR (Multicast Due Date Round-Robin) scheduling to achieve maximum throughput and low delay that has two phases request and grant. In request phase, MDDR assigns a Due Date (Request Time Slot) for HOL cells of each queue in the input port. Round Robin Pointer is utilized in the grant phase to select a request if HOL occurs. MDDR achieves more preponderant performance than MDRR (Multicast Dual Round-Robin), since the request shall be made when the Due Date is reached. MDDR mainly minimizes many requests made for output ports and time complexity. The simulation results show that the proposed algorithm has good switching performance in throughput and average time delay under Bernoulli and bursty traffic conditions.
Cite This Paper
Navaz K, Kannan Balasubramanian, "Multicast Due Date Round-Robin Scheduling Algorithm for Input-Queued Switches", International Journal of Computer Network and Information Security(IJCNIS), Vol.8, No.2, pp.56-63, 2016. DOI:10.5815/ijcnis.2016.02.07
Reference
[1]Bianco A, Giaccone P, Leonardi E, Neri F, and Piglione C., “On the number of input queues to efficiently support multicast traffic in input queued switches,” In Proceedings of Workshop on High Performance Switching and Routing, pp. 111–116, 2003.
[2]Bianco A, Scicchitano A., “Multicast support in multi-chip centralized schedulers in input queued switches,” Computer Networks, vol. 53, no. 7, pp. 1040–1049, 2009.
[3]Gupta S, and Aziz A., “Multicast scheduling for switches with multiple input-queues,” In Proceedings of High Performance Interconnects Symposium, pp. 28–33, 2002.
[4]Marsan M.A, Bianco A, Giaccone P, Leonardi E, and Neri F, “Multicast traffic in input-queued switches: optimal scheduling and maximum throughput,” IEEE/ACM Transactions on Networking, vol. 11, no. 3, pp. 465–477, 2003.
[5]McKeown N, and Prabhakar B., “Scheduling multicast cells in an input queued switch,” In Proceedings of IEEE INFOCOM, vol. 1, pp. 271–278, 1996.
[6]McKeown N., “A Fast Switched Backplane for a Gigabit Switched Router,” Business Communication Review, vol. 27, no. 12, 1997.
[7]McKeown N, “The iSLIP scheduling algorithm for input-queued switches,” IEEE/ACM Transactions on Networking, vol. 7, no. 2, pp. 188–201, 1999.
[8]Nandhini Sivasubramanian, Palaniammal Senniappan., “Enhanced Core Stateless Fair Queuing with Multiple Queue Priority Scheduler,” In Proceedings of The International Arab Journal of Information Technology, Vol. 11, No. 2, 2014.
[9]Pan D. and Yang Y., “FIFO-based multicast scheduling algorithm forvirtual output queued packet switches,” IEEE Transactions on Computers, vol. 54, no. 10, pp. 1283–1297, 2005.
[10]Prabhakar B, McKeown N, and Ahuja R., “Multicast scheduling for input-queued switches,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 5, pp. 855–866, 1997.
[11]Shanmugam Arumugam, Shanthi Govindaswamy., “Performance of the Modified Round Robin Scheduling Algorithm for Input-Queued Switches Under Self-Similar Traffic,” In Proceedings of The International Arab Journal of Information Technology, vol.3, no.2, 1996.
[12]Song M, and Zhu W., “Throughput analysis for multicast switches with multiple input queues,” IEEE Communications Letters, vol. 8, no. 7, pp. 479–481, 2004.
[13]Yongbo Jiang, Zhiliang Qiu, Ya Gao, and Jun Li, “Multicast Support in Input Queued Switches with Low Matching Overhead”, IEEE Communications Letters, vol. 16, no. 12, 2012.
[14]Zhu W, and Song M., “Integration of unicast and multicast scheduling in input-queued packet switches,” Computer Networks, vol. 50, pp. 667– 687, 2006.
[15]Zhu W, and Song M., “Performance analysis of large multicast packet switches with multiple input queues and gathered traffic,” Computer Communications, vol. 33, no. 7, pp. 803–815, 2010.
[16]Janaka L. Wijekoon, Erwin H. Harahap, Shinichi Ishida, Rajitha L. Tennekoon and Hiroaki Nishi., “Router-based Content-aware Data Redirection for Future CDN Systems” I.J. Computer Network and Information Security, 2014, 7, 1-10.