Evaluation of error recovery schemes for a high-speed packet switched network: link-by-link versus edge-to-edge schemes

T. Suda, N. Watanabe
{"title":"Evaluation of error recovery schemes for a high-speed packet switched network: link-by-link versus edge-to-edge schemes","authors":"T. Suda, N. Watanabe","doi":"10.1109/INFCOM.1988.12984","DOIUrl":null,"url":null,"abstract":"An investigation is made of various error recovery schemes for a very-high-speed packet switched network. The schemes investigated are: (1) edge-to-edge recovery, whereby retransmission of erred packets only takes place between source and destination nodes, (2) link-by-link recovery, whereby retransmission only takes place between adjacent switching nodes, and (3) link-edge-combined recovery, using both link-by-link and edge-to-edge schemes. The performance measures are the distribution of transmission delay and error probability of packets across a network. To obtain these measures, the authors develop a tandem queuing network model with feedbacks, where each queue represents a protocol layer within a switching node rather than a switching node as a whole. Numerical results show that for a network with very-high-speed/low-error-rate channels, the edge-to-edge scheme gives the smallest packet transmission delay, while keeping the packet error probability sufficiently small. The only drawback of the edge-to-edge scheme is that it causes network saturation at smaller network traffic load than the older schemes.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.12984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

An investigation is made of various error recovery schemes for a very-high-speed packet switched network. The schemes investigated are: (1) edge-to-edge recovery, whereby retransmission of erred packets only takes place between source and destination nodes, (2) link-by-link recovery, whereby retransmission only takes place between adjacent switching nodes, and (3) link-edge-combined recovery, using both link-by-link and edge-to-edge schemes. The performance measures are the distribution of transmission delay and error probability of packets across a network. To obtain these measures, the authors develop a tandem queuing network model with feedbacks, where each queue represents a protocol layer within a switching node rather than a switching node as a whole. Numerical results show that for a network with very-high-speed/low-error-rate channels, the edge-to-edge scheme gives the smallest packet transmission delay, while keeping the packet error probability sufficiently small. The only drawback of the edge-to-edge scheme is that it causes network saturation at smaller network traffic load than the older schemes.<>
高速分组交换网络的错误恢复方案的评估:逐链路与边对边方案
研究了超高速分组交换网络中的各种错误恢复方案。所研究的方案有:(1)边到边恢复,即只在源节点和目标节点之间重传错误数据包;(2)逐链路恢复,即只在相邻交换节点之间重传;(3)链路边组合恢复,使用逐链路和边到边方案。性能指标是传输延迟的分布和数据包在网络中的错误概率。为了获得这些度量,作者开发了一个带反馈的串联排队网络模型,其中每个队列代表一个交换节点内的协议层,而不是作为一个整体的交换节点。数值结果表明,对于具有非常高速/低错误率信道的网络,边到边方案在保证包错误率足够小的情况下具有最小的包传输延迟。边缘到边缘方案的唯一缺点是,它会在比旧方案更小的网络流量负载下导致网络饱和。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信