{"title":"BIP-Based Alarm Declaration and Clearing in SONET Networks Employing Automatic Protection Switching","authors":"Vitalice K. Oduol, C. Ardil","volume":60,"journal":"International Journal of Electrical and Computer Engineering","pagesStart":1944,"pagesEnd":1950,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/6347","abstract":"
The paper examines the performance of bit-interleaved parity (BIP) methods in error rate monitoring, and in declaration and clearing of alarms in those transport networks that employ automatic protection switching (APS). The BIP-based error rate monitoring is attractive for its simplicity and ease of implementation. The BIP-based results are compared with exact results and are found to declare the alarms too late, and to clear the alarms too early. It is concluded that the standards development and systems implementation should take into account the fact of early clearing and late declaration of alarms. The window parameters defining the detection and clearing thresholds should be set so as to build sufficient hysteresis into the system to ensure that BIP-based implementations yield acceptable performance results.<\/p>\r\n","references":"[1] SONET Transport Systems; Common Generic Criteria, Bellcore\r\npublication GR-253 CORE, Section 5.3\r\n[2] ANSI T1.105: SONET - Basic Description including Multiplex\r\nStructure, Rates and Formats\r\n[3] ANSI T1.105.01: SONET - Automatic Protection Switching\r\n[4] ANSI T1.105.07: SONET - Sub-STS-1 Interface Rates and Formats\r\nSpecification\r\n[5] International Engineering Consortium, \"SONET Tutorial\", Available\r\nhttp:\/\/www.iec.org\/online\/tutorials\/sonet\/topic03.asp\r\n[6] U. Black, S. Waters, Sonet and T1: Architectures for Digital Transport\r\nNetworks, 2nd ed, Prentice Hall, 2005\r\n[7] M.N. Ellanti, S.S. Gorshe, L.G. Raman, W.D. Grover, Next Generation\r\nTransport Networks: Data,Mmanagement, and Control Planes,\r\nSpringer, 2005\r\n[8] H. G. Perros, Connection-Oriented Networks: SONET\/SDH, ATM,\r\nMPLS, and Optical Networks, Wiley 2005\r\n[9] D. Chkliaev, J. Hooman ,E. de Vink, \"Formal Verification of an\r\nImproved Sliding Window Protocol\" in Proc. 3rd Progress Symposium\r\non Embedded Systems, 2002, Utrecht, The Nethelands, October 2002,\r\npages 77-82.\r\n[10] Mark A. Smith and Nils Klarlund. Verification of a Sliding Window\r\nProtocol Using IOA and MONA. FORTE\/PSTV 2000, Pisa, Italy,\r\nOctober 2000, pages 19-34.\r\n[11] Eric Madelaine and Didier Vergamini. Specification and Verification of a\r\nSliding Window Protocol in LOTOS. FORTE '91, Sydney, Australia,\r\nNovember 1991, pages 495-510.\r\n[12] Y. Deng, Z. Huang, \"Modeling and Performance Analysis of a Sliding\r\nWindow Protocol\" Proc. 4th Progress Symposium on Embedded\r\nSystems, pp. 60-65, Utrecht, STW, The Netherlands October 2003","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 60, 2011"}