Abstract
Network coding provides a powerful mechanism for improving performance of communication networks. In this paper, we present an analytical approach for per-flow performance analysis in network coding. Prior work on performance analysis in network coding mainly focuses on the throughput of the overall network. Our approach aims to analyze the end-to-end performance of each flow in the network. The theoretical basis of our approach is Real-Time Calculus (RTC). Under the framework of RTC, we obtain theoretical formulations for computing the backlog and delay bounds of flows in network coding. Based on the formulations, we evaluate the per-flow performance in representative scenarios and investigate the effect of coding opportunities. Numerical results show that the coding opportunities at coding nodes can significantly affect the end-to-end performance of flows in network coding.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
