Network Coding-Based Protection Strategy with Data Traffic Prediction

In this paper we introduce a new network coding-based network protection strategies against link failure, which is based on prediction of data traffic. In the situation that extra backup links are not applicable, we assign protection packets to the path which would have a low traffic by the prediction. The simulation result shows that using the new strategy, the average queuing delay of packets can be reduced by more than 50% and the traffic load of links can also get balance.

[1]  R. Yeung,et al.  Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[2]  Ning Cai,et al.  Network coding and error correction , 2002, Proceedings of the IEEE Information Theory Workshop.

[3]  Ahmed E. Kamal,et al.  Network coding-based protection strategies against a single link failure in optical networks , 2008, 2008 International Conference on Computer Engineering & Systems.

[4]  R. Yeung,et al.  Network coding theory , 2006 .

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

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

[7]  Ahmed E. Kamal,et al.  Network Protection Codes Against Link Failures Using Network Coding , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

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

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

[10]  Ahmed E. Kamal,et al.  1 + N network protection for mesh networks: network coding-based protection using p-cycles , 2010, TNET.

[11]  Ahmed E. Kamal,et al.  Network coding-based protection of many-to-one wireless flows , 2009, IEEE Journal on Selected Areas in Communications.

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