{"title":"A new synchronization algorithm for hitless protection switching in ATM networks","authors":"A. Iselt","doi":"10.1109/PCCC.1999.749461","DOIUrl":null,"url":null,"abstract":"Redundant transmission on disjoint paths is a common precaution against the effects of failures in communication networks. To allow hitless switching from one path to the other, synchronization algorithms are required. Most of the current algorithms are based on supplementary synchronization information (e.g. synchronization cells). A novel algorithm for the synchronization and selection of redundant data streams is proposed, which allows hitless switching without supplementary information. The algorithm achieves synchronization based on the correlation of the user information. Further, it provides a fast synchronization detection time and is tolerant against loss and errors of single cells in one data path. Analytical analysis as well as simulation show the correctness and efficiency of the novel algorithm.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1999.749461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Redundant transmission on disjoint paths is a common precaution against the effects of failures in communication networks. To allow hitless switching from one path to the other, synchronization algorithms are required. Most of the current algorithms are based on supplementary synchronization information (e.g. synchronization cells). A novel algorithm for the synchronization and selection of redundant data streams is proposed, which allows hitless switching without supplementary information. The algorithm achieves synchronization based on the correlation of the user information. Further, it provides a fast synchronization detection time and is tolerant against loss and errors of single cells in one data path. Analytical analysis as well as simulation show the correctness and efficiency of the novel algorithm.