We compare the delays experienced by packet flows when transmitted using different scheduling algorithms across a crossbar switch. The two scheduling algorithms we consider are iterative SLIP [McKeown 1999] and QCSMA [Jiang & Walrand 2010]. We first compare them under the assumptions that all packets have the same length, and then under the assumption that the half the packets have the maximum allowable length and half have the minimum allowable length. Our findings suggest that the variation in packet length has a non-negligible effect on throughput vs delay results. For long-lived TCP connections with varying packet lengths, QCSMA derived schedulers seem to do only marginally better than SLIP. In highly loaded core switches with many short-lived TCP connections, we expect to see a large improvement in delay performance of QCSMA over SLIP.
Title
Delay Comparison of Different Switch Architectures
Published
2013-12-13
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2013-204
Type
Text
Extent
32 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
