独立于帧内容的令牌环剥离

K. Ramakrishnan, Henry S. Yang
{"title":"独立于帧内容的令牌环剥离","authors":"K. Ramakrishnan, Henry S. Yang","doi":"10.1109/LCN.1990.128687","DOIUrl":null,"url":null,"abstract":"A frame content independent stripping (FCIS) algorithm for token rings is described that can be used by source-routing bridges due to its simplicity and the fact that the resulting size of the fragments remaining on the ring is very small. The FCIS algorithm counts the number of outstanding frames that a station has transmitted but not yet stripped from the ring and in addition places a global delimiter such as a void frame at the end of the transmission of the information frames. The station then stops stripping when either the count goes to zero or when the void frame or token is received by the station. The algorithm is simple to implement and does not place any topological restrictions on the network. It also allows for interoperation with stations which do not implement the FCIS algorithm. With the FCIS algorithm, frames are stripped at the earliest possible moment. It is shown that the combination of both the count and void is necessary for an FCIS algorithm by demonstrating that the inclusion of either just the void or the count could result in considerable overstripping of frames on the ring due to errors on the ring. The void frame adds a total of 28 bytes of overhead to every transmission opportunity at a participating station.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Frame content independent stripping for token rings\",\"authors\":\"K. Ramakrishnan, Henry S. Yang\",\"doi\":\"10.1109/LCN.1990.128687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A frame content independent stripping (FCIS) algorithm for token rings is described that can be used by source-routing bridges due to its simplicity and the fact that the resulting size of the fragments remaining on the ring is very small. The FCIS algorithm counts the number of outstanding frames that a station has transmitted but not yet stripped from the ring and in addition places a global delimiter such as a void frame at the end of the transmission of the information frames. The station then stops stripping when either the count goes to zero or when the void frame or token is received by the station. The algorithm is simple to implement and does not place any topological restrictions on the network. It also allows for interoperation with stations which do not implement the FCIS algorithm. With the FCIS algorithm, frames are stripped at the earliest possible moment. It is shown that the combination of both the count and void is necessary for an FCIS algorithm by demonstrating that the inclusion of either just the void or the count could result in considerable overstripping of frames on the ring due to errors on the ring. The void frame adds a total of 28 bytes of overhead to every transmission opportunity at a participating station.<<ETX>>\",\"PeriodicalId\":122950,\"journal\":{\"name\":\"[1990] Proceedings. 15th Conference on Local Computer Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Proceedings. 15th Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1990.128687\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. 15th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1990.128687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

描述了一种用于令牌环的帧内容独立剥离(FCIS)算法,由于它的简单性和在环上保留的片段的最终大小非常小,因此可以由源路由桥使用。FCIS算法计算站点已传输但尚未从环中删除的未完成帧的数量,并在信息帧传输结束时放置一个全局分隔符,例如空白帧。当计数变为零或当站点接收到空帧或令牌时,站点停止剥离。该算法实现简单,对网络没有任何拓扑限制。它还允许与不执行FCIS算法的站点进行互操作。在FCIS算法中,帧在尽可能早的时刻被剥离。通过证明仅包含void或count可能导致由于环上错误而导致环上帧的相当大的覆盖,表明计数和void的组合对于FCIS算法是必要的。空帧在参与的站点的每个传输机会上总共增加了28字节的开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Frame content independent stripping for token rings
A frame content independent stripping (FCIS) algorithm for token rings is described that can be used by source-routing bridges due to its simplicity and the fact that the resulting size of the fragments remaining on the ring is very small. The FCIS algorithm counts the number of outstanding frames that a station has transmitted but not yet stripped from the ring and in addition places a global delimiter such as a void frame at the end of the transmission of the information frames. The station then stops stripping when either the count goes to zero or when the void frame or token is received by the station. The algorithm is simple to implement and does not place any topological restrictions on the network. It also allows for interoperation with stations which do not implement the FCIS algorithm. With the FCIS algorithm, frames are stripped at the earliest possible moment. It is shown that the combination of both the count and void is necessary for an FCIS algorithm by demonstrating that the inclusion of either just the void or the count could result in considerable overstripping of frames on the ring due to errors on the ring. The void frame adds a total of 28 bytes of overhead to every transmission opportunity at a participating station.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信