2026-09-19T03:02:04Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/463252022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Muriel Médard.
Kim, MinJi, M. Eng. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2009-07-06T20:24:55Z
2009-07-06T20:24:55Z
2007
2007
http://hdl.handle.net/1721.1/46325
334756528
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 69-71).
Network coding, which allows mixing of data at intermediate network nodes, is known to increase the throughput of networks. In particular, it is known that linear network coding in a crossbar switch can sustain traffic patterns that cannot be served if network coding were not allowed. Thus, network coding leads to a larger rate region in a multicast crossbar switch. This thesis quantities the gain in rate region in a multicast crossbar switch in terms of speedup. We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e. network coding, which is usually implemented using software, can in many cases substitute speedup, which is often achieved by adding extra switch fabrics. This bound is based on an approach to network coding problems called the "enhanced conflict graph". We show that the "imperfection ratio" of the enhanced conflict graph gives an upper bound on speedup. In particular, we apply this result to K x N switches with traffic patterns consisting of unicasts and broadcasts only to obtain an upper bound of min(2K-1/K, 2N/N+1).
by MinJi Kim.
M.Eng.
71 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Network coding for speedup in switches
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1b8b45cd-d460-4c61-80ab-d9b5c0e899ab">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Network coding for speedup in switches</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2007</PublicationDate>
<Authors>
<Author>
<DisplayName>Kim, MinJi, M. Eng. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Network coding, which allows mixing of data at intermediate network nodes, is known to increase the throughput of networks. In particular, it is known that linear network coding in a crossbar switch can sustain traffic patterns that cannot be served if network coding were not allowed. Thus, network coding leads to a larger rate region in a multicast crossbar switch. This thesis quantities the gain in rate region in a multicast crossbar switch in terms of speedup. We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e. network coding, which is usually implemented using software, can in many cases substitute speedup, which is often achieved by adding extra switch fabrics. This bound is based on an approach to network coding problems called the "enhanced conflict graph". We show that the "imperfection ratio" of the enhanced conflict graph gives an upper bound on speedup. In particular, we apply this result to K x N switches with traffic patterns consisting of unicasts and broadcasts only to obtain an upper bound of min(2K-1/K, 2N/N+1).</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>