ATM网络中一种新的无命中保护交换同步算法

1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305) Pub Date : 1999-02-10 DOI:10.1109/PCCC.1999.749461

A. Iselt

{"title":"ATM网络中一种新的无命中保护交换同步算法","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":"{\"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}","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

摘要

在不相交的路径上进行冗余传输是防止通信网络故障影响的常用预防措施。为了允许从一条路径到另一条路径的无命中切换，需要同步算法。目前大多数算法都是基于补充同步信息(如同步单元)。提出了一种新的冗余数据流同步和选择算法，该算法可以在不需要补充信息的情况下实现无命中切换。该算法基于用户信息的相关性实现同步。此外，它提供了快速的同步检测时间，并且可以容忍单个数据路径中的单个单元的丢失和错误。分析和仿真结果表明了该算法的正确性和有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new synchronization algorithm for hitless protection switching in ATM networks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)

自引率

0.00%

发文量