Algorithms and throughput analysis for MDS-coded switches

Rami Cohen; Yuval Cassuto

doi:10.1109/ISIT.2015.7282536

Algorithms and throughput analysis for MDS-coded switches

Rami Cohen, Yuval Cassuto

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Network switches and routers need to serve packet writes and reads at rates that challenge the most advanced memory technologies. As a result, scaling the switching rates is commonly done by parallelizing the packet I/Os using multiple memory units. For improved read rates, packets can be coded with an [n,k] MDS code, thus giving more flexibility at read time to achieve higher utilization of the memory units. In the paper, we study the usage of [n,k] MDS codes in a switching environment. In particular, we study the algorithmic problem of maximizing the instantaneous read rate given a set of packet requests and the current layout of the coded packets in memory. The most interesting results from practical standpoint show how the complexity of reaching optimal read rate depends strongly on the writing policy of the coded packets.

Original language	English
Title of host publication	Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Pages	656-660
Number of pages	5
ISBN (Electronic)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282536
State	Published - 28 Sep 2015
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: 14 Jun 2015 → 19 Jun 2015

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2015-June

Conference

Conference	IEEE International Symposium on Information Theory, ISIT 2015
Country/Territory	Hong Kong
City	Hong Kong
Period	14/06/15 → 19/06/15

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2015.7282536

Cite this

@inproceedings{08a3d64380f7466a90e6f8c562a0d6e4,

title = "Algorithms and throughput analysis for MDS-coded switches",

abstract = "Network switches and routers need to serve packet writes and reads at rates that challenge the most advanced memory technologies. As a result, scaling the switching rates is commonly done by parallelizing the packet I/Os using multiple memory units. For improved read rates, packets can be coded with an [n,k] MDS code, thus giving more flexibility at read time to achieve higher utilization of the memory units. In the paper, we study the usage of [n,k] MDS codes in a switching environment. In particular, we study the algorithmic problem of maximizing the instantaneous read rate given a set of packet requests and the current layout of the coded packets in memory. The most interesting results from practical standpoint show how the complexity of reaching optimal read rate depends strongly on the writing policy of the coded packets.",

author = "Rami Cohen and Yuval Cassuto",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282536",

language = "الإنجليزيّة",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "656--660",

booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",

}

Cohen, R & Cassuto, Y 2015, Algorithms and throughput analysis for MDS-coded switches. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282536, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, pp. 656-660, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 14/06/15. https://doi.org/10.1109/ISIT.2015.7282536

Algorithms and throughput analysis for MDS-coded switches. / Cohen, Rami; Cassuto, Yuval.
Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. 2015. p. 656-660 7282536 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algorithms and throughput analysis for MDS-coded switches

AU - Cohen, Rami

AU - Cassuto, Yuval

PY - 2015/9/28

Y1 - 2015/9/28

N2 - Network switches and routers need to serve packet writes and reads at rates that challenge the most advanced memory technologies. As a result, scaling the switching rates is commonly done by parallelizing the packet I/Os using multiple memory units. For improved read rates, packets can be coded with an [n,k] MDS code, thus giving more flexibility at read time to achieve higher utilization of the memory units. In the paper, we study the usage of [n,k] MDS codes in a switching environment. In particular, we study the algorithmic problem of maximizing the instantaneous read rate given a set of packet requests and the current layout of the coded packets in memory. The most interesting results from practical standpoint show how the complexity of reaching optimal read rate depends strongly on the writing policy of the coded packets.

AB - Network switches and routers need to serve packet writes and reads at rates that challenge the most advanced memory technologies. As a result, scaling the switching rates is commonly done by parallelizing the packet I/Os using multiple memory units. For improved read rates, packets can be coded with an [n,k] MDS code, thus giving more flexibility at read time to achieve higher utilization of the memory units. In the paper, we study the usage of [n,k] MDS codes in a switching environment. In particular, we study the algorithmic problem of maximizing the instantaneous read rate given a set of packet requests and the current layout of the coded packets in memory. The most interesting results from practical standpoint show how the complexity of reaching optimal read rate depends strongly on the writing policy of the coded packets.

UR - http://www.scopus.com/inward/record.url?scp=84969796355&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7282536

DO - 10.1109/ISIT.2015.7282536

M3 - منشور من مؤتمر

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 656

EP - 660

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -

Algorithms and throughput analysis for MDS-coded switches

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this