双节点路由器网络的优化模型

N. Gülpinar, P. Harrison, B. Rustem, L. Pau
{"title":"双节点路由器网络的优化模型","authors":"N. Gülpinar, P. Harrison, B. Rustem, L. Pau","doi":"10.1109/MASCOT.2004.1348192","DOIUrl":null,"url":null,"abstract":"Architectural designs for routers and networks of routers to support mobile communication are analysed for their end-to-end performance using a simple Markov model. In view of the diverse design options, such models have many adjustable parameters and choosing the best set for a particular performance objective is a delicate and time-consuming task. We introduce an optimisation approach to automate this task, illustrated in a two-node, tandem network of routers with finite capacity and recovery buffers. We minimise the mean end-to-end delay subject to an upper limit on the rate of losses, which may be due to either full buffers or corrupted data. Losses at a full buffer are inferred by a time-out, whereas corrupted data is detected immediately on receipt of a packet at a router, causing a N-ACK to be sent upstream. Recovery buffers hold successfully transmitted packets so that, on receiving a N-ACK, the packet, if present, can be retransmitted, avoiding an expensive resend from source. Hence, a critical parameter that affects both loss rate and transmission time is the ratio of arrival-buffer size to recovery-buffer size. We develop a queueing model of this network and present graphs showing how end-to-end delay varies with certain parameter combinations. The tedious nature of trying to find the best parameter values in this way motivates our formal optimisation which yields optimal parameter values directly from the model specification using standard software.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"186 1","pages":"147-156"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An optimisation model for a two-node router network\",\"authors\":\"N. Gülpinar, P. Harrison, B. Rustem, L. Pau\",\"doi\":\"10.1109/MASCOT.2004.1348192\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Architectural designs for routers and networks of routers to support mobile communication are analysed for their end-to-end performance using a simple Markov model. In view of the diverse design options, such models have many adjustable parameters and choosing the best set for a particular performance objective is a delicate and time-consuming task. We introduce an optimisation approach to automate this task, illustrated in a two-node, tandem network of routers with finite capacity and recovery buffers. We minimise the mean end-to-end delay subject to an upper limit on the rate of losses, which may be due to either full buffers or corrupted data. Losses at a full buffer are inferred by a time-out, whereas corrupted data is detected immediately on receipt of a packet at a router, causing a N-ACK to be sent upstream. Recovery buffers hold successfully transmitted packets so that, on receiving a N-ACK, the packet, if present, can be retransmitted, avoiding an expensive resend from source. Hence, a critical parameter that affects both loss rate and transmission time is the ratio of arrival-buffer size to recovery-buffer size. We develop a queueing model of this network and present graphs showing how end-to-end delay varies with certain parameter combinations. The tedious nature of trying to find the best parameter values in this way motivates our formal optimisation which yields optimal parameter values directly from the model specification using standard software.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"186 1\",\"pages\":\"147-156\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2004.1348192\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2004.1348192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

使用简单的马尔可夫模型分析了支持移动通信的路由器和路由器网络的体系结构设计的端到端性能。鉴于不同的设计选项,这些模型有许多可调参数,为特定的性能目标选择最佳设置是一项微妙而耗时的任务。我们介绍了一种优化方法来自动完成这项任务,在一个具有有限容量和恢复缓冲区的路由器的双节点串联网络中进行了说明。我们最小化平均端到端延迟受制于损失率的上限,这可能是由于缓冲区满或数据损坏。缓冲区满时的损失是通过超时推断出来的,而损坏的数据是在路由器收到数据包时立即检测到的,导致向上游发送N-ACK。恢复缓冲区保存成功传输的数据包,以便在接收到N-ACK时,数据包(如果存在)可以重传,避免从源重新发送的昂贵的重发。因此,影响损失率和传输时间的一个关键参数是到达缓冲区大小与恢复缓冲区大小的比值。我们建立了该网络的排队模型,并给出了端到端延迟随某些参数组合变化的图。试图以这种方式找到最佳参数值的繁琐本质激发了我们的形式优化,即使用标准软件直接从模型规范中产生最佳参数值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An optimisation model for a two-node router network
Architectural designs for routers and networks of routers to support mobile communication are analysed for their end-to-end performance using a simple Markov model. In view of the diverse design options, such models have many adjustable parameters and choosing the best set for a particular performance objective is a delicate and time-consuming task. We introduce an optimisation approach to automate this task, illustrated in a two-node, tandem network of routers with finite capacity and recovery buffers. We minimise the mean end-to-end delay subject to an upper limit on the rate of losses, which may be due to either full buffers or corrupted data. Losses at a full buffer are inferred by a time-out, whereas corrupted data is detected immediately on receipt of a packet at a router, causing a N-ACK to be sent upstream. Recovery buffers hold successfully transmitted packets so that, on receiving a N-ACK, the packet, if present, can be retransmitted, avoiding an expensive resend from source. Hence, a critical parameter that affects both loss rate and transmission time is the ratio of arrival-buffer size to recovery-buffer size. We develop a queueing model of this network and present graphs showing how end-to-end delay varies with certain parameter combinations. The tedious nature of trying to find the best parameter values in this way motivates our formal optimisation which yields optimal parameter values directly from the model specification using standard software.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信