{"title":"具有阈值服务器唤醒的M/G/1/ k型队列中的瞬态离开过程","authors":"W. Kempa, Dariusz Kurzyk","doi":"10.1109/SOFTCOM.2015.7314127","DOIUrl":null,"url":null,"abstract":"Time-dependent behavior of departure process in a finite-buffer M/G/1/K-type queueing system with threshold server's waking up is analysed. After each idle time a new busy period is being initialized simultaneously with the Nth arrival occurrence, where the threshold value N is fixed. By applying the approach being a mixture of different theoretical techniques: the idea of embedded Markov chain, Volterra type integral equations, continuous total probability law, renewal theory and linear algebra, a closed-form formula for the mixed double transform (probability generating function of Laplace transform) of the probability distribution of the number of packets completely processed up to fixed time t is derived. The considered queueing system can be used in modeling the operation of a wireless sensor network (WSN) with power saving mechanism based on “queued” waking up of radio transmitters/receivers of nodes (sensors). An illustrating numerical example for a hypothetical network traffic is attached as well.","PeriodicalId":264787,"journal":{"name":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Transient departure process in M/G/1/K-type queue with threshold server's waking up\",\"authors\":\"W. Kempa, Dariusz Kurzyk\",\"doi\":\"10.1109/SOFTCOM.2015.7314127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time-dependent behavior of departure process in a finite-buffer M/G/1/K-type queueing system with threshold server's waking up is analysed. After each idle time a new busy period is being initialized simultaneously with the Nth arrival occurrence, where the threshold value N is fixed. By applying the approach being a mixture of different theoretical techniques: the idea of embedded Markov chain, Volterra type integral equations, continuous total probability law, renewal theory and linear algebra, a closed-form formula for the mixed double transform (probability generating function of Laplace transform) of the probability distribution of the number of packets completely processed up to fixed time t is derived. The considered queueing system can be used in modeling the operation of a wireless sensor network (WSN) with power saving mechanism based on “queued” waking up of radio transmitters/receivers of nodes (sensors). An illustrating numerical example for a hypothetical network traffic is attached as well.\",\"PeriodicalId\":264787,\"journal\":{\"name\":\"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOFTCOM.2015.7314127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOFTCOM.2015.7314127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Transient departure process in M/G/1/K-type queue with threshold server's waking up
Time-dependent behavior of departure process in a finite-buffer M/G/1/K-type queueing system with threshold server's waking up is analysed. After each idle time a new busy period is being initialized simultaneously with the Nth arrival occurrence, where the threshold value N is fixed. By applying the approach being a mixture of different theoretical techniques: the idea of embedded Markov chain, Volterra type integral equations, continuous total probability law, renewal theory and linear algebra, a closed-form formula for the mixed double transform (probability generating function of Laplace transform) of the probability distribution of the number of packets completely processed up to fixed time t is derived. The considered queueing system can be used in modeling the operation of a wireless sensor network (WSN) with power saving mechanism based on “queued” waking up of radio transmitters/receivers of nodes (sensors). An illustrating numerical example for a hypothetical network traffic is attached as well.