Binary tree-based fault location algorithm for optical burst switching network

Abstract

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.

Keywords

Binary Tree / Fault Location / Wavelength Division Multiplex / Single Fault / Optical Burst Switching

References

[1] ColleD., DeM. S., DevelderC., et al.. IEEE Journal on Selected Areas in Communications, 2002, 20: 6

[2] Jun Sun, Study on Optical Communications, (2002), 10 (in Chinese)

[3] XingwenY., WeiC., ShiehW.. IEEE Photonics Technology Letters, 2006, 18: 1448

[4] LeiyaW., JiajianC.. Journal of Tsinghua University (Science and Technology), 2006, 46: 1797

[5] KilperD. C., BachR., BlumenthalD. J.. IEEE Journal of Lightwave Technology, 2004, 22: 294

[6] XiP., YanL., QianW., et al.. Computer Engineering, 2005, 31: 219

[7] RichterA., FischlerW., BockH., et al.. IEEE Proceedings of Optoelectronics, 2002, 149: 1

[8] WangJ., GuW.. Failure Location and Acta Photonic Sinica, 2005, 34: 1858

[9] ZengH., HuangC.. IEEE Communication Society GLOBECOM, 2004, 3: 2014

[10] ZengH., HuangC.. IEEE ICC’05, 2005, 3: 1726

[11] Bin Wu and K wan L. Yeung. Global Telecommunications Conference, GLOBECOM’06 IEEE, 2006, 1.

[12] WangR., ChangJ., LongK.. Journal of Optoelectronics. Laser., 2006, 17: 1477