• DocumentCode
    3389798
  • Title

    Network coding-based protection strategy with data traffic prediction scheduling algorithm

  • Author

    Liang, Shasha ; Shou, Guochu ; Lv, Feibi ; Guo, Zhigang ; Hu, Yihong

  • Author_Institution
    Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2011
  • fDate
    25-28 Sept. 2011
  • Firstpage
    950
  • Lastpage
    954
  • Abstract
    In this paper, we propose network coding-based protection strategies with data traffic prediction scheduling algorithm against a single link failure, which are applicable to not have extra backup links. We present three scheduling algorithms: namely Proportional Fair, Max idle path and Round Robin, which select an appropriate link to transmit protection packets. The simulation results show the Proportional Fair can reduce more than 50% average packets delay comparing with the Round Robin scheduling algorithm and the traffic load of paths can get to a certain extent balance.
  • Keywords
    network coding; scheduling; telecommunication security; telecommunication traffic; data traffic prediction scheduling algorithm; max idle path; network coding-based protection strategy; proportional fair; protection packets; round robin; traffic load; data traffic prediction; network coding; protection; scheduling algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Technology (ICCT), 2011 IEEE 13th International Conference on
  • Conference_Location
    Jinan
  • Print_ISBN
    978-1-61284-306-3
  • Type

    conf

  • DOI
    10.1109/ICCT.2011.6158019
  • Filename
    6158019