Performance of finite capacity communication and queuing systems under various service and buffer preemption policies

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution? Pub Date : 1988-03-27 DOI:10.1109/INFCOM.1988.12957

I. Rubin, M. Ouaily

{"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}

引用次数: 7

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.<>

查看原文本刊更多论文

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

作者对通信和电信系统应用进行了消息延迟和系统吞吐量分析，这些应用需要使用使用先发制人缓冲(PB)规则的有限容量服务系统。这种系统在需要为选择用于服务的消息提供短(有时是有限的)消息等待时间延迟的情况下尤为重要。将这类服务系统建模为有限容量M/G/1/N排队系统，并采用先到先得/非抢占式缓冲(FCFS/NPB)、FCFS/PB和后来居上/抢占式缓冲(LCFS/PB)策略对其性能进行了分析和比较。他们评估这些策略提供的性能权衡，因为它们与最终服务或最终拒绝/抢占的消息的等待时间的平均值和方差有关。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?

自引率

0.00%

发文量