Network Coding for Speedup in Switches

Details Network Coding for Speedup in Switches Network Coding for Speedup in Switches

2008-05-08

arxiv.org/abs/0805.1088v1

Computer Science

Networking and Internet Architecture

5 pages, 4 figures, IEEE ISIT 2007

Scientific paper

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-by-N switches with traffic patterns consisting of unicasts and broadcasts only to obtain an upper bound of min{(2K-1)/K, 2N/(N+1)}.

Affiliated with

Also associated with

No associations

Rating

Network Coding for Speedup in Switches does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Network Coding for Speedup in Switches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network Coding for Speedup in Switches will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-52296