Providing Guaranteed Rate Services in the Load Balanced Birkhoff-von Neumann Switches

— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earliest Deadline First (EDF) scheduling policy. In such a scheme, we assign every packet of a guaranteed rate flow a targeted departure time that is the departure time from the corresponding work conserving link with capacity equal to the guaranteed rate. By adding a jitter control mechanism in front of the buffer at the second stage and running the EDF policy at the output buffer, we show that the end-to-end delay for every packet of a guaranteed rate flow is bounded by the sum of its targeted departure time and a constant that only depends on the number of flows and the size of the switch. Our second scheme is a frame based scheme as in Keslassy and McKeown [18]. There, time slots are grouped into fix size frames. Packets are placed in appropriate bins (buffers) according to their arrival times and their �...

• Type: Conference
• Year: 2003
• Where: INFOCOM
• Authors: Cheng-Shang Chang, Duan-Shin Lee, Chi-Yao Yue
• Keywords: Communications, Guaranteed Rate, Guaranteed Rate flow, INFOCOM 2003, Targeted Departure Time