论文部分内容阅读
This paper proposes an effective method of fault location based on a binary tree for optical burst switching(OBS) network.To minimize the monitoring cost,we divide the network into several monitor domains by introducing monitoring-cycle algorithms.In order to generate an exclusive code,we modify the monitoring cycle algorithm when two nodes have the same code.Through the binary tree algorithm,a pre-computation of faults in the OBS network can be achieved.When a fault happens,we can locate it immediately and accurately.Examples have proved that the algorithm has general applicability.
This paper proposes an effective method of fault location based on a binary tree for optical burst switching (OBS) network. To minimize the monitoring cost, we divide the network into several monitor domains by introducing monitoring-cycle algorithms. In order to generate an exclusive we modify the monitoring cycle algorithm when two nodes have the same code.Through the binary tree algorithm, a pre-computation of faults in the OBS network can be achieved. Who can locate it immediately and accurately. Examples have proved that the algorithm has general applicability.