The Research Of Network Partition Algorithms For ASON Optimition

Nowadays, more and more researches focus on ASON optimition. As the exponential growth of the data traffic, more and more network facilities have been built, so the management of thousands of network facilities in a single routing area (RA) becomes more and more difficult. The need for propagating routing information is increasing, while the efficiency of the routing algorithms is descent. The network partition could be introduced into network optimition of ASON, pursuing for integrating and assigning the network resource. Each route area independently operated and inspected. Each route area had its own protection scheme. Therefore, the changes in some routing area could not affect other routing areas; new technology and new topology were easily applied in the route areas.This paper presented an overview of the development, features and routing architecture of ASON, briefly introduced the routing protocol of ASON and the Inter-Domain Routing Protocols, such as DDRP, PCE and BGP. This paper focused on the research of network partition algorithms for ASON optimition.There were many innovative researches in network partition algorithms for ASON optimition, which of them are listed as follows:1. Four algorithms for ASON network partition were proposed. The algorithms were designed to achieve a low interaction between domains in an intra-carrier optical network.2. According to the simulation on OPNET platform, the performances of these four algorithms were compared.