Performance analysis of message delay limited synchronous communication and queueing systems

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI:10.1109/INFCOM.1989.101433

I. Rubin, M. Ouaily

{"title":"Performance analysis of message delay limited synchronous communication and queueing systems","authors":"I. Rubin, M. Ouaily","doi":"10.1109/INFCOM.1989.101433","DOIUrl":null,"url":null,"abstract":"Analysis and performance comparisons are presented for synchronous discrete-time queuing systems operating under a message waiting-time or delay-time constraint. Four different system admission and preemption policies are investigated. Under either a wait-time constraint or a delay-time limit, either newly arriving messages are always admitted (and then properly dismissed if their required residence limits are not met) or a determination is made upon arrival on whether the new message can be served to completion within its required time limit, and only then is this message admitted. The delay-throughput performance of these admission and service-preemption policies is investigated and compared for synchronous discrete-time communications and processing systems modeled as a single-server Geom/G/1 discrete-time queuing system. Such models are used to describe various multiplexing and demand-assigned (reservation-based) multiple-access communication network systems operating under message delay limits.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Analysis and performance comparisons are presented for synchronous discrete-time queuing systems operating under a message waiting-time or delay-time constraint. Four different system admission and preemption policies are investigated. Under either a wait-time constraint or a delay-time limit, either newly arriving messages are always admitted (and then properly dismissed if their required residence limits are not met) or a determination is made upon arrival on whether the new message can be served to completion within its required time limit, and only then is this message admitted. The delay-throughput performance of these admission and service-preemption policies is investigated and compared for synchronous discrete-time communications and processing systems modeled as a single-server Geom/G/1 discrete-time queuing system. Such models are used to describe various multiplexing and demand-assigned (reservation-based) multiple-access communication network systems operating under message delay limits.<>

查看原文本刊更多论文

消息延迟限制同步通信和排队系统的性能分析

对在消息等待时间或延迟时间约束下运行的同步离散时间排队系统进行了分析和性能比较。研究了四种不同的系统准入和抢占策略。在等待时间约束或延迟时间限制下，要么总是允许新到达的消息(如果没有满足所需的停留限制，则适当地拒绝)，要么在到达时确定新消息是否可以在所需的时间限制内完成服务，然后才允许该消息。在单服务器Geom/G/1离散时间排队系统的同步离散时间通信和处理系统中，研究并比较了这些接纳和服务抢占策略的延迟吞吐量性能。这些模型用于描述在消息延迟限制下运行的各种多路复用和需求分配(基于预留的)多址通信网络系统。

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

求助全文

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

来源期刊

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies

自引率

0.00%

发文量