Font Size: a A A

The Research Of Virtual Mapping Algorithm Based On Optical Network Survivability

Posted on:2018-10-05Degree:MasterType:Thesis
Country:ChinaCandidate:X X ZhuFull Text:PDF
GTID:2348330518996223Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
Recently, continued rapid growth of big data, cloud computing boost data center (DC). Massive data interchange, along with the high flexibility of service bandwidth among data centers intensify the pressure of network performance optimization. In order to address these problems,flexible bandwidth optical networks being able to carry variable dynamic granularity resources as well as virtualization technology provides optimized configuration for network resource. Optical network virtualization based on DC-converged flexible bandwidth optical network would be the developing tendency. In order to improve the security and reliability of service mapped onto the optical network, the survivability problem of virtual optical network becomes very critical.This paper focuses on the resource bottleneck limit and survivability challenges of optical network. Based on the evolution tendency of the flexible dynamic, efficient and extensible character of flexible bandwidth optical networks, this paper not only considers the survivability theory and virtual realization mechanism, but also intensively studies the virtual mapping algorithm based on optical network survivability. It mainly solve the problems relating to the secure and reliable mapping in virtual optical network. Moreover, innovation and breakthroughs in this paper achieve to realize the optimization in both optical network resource and protection efficiency. The main work and innovation achievements of this paper are as follows:Firstly, based on the survivability theory, this paper builds flexible bandwidth optical networks virtualization mapping model. Then, the collaborative mapping scheme of nodes sharing protection and links dynamic recovery is proposed from the perspective of traditional link and node resources protection. From the aspect of data center failure, this scheme may also provide high-quality service for more virtual services by occupying less resource.Secondly, according to the characteristics of flexible bandwidth optical networks and the survivability requirements of optical network,the differentiated maximum sharing capacity protection (DMSCP)algorithm is proposed with the consideration of link failure. DMSCP adopts a path calculation method of differentiated link weight and a spectrum allocation method of differential sharing constrained capacity in order to reduce the restraint of reserve resources on recovery from failure.It is the first to propose that the extent of fuzzy optimization is treated as an indicator to accurately evaluate the reliability of the virtual optical network mapping. What is more, the critical cost of sharing mapping is calculated approximately so that the optimal sharing ability can be determined. The result indicates that the optimization effect of DMSCP algorithm is more efficient than other traditional algorithms in 19.1%.Thirdly, aiming at the reliability problems caused by the dynamic allocation of virtual subnet mapping, this paper builds the security theory model and explores the relationship among the maximum sharing capacity of frequency slots, the requirement of security service and the recovery of guaranteed bandwidth, and then proposes the security assuring shared protection (SASP) algorithm. SASP maximizes spectrum resources to offer variable dynamic granularity service. Moreover, it ensures the reliable transmission of data service due to the adjustable sharing ability on the basis of service security dynamic adjustment mechanism. Compared with other algorithms, the blocking possibility of SASP is reduced by 4.5%, and the protection efficiency of SASP is increased by 8.7%.
Keywords/Search Tags:flexible bandwidth optical networks, survivability virtualization, maximum sharing, mapping algorithm
PDF Full Text Request
Related items