{"title":"一类排队系统的内在过载控制分析","authors":"Y. T. Wang","doi":"10.1145/800199.806168","DOIUrl":null,"url":null,"abstract":"We consider a priority queueing system which consists of two queues sharing a processor and in which there is delayed feedback. Such a model arises from systems which employ a priority assignment scheme to achieve overload control. An analytic expression for the stationary probability of the queue lengths is derived. An algorithm is proposed to compute the queue lengths distribution. Some numerical results are illustrated.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"33 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"1980-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Analysis of an intrinsic overload control for a class of queueing systems\",\"authors\":\"Y. T. Wang\",\"doi\":\"10.1145/800199.806168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a priority queueing system which consists of two queues sharing a processor and in which there is delayed feedback. Such a model arises from systems which employ a priority assignment scheme to achieve overload control. An analytic expression for the stationary probability of the queue lengths is derived. An algorithm is proposed to compute the queue lengths distribution. Some numerical results are illustrated.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"33 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800199.806168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800199.806168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of an intrinsic overload control for a class of queueing systems
We consider a priority queueing system which consists of two queues sharing a processor and in which there is delayed feedback. Such a model arises from systems which employ a priority assignment scheme to achieve overload control. An analytic expression for the stationary probability of the queue lengths is derived. An algorithm is proposed to compute the queue lengths distribution. Some numerical results are illustrated.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
