As today's communication networks introduce high-capacity transmission links and the increased amount of data traffics, the failure of key links can cause a huge loss of services and a loss of revenue to the operating companies. Therefore, self-healing network is becoming more important.
This thesis is the study of a self-healing algorithm and a spare-channel assignment algorithm. This proposed algorithms make it possible to achieve a high and fast survivable network. In order to achieve fast restorations, this self-healing algorithm which is the distributed control and the line restoration introduces the ASC_NULL message and reduces a number of control messages. An intermediation node use ASC_NULL message for informing all neighbor nodes that it has no restoration path. To obtain an efficient spare-channel on the proposed self-healing algorithm, this spare-channel assignment algorithm preferentially assigns spare-channels to the shortest path.
This thesis evaluates the survivability and the restoration time of proposed algorithms by computer simulation. Through the simulation study, it is verified that the proposed survivable network has high and fast survivability.
