Network Coding for Speedup in Switches
Kim, MinJi
Sundararajan, Jay Kumar
Medard, Muriel
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. Email: minjikim@mit.edu;
This paper appears in: Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Publication Date: 24-29 June 2007
On page(s): 1086-1090
Location: Nice,
ISBN: 978-1-4244-1397-3
Digital Object Identifier: 10.1109/ISIT.2007.4557368
Current Version Published: 2008-07-09
Abstract
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 × N switches with traffic patterns consisting of unicasts and broadcasts only to obtain an upper bound of min(2K-1/K, 2N/N+1).
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
