A practical Network Coding and Routing Scheme based on Maximum Flow Combination



Download 1.23 Mb.
Page17/19
Date02.05.2018
Size1.23 Mb.
#47331
1   ...   11   12   13   14   15   16   17   18   19

  1. No coding operation test case

Figure 24. shows an example which has more than two sink nodes.



  1. Three sink nodes test case

As shown in Figure 25., a coding scheme does not utilise all the merged flow as some max-flow to single sink node might exceed the multicast capacity. Flow 0-11 is not used because max-flow from 0 to 11 is 3, which is larger than the multicast capacity 2.



  1. Redundancy capacity test case


      1. Download 1.23 Mb.

        Share with your friends:
1   ...   11   12   13   14   15   16   17   18   19




The database is protected by copyright ©ininet.org 2024
send message

    Main page