CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Multicast Scheduling for Optical Data Center Switches with Tunability Constraints

Kamran Keykhosravi (Institutionen för signaler och system, Kommunikationssystem) ; Houman Rastegarfar (Institutionen för signaler och system, Kommunikationssystem) ; Erik Agrell (Institutionen för signaler och system, Kommunikationssystem)
International Conference on Computing, Networking and Communications (ICNC), Silicon Valley, USA, Jan 2017, p. 5. (2017)
[Konferensbidrag, refereegranskat]

Optical multicasting based on passive star couplers and fast tunable transceivers is an attractive solution for the throughput and latency requirements of many data center applications. The limited tuning range of transceivers, however, may not be sufficient enough to enable the flexible scheduling of traffic. In this paper, we propose a suite of scalable scheduling algorithms for optical multicast switches with wavelength tunability constraints, considering both tunable and nontunable transmitters. To support scalability and scheduling fairness, we adopt a round-robin arbitration policy in conjunction with appropriate provisions to minimize the number of packet retransmissions. We conduct Monte Carlo simulations to compare the proposed algorithms. For 64 ports, 16 channels, and bursty multicast traffic, a scheduling that exploits transmitter tunability with minimal fan-out splitting can improve the maximum throughput by up to 60\% compared to a fixed transmitter scenario.

Nyckelord: Multicast switching, packet switching, optical data center

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2017-08-08. Senast ändrad 2017-09-14.
CPL Pubid: 250958


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Institutioner (Chalmers)

Institutionen för signaler och system, Kommunikationssystem (1900-2017)


Informations- och kommunikationsteknik

Chalmers infrastruktur