Network Coding for Speedup in Switches

@article{Kim2007NetworkCF,
  title={Network Coding for Speedup in Switches},
  author={MinJi Kim and Jay Kumar Sundararajan and Muriel M{\'e}dard},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2007},
  pages={1086-1090}
}
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… CONTINUE READING
9 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Schedul - ing algorithms for providing flexible , ratebased , qualityof service guarantees for packetswitching in Banyan networks ”

  • M. Rosenblum, M. X. Goemans, V. Tarokh
  • Proceedings of the Conference on Information…
  • 2004

Graph Imperfection I , II ”

  • C. McDiarmid
  • Journal of Combinatorial Theory , Series B
  • 2001

Similar Papers

Loading similar papers…