Optimal routing in a network with unreliable links

A.A. Economides, J. Silvester
{"title":"Optimal routing in a network with unreliable links","authors":"A.A. Economides, J. Silvester","doi":"10.1109/CNS.1988.5007","DOIUrl":null,"url":null,"abstract":"An investigation is conducted of the routing of packets in a network in which the link error rates vary. A queuing network model that incorporates the effect of the link error rates is developed and is used to find optimal routing assignments for fixed error rates. Single-path and multiple-path dynamic routing algorithms that minimize the average packet delay or the failure probability of packet transmission are proposed. In case the network state is not exactly known, stochastic learning automata are proposed to drive the routing process.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.5007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

An investigation is conducted of the routing of packets in a network in which the link error rates vary. A queuing network model that incorporates the effect of the link error rates is developed and is used to find optimal routing assignments for fixed error rates. Single-path and multiple-path dynamic routing algorithms that minimize the average packet delay or the failure probability of packet transmission are proposed. In case the network state is not exactly known, stochastic learning automata are proposed to drive the routing process.<>
链路不可靠网络中的最优路由
在一个链路错误率变化的网络中,对数据包的路由进行调查。建立了考虑链路错误率影响的排队网络模型,并将其用于寻找固定错误率下的最优路由分配。提出了最小化平均数据包延迟或数据包传输失败概率的单路径和多路径动态路由算法。在网络状态不完全已知的情况下,提出了随机学习自动机来驱动路由过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信