Network Protection Scheduling Strategy

An explosive growth in Internet traffic of50%-100%per year is driving enormous demand for effective protection strategies in transport networks. Due to data rates continue to increase, the failure of a network or worse a fiber cut, can result in severe service disruptions and large data loss, potentially causing millions of dollars in lost revenue. Single link failures are the most common and inevitable failures in optical networks. However, it is shown that almost30%of the failures of backbone networks are multiple link failures.The increasing amount of data transmission in communication networks demands for efficient protection strategies. As SLAs (Service Level Agreements) and higher QoS (Quality of Service) guarantees for services like real-time streaming applications (such as VoIP、IPTV and so on), networks require fast recovery mechanisms.Recently network coding has been applied to provide agile and cost-efficient network protection against link failures. The1+N protection mechanism proposed by Kamal delivers a linear combination of data packets from every sender on a backup path and enables each receiver node to recover the plain data in case of the link failure. M extra backup paths are needed to recover from M link failures in M+N protection approach. In fact, adding an extra path is not applicable in many network scenarios. It therefore provides expeditious recovery without data rerouting or packet retransmission. Network coding is a powerful tool that offers energy efficiency, additional security and reduced delay.Due to the increasing of data transmission and quality of service requirements, fast recovery protection strategy plays a surprising vital role in increasing the reliability of the communication networks. In this paper, we propose three novel network coding-based protection scheduling strategies against multiple link failures:Round Robin (RR) scheduling strategy、Proportional Fair (PF) scheduling strategy and Proportional Fair with Real-time idle Detection (PF/RD) scheduling strategy to protect against multiple link failures with network coding. The strategies based on data traffic prediction do not require any separate path to carry protection packets.We analyze the performance of protection strategies against multiple link failures with the Poisson distribution traffic model and Pareto distribution traffic model. The simulation results show that the PF/RD strategy achieves a significant reduction in network delay, as well as a comparable load balancing of the network. This solution offers higher resource utilization and agile recovery from multiple link failures. The PF/RD scheduling strategy reduces the data delay effectively and balances the network load relative to RR and PF scheduling strategy. The average delay of packets can be reduced by50%with PF/RD strategy. Furthermore, both the average delay and traffic load decrease with a certain range increase of the paths’number.