Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Rate region of unicast routing networks

Rate region precisely measures the transmission ability of a network. Three graph processing techniques are presented: reduced graph, union reduced graph, and virtual node. Applying these techniques, an operable method to completely solve the calculation of rate regions for unicast routing networks is developed. The correctness of the method is proved theoretically and illustrated with an example. This method is helpful in both theoretical perspective and industrial implementation.

References

    1. 1)
      • 6. Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: ‘Linear programming and network flows’ (John Wiley & Sons, New Jersey, USA, 2010, 4th edn.).
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • 3. Yeung, R.W.: ‘Information theory and network coding’ (Springer Science+Business Media, LLC, New York, USA, 2008).
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.1592
Loading

Related content

content/journals/10.1049/el.2016.1592
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address