E-MDDR Scheduling Algorithm for Input-Queued Switches

K. Navaz*, Kannan Balasubramanian**
* Research Scholar, Manonmaniam Sundaranar University, Tirunelveli, Tamil Nadu, India.
** Professor, Department of Computer Science and Engineering, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, India.
Periodicity:March - May'2016
DOI : https://doi.org/10.26634/jcom.4.1.5989

Abstract

The increasing use of multicast applications on the internet, has an urgent need for the high speed router/switches, which handles the multicast traffic efficiently. The core component of the router is the switch fabric. The scheduling algorithm which configures the switch fabric to arbitrate and transfer the cells between the input and output ports. Most of the existing multicast scheduling algorithms performed well under uniform traffic, but failed to achieve maximum throughput under non-uniform traffic. In this paper, the authors have proposed a multicast scheduling algorithm called Enhanced Multicast Due-Date Round Robin Scheduling Algorithm (E-MDDR), which got the improved throughput compared with Multicast Due-Date Round Robin Scheduling algorithm (MDDR). Since E-MDDR computes the residue of the cells waiting until M cell times and those cells are declared as the emergency cells, which are transferred between every M time slot for an NxM switch. So that it achieves the improved throughput and minimum delay under non-uniform Bernoulli and bursty traffic patterns.

Keywords

Multicast, Router, Non-uniform, Scheduling.

How to Cite this Article?

Navaz, K., and Balasubramanian, K. (2016). E-MDDR Scheduling Algorithm For Input-Queued Switches. i-manager’s Journal on Computer Science, 4(1), 28-33. https://doi.org/10.26634/jcom.4.1.5989

References

[1]. Prabhakar B, McKeown N, and Ahuja R., (1997). “Multicast Scheduling for Input-queued Switches”. IEEE Journal on Selected Areas in Communications, Vol.15, No.5, pp.855-866.
[2]. McKeown N, (1999). “The iSLIP Scheduling Algorithm for Input-queued Switches”. IEEE/ACM Transactions on Networking, Vol.7, No.2, pp.188-201.
[3]. McKeown N., (1997). “A Fast Switched Backplane for a Gigabit Switched Router”. Business Communication Review, Vol.27, No.12.
[4]. Pan D, and Yang Y., (2005). “FIFO-based Multicast Scheduling Algorithm for Virtual Output Queued Packet Switches”. IEEE Transactions on Computers, Vol.54, No.10, pp.1283-1297.
[5]. Yongbo Jiang, Zhiliang Qiu, Ya Gao, and Jun Li, (2012). “Multicast Support in Input Queued Switches with Low Matching Overhead”. IEEE Communications Letters, Vol.16, No.12.
[6]. Marsan M.A, Bianco A, Giaccone P, Leonardi E, and Neri F, (2003). “Multicast Traffic in Input-queued Switches: Optimal Scheduling and Maximum Throughput ”. IEEE/ACM Transactions on Networking, Vol.11, No.3, pp.465-477.
[7]. Bianco A, Giaccone P, Leonardi E, Neri F, and Piglione C., (2003). “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.
[8]. Gupta S, and Aziz A., (2002). “Multicast Scheduling for Switches with Multiple Input-queues”. in Proceedings of High Performance Interconnects Symposium, pp.28-33.
[9]. Navaz K, and Kannan Balasubramanian, (2016). “Multicast Due Date Round-Robin Scheduling Algorithm for Input-Queued Switches”. International Journal of Computer Network and Information Security, Vol.2, pp.56-63.
[10] . Song M, and Zhu W., (2004). “Throughput Analysis for Multicast Switches with Multiple Input Queues”. IEEE Communications Letters, Vol.8, No.7, pp.479-481.
[11] . Zhu W, and Song M., (2010). “Performance Analysis of Large Multicast Packet Switches with Multiple Input Queues and Gathered Traffic”. Computer Communications, Vol.33, No.7, pp.803-815.
[12]. Zhu W, and Song M., (2006). “Integration of unicast and Multicast Scheduling in Input-queued Packet Switches”. Computer Networks, Vol.50, pp.667- 687.
[13] . Shanmugam Arumugam , and Shanthi Govindaswamy., (1996). “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.
[14]. Navaz K, and Kannan Balasubramanian, (2015). “OQSMS: Optimal Queue Selection Based Multicast Scheduling Algorithm for Input-Queued Switches”. Australian Journal of Basic and Applied Sciences, Vol.9, No.27, pp.373-378.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.