{"title":"对称单缓冲区马尔可夫多服务器多队列系统中动态轮询顺序的优劣","authors":"M. Marsan, S. Donatelli, F. Neri, U. Rubino","doi":"10.1109/INFCOM.1993.253235","DOIUrl":null,"url":null,"abstract":"Generalized stochastic Petri nets (GSPNs) are used to study the performances of several dynamic polling orders in symmetric multiserver multiqueue systems with one-buffer queues and Markovian interarrival, service, and walk times. Exact numerical results are obtained by means of Great-SPN, a software tool for the analysis of GSPNs, and are presented as curves of the average customer delay and waiting time. The results quantify the performance differences among the various polling orders, and show that the usual cyclic order can be the most effective, if the possibility of shorter walk times in the cyclic cases is adequately taken into account.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"44 7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Good and bad dynamic polling orders in symmetric single buffer Markovian multiserver multiqueue systems\",\"authors\":\"M. Marsan, S. Donatelli, F. Neri, U. Rubino\",\"doi\":\"10.1109/INFCOM.1993.253235\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generalized stochastic Petri nets (GSPNs) are used to study the performances of several dynamic polling orders in symmetric multiserver multiqueue systems with one-buffer queues and Markovian interarrival, service, and walk times. Exact numerical results are obtained by means of Great-SPN, a software tool for the analysis of GSPNs, and are presented as curves of the average customer delay and waiting time. The results quantify the performance differences among the various polling orders, and show that the usual cyclic order can be the most effective, if the possibility of shorter walk times in the cyclic cases is adequately taken into account.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"44 7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253235\",\"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 '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Good and bad dynamic polling orders in symmetric single buffer Markovian multiserver multiqueue systems
Generalized stochastic Petri nets (GSPNs) are used to study the performances of several dynamic polling orders in symmetric multiserver multiqueue systems with one-buffer queues and Markovian interarrival, service, and walk times. Exact numerical results are obtained by means of Great-SPN, a software tool for the analysis of GSPNs, and are presented as curves of the average customer delay and waiting time. The results quantify the performance differences among the various polling orders, and show that the usual cyclic order can be the most effective, if the possibility of shorter walk times in the cyclic cases is adequately taken into account.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
