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

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.

[1]  Ashwin Sampath,et al.  Downlink Scheduling for Multiclass Traffic in LTE , 2009, EURASIP J. Wirel. Commun. Netw..

[2]  Suresh Subramaniam,et al.  Survivability in optical networks , 2000, IEEE Netw..

[3]  Osameh M. Al-Kofahi,et al.  Network protection codes: Providing self-healing in autonomic networks using network coding , 2008, Comput. Networks.

[4]  Upamanyu Madhow,et al.  Fair scheduling with tunable latency: a round-robin approach , 2003, TNET.

[5]  Ahmed E. Kamal,et al.  A Generalized Strategy for 1+N Protection , 2008, 2008 IEEE International Conference on Communications.

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Jack M. Holtzman,et al.  Asymptotic analysis of proportional fair algorithm , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

[8]  S. Vadgama,et al.  Hybrid genetic packet scheduling and radio resource management for high speed downlink packet access , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[9]  Ahmed E. Kamal,et al.  OPN04-3: 1+N Protection in Mesh Networks Using Network Coding over p-Cycles , 2006, IEEE Globecom 2006.

[10]  Ahmed E. Kamal,et al.  Efficient and Agile 1+N Protection , 2011, IEEE Transactions on Communications.