Analytic solution of an integrated performance model of a computer communication network with window flow control

Alexander Thomasian, Paul F. Bay
{"title":"Analytic solution of an integrated performance model of a computer communication network with window flow control","authors":"Alexander Thomasian, Paul F. Bay","doi":"10.1145/800056.802082","DOIUrl":null,"url":null,"abstract":"A method for analyzing the performance of computer communication networks using queueing network models (QNM's) is presented in this paper. The user/computer sites are interconnected by a wide-area network with an end-to-end window flow-control mechanism. The QNM for the system including the communication subnet and the host computers is intractable because of blocking due to window flow control and memory constraints at computer systems, even under otherwise analytically favorable assumptions. The approximate solution method, which is based on iteration and decomposition, combines several recently developed computationally inexpensive algorithms to compute user response times, taking into account the delay in the communication network and the processing time at computer systems. We also introduce a fast non-iterative procedure to analyze QNM's with external arrivals and with population size constraints, such that blocked customers are queued. The effect of the choice of window sizes and minimum link/bifurcated routing on system performance is investigated.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800056.802082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A method for analyzing the performance of computer communication networks using queueing network models (QNM's) is presented in this paper. The user/computer sites are interconnected by a wide-area network with an end-to-end window flow-control mechanism. The QNM for the system including the communication subnet and the host computers is intractable because of blocking due to window flow control and memory constraints at computer systems, even under otherwise analytically favorable assumptions. The approximate solution method, which is based on iteration and decomposition, combines several recently developed computationally inexpensive algorithms to compute user response times, taking into account the delay in the communication network and the processing time at computer systems. We also introduce a fast non-iterative procedure to analyze QNM's with external arrivals and with population size constraints, such that blocked customers are queued. The effect of the choice of window sizes and minimum link/bifurcated routing on system performance is investigated.
带窗口流控制的计算机通信网络综合性能模型的解析解
提出了一种利用排队网络模型(QNM's)分析计算机通信网络性能的方法。用户/计算机站点通过具有端到端窗口流量控制机制的广域网相互连接。包括通信子网和主机在内的系统的QNM是难以处理的,因为在计算机系统中由于窗口流控制和内存约束而阻塞,即使在其他有利的分析假设下也是如此。基于迭代和分解的近似解方法结合了最近开发的几种计算成本低廉的算法来计算用户响应时间,同时考虑了通信网络中的延迟和计算机系统的处理时间。我们还引入了一个快速的非迭代过程来分析具有外部到达和人口规模约束的QNM,这样被阻塞的客户就会排队。研究了窗口大小和最小链路/分叉路由的选择对系统性能的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信