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