{"title":"消息延迟限制同步通信和排队系统的性能分析","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":"{\"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}","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}
Performance analysis of message delay limited synchronous communication and queueing systems
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.<>