有限容量通信和排队系统在不同服务和缓冲区抢占策略下的性能

I. Rubin, M. Ouaily
{"title":"有限容量通信和排队系统在不同服务和缓冲区抢占策略下的性能","authors":"I. Rubin, M. Ouaily","doi":"10.1109/INFCOM.1988.12957","DOIUrl":null,"url":null,"abstract":"The authors carry out message delay and system throughput analysis for communication and telecommunications system applications which require the use of finite-capacity service systems using preemptive buffering (PB) disciplines. Such systems are of particular importance in situation where it is essential to provide short (and at times, bounded) message waiting-time delays, for messages which are selected for service. The authors analyze and compare the performance of such service systems, modeling them as finite capacity M/G/1/N queueing systems and using the service/buffering policies first-come-first-served/nonpreemptive buffering (FCFS/NPB), FCFS/PB, and last-come-first-served/preemptive buffering (LCFS/PB). They evaluate the performance tradeoffs offered by these policies, as they relate to the mean and variance of the waiting times of messages which are eventually served or eventually rejected/preempted.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"88 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Performance of finite capacity communication and queuing systems under various service and buffer preemption policies\",\"authors\":\"I. Rubin, M. Ouaily\",\"doi\":\"10.1109/INFCOM.1988.12957\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors carry out message delay and system throughput analysis for communication and telecommunications system applications which require the use of finite-capacity service systems using preemptive buffering (PB) disciplines. Such systems are of particular importance in situation where it is essential to provide short (and at times, bounded) message waiting-time delays, for messages which are selected for service. The authors analyze and compare the performance of such service systems, modeling them as finite capacity M/G/1/N queueing systems and using the service/buffering policies first-come-first-served/nonpreemptive buffering (FCFS/NPB), FCFS/PB, and last-come-first-served/preemptive buffering (LCFS/PB). They evaluate the performance tradeoffs offered by these policies, as they relate to the mean and variance of the waiting times of messages which are eventually served or eventually rejected/preempted.<<ETX>>\",\"PeriodicalId\":436217,\"journal\":{\"name\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"volume\":\"88 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"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.12957\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.12957","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

作者对通信和电信系统应用进行了消息延迟和系统吞吐量分析,这些应用需要使用使用先发制人缓冲(PB)规则的有限容量服务系统。这种系统在需要为选择用于服务的消息提供短(有时是有限的)消息等待时间延迟的情况下尤为重要。将这类服务系统建模为有限容量M/G/1/N排队系统,并采用先到先得/非抢占式缓冲(FCFS/NPB)、FCFS/PB和后来居上/抢占式缓冲(LCFS/PB)策略对其性能进行了分析和比较。他们评估这些策略提供的性能权衡,因为它们与最终服务或最终拒绝/抢占的消息的等待时间的平均值和方差有关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Performance of finite capacity communication and queuing systems under various service and buffer preemption policies
The authors carry out message delay and system throughput analysis for communication and telecommunications system applications which require the use of finite-capacity service systems using preemptive buffering (PB) disciplines. Such systems are of particular importance in situation where it is essential to provide short (and at times, bounded) message waiting-time delays, for messages which are selected for service. The authors analyze and compare the performance of such service systems, modeling them as finite capacity M/G/1/N queueing systems and using the service/buffering policies first-come-first-served/nonpreemptive buffering (FCFS/NPB), FCFS/PB, and last-come-first-served/preemptive buffering (LCFS/PB). They evaluate the performance tradeoffs offered by these policies, as they relate to the mean and variance of the waiting times of messages which are eventually served or eventually rejected/preempted.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multihoming in computer networks: a topology-design approach A model for optimal resource allocation in distributed computing systems Formal specification and analysis of DMI-an X-25 based protocol Performance analysis of computer communication networks with local and global window flow control Networking requirements of the Rapport multimedia conferencing system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1