http://iet.metastore.ingenta.com
1887

Delay analysis of network coding nodes and Butterfly network employing stop-and-wait automatic repeat request

Delay analysis of network coding nodes and Butterfly network employing stop-and-wait automatic repeat request

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The delay characteristics of network coding nodes and Butterfly network are investigated. First, the probability mass function (PMF) of delay and the average delay of general network coding nodes having multiple input links and one output link are analysed. It can be shown that the PMF and average delay can be readily evaluated from the recursive equations derived. Then, the delay performance of the Butterfly network is investigated. Specifically, the authors consider four different scenarios in the context of the packets transmitted over the Butterfly network. The PMFs of delay as well as the average delays of these four scenarios are analysed and, correspondingly, a range of formulae are obtained. Finally, the delay performance of network coding nodes and Butterfly network is investigated based on the numerical results evaluated from the formulae derived. The authors studies demonstrate that network coding nodes embedded in a network generate a big impact on the network's delay performance. Usually, in a network including some network coding nodes, the longest path with some network coding nodes may be chosen for approximately estimating the network's average delay.

References

    1. 1)
      • R. Ahlswede , N. Cai , S.Y.R. Li , R.W. Yeung .
        1. Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: ‘Network information flow’, IEEE Trans. Inf. Theory, 2000, 46, (4), pp. 12041216 (doi: 10.1109/18.850663).
        . IEEE Trans. Inf. Theory , 4 , 1204 - 1216
    2. 2)
      • D.S. Lun , M. Medard , M. Effros .
        2. Lun, D.S., Medard, M., Effros, M.: ‘On coding for reliable communication over packet networks’. Proc. 42nd Annual Allerton Conf. on Communication, Control, and Computing, September/October 2004.
        . Proc. 42nd Annual Allerton Conf. on Communication, Control, and Computing
    3. 3)
      • S.Y.R. Li , R.W. Yeung , N. Cai .
        3. Li, S.Y.R., Yeung, R.W., Cai, N.: ‘Linear network coding’, IEEE Trans. Inf. Theory, 2003, 49, (2), pp. 371381 (doi: 10.1109/TIT.2002.807285).
        . IEEE Trans. Inf. Theory , 2 , 371 - 381
    4. 4)
      • D.S. Lun , M. Medard , R. Koetter , M. Effros .
        4. Lun, D.S., Medard, M., Koetter, R., Effros, M.: ‘Further results on coding for reliable communication over packet networks’. Proc. Int. Symp. on Information Theory' 05, 4–9 September 2005, pp. 18481852.
        . Proc. Int. Symp. on Information Theory' 05 , 1848 - 1852
    5. 5)
      • Y. Qin , L.-L. Yang .
        5. Qin, Y., Yang, L.-L.: ‘Steady-state throughput analysis of network coding nodes employing stop-and-wait automatic repeat request’, IEEE/ACM Trans. Netw., 2012, 20, (5), pp. 14021411 (doi: 10.1109/TNET.2011.2178860).
        . IEEE/ACM Trans. Netw. , 1402 - 1411
    6. 6)
      • S. Lin , D.J. Costello . (2004)
        6. Lin, S., Costello, D.J.: ‘Error Control Coding’ (Prentice-Hall, Upper Saddle River, New Jersey, 2004, 2nd ed.).
        .
    7. 7)
      • C. Fragouli , D. Lun , M. Medard , P. Pakzad .
        7. Fragouli, C., Lun, D., Medard, M., Pakzad, P.: ‘On feedback for network coding’. Proc. 41st Annual Conf. Information Sciences and Systems 2007, 14–16 March 2007, pp. 248252.
        . Proc. 41st Annual Conf. Information Sciences and Systems 2007 , 248 - 252
    8. 8)
      • P.A. Chou , Y. Wu , K. Jain .
        8. Chou, P.A., Wu, Y., Jain, K.: ‘Practical network coding’. Proc. 41st Annual Allerton Conf. Communication, Control, and Computing, 2003.
        . Proc. 41st Annual Allerton Conf. Communication, Control, and Computing
    9. 9)
      • J.K. Sundararajan , D. Shah , M. Médard .
        9. Sundararajan, J.K., Shah, D., Médard, M.: ‘ARQ for network coding’. Proc. IEEE Int. Symp. Information Theory 2008, 6–11 July 2008, pp. 16511655.
        . Proc. IEEE Int. Symp. Information Theory 2008 , 1651 - 1655
    10. 10)
      • J.K. Sundararajan , D. Shah , M. Médard .
        10. Sundararajan, J.K., Shah, D., Médard, M.: ‘Online network coding for optimal throughput and delay – the two-receiver case’, Int. Symp. on Information Theory and its Applications, ISITA 2008, Auckland, New Zealand, December 2008, pp. 16.
        . Int. Symp. on Information Theory and its Applications, ISITA 2008 , 1 - 6
    11. 11)
      • J. Barros , R. Costa , D. Munaretto , J. Widmer .
        11. Barros, J., Costa, R., Munaretto, D., Widmer, J.: ‘Effective delay control in online network coding’. Proc. INFOCOM 2009, April 2009, pp. 208216.
        . Proc. INFOCOM 2009 , 208 - 216
    12. 12)
      • J.K. Sundararajan , P. Sadeghi , M. Médard .
        12. Sundararajan, J.K., Sadeghi, P., Médard, M.: ‘A feedback-based adaptive broadcast coding scheme for reducing in-order delivery delay’. Workshop on Network Coding, Theory, and Applications 2009, June 2009, pp. 16.
        . Workshop on Network Coding, Theory, and Applications 2009 , 1 - 6
    13. 13)
      • D. Nguyen , T. Tran , T. Nguyen , B. Bose .
        13. Nguyen, D., Tran, T., Nguyen, T., Bose, B.: ‘Hybrid ARQ-random network coding for wireless media streaming’. Proc. Second Int. Conf. Communications and Electronics 2008, 4–6 June 2008, pp. 115120.
        . Proc. Second Int. Conf. Communications and Electronics 2008 , 115 - 120
    14. 14)
      • Y. Sagduyu , A. Ephremides .
        14. Sagduyu, Y., Ephremides, A.: ‘On broadcast stability of queue-based dynamic network coding over erasure channels’, IEEE Trans. Inf. Theory, 2009, 55, (12), pp. 54635478 (doi: 10.1109/TIT.2009.2032732).
        . IEEE Trans. Inf. Theory , 12 , 5463 - 5478
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2012.0294
Loading

Related content

content/journals/10.1049/iet-com.2012.0294
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address