Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Enhanced first-in-first-out-based round-robin multicast scheduling algorithm for input-queued switches

Enhanced first-in-first-out-based round-robin multicast scheduling algorithm for input-queued switches

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

This study focuses on the multicast scheduling for M×N input-queued switches. An enhanced first-in-first-out -based round-robin multicast scheduling algorithm is proposed with a function of searching deeper into queues to reduce the head-of-line (HOL) blocking problem and thereby the multicast latency. Fan-out information of each input cell composes a traffic matrix and the scheduler executes a round-robin algorithm on each column independently. Scheduling decisions result in a decision matrix for the scheduler to release multicast cells accordingly. A matrix operation called sync is carried out on the decision matrix to reduce the number of transmission for each cell. To reduce the HOL blocking problem, a complement matrix is constructed based on the traffic matrix and the decision matrix, and a process of searching deeper into the queues is carried out to find cells that can be sent to the idle outputs. Simulation results show that the proposed function of searching deeper into the queues can alleviate the HOL blocking and as a result reduce the multicast latency significantly. Under both balanced and unbalanced multicast traffic, the proposed algorithm is able to maintain a stable throughput.

References

    1. 1)
    2. 2)
      • OPNET modeler: http://www.opnet.com/solutions/network_rd/modeler.html.
    3. 3)
      • Mekkittikul, A., McKeown, N.: `A practical scheduling algorithm to achieve 100% throughput in input-queued switches', Proc. 17th Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM'98), 1998, p. 792–799.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
      • Marsan, M., Bianco, A., Giaccone, P., Leonardi, E., Neri, F.: `Packet scheduling in input-queued cell-based switches', Proc. IEEE Int. Conf. on Computer Communications, April 2001, p. 1085–1094.
    9. 9)
      • Yu, H., Ruepp, S., Berger, M.S.: `A novel round-robin based multicast scheduling algorithm for 100 Gigabit Ethernet switches', Proc. IEEE 29th Int. Conf. on Computer Communications Workshops, March 2010, p. 1–2.
    10. 10)
    11. 11)
    12. 12)
      • Bianco, A., Giaccone, P., Piglione, C., Sessa, S.: `Practical algorithms for multicast support in input queued switches', Proc. Workshop on High Performance Switching and Routing, 2006, p. 6.
    13. 13)
      • Tamir, Y., Frazier, G.: `High performance multi-queue buffers for VLSI communication switches', Proc. 15th Annual Symp. Computer Artchitecture, June 1988, p. 343–354.
    14. 14)
    15. 15)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0378
Loading

Related content

content/journals/10.1049/iet-com.2010.0378
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address