{"title":"Study on N-Policy Working Vacation Polling System for WDM","authors":"Xingjie Hui, Haiyan Chen, N. Tian, Lu Donghua","doi":"10.1109/ICCSN.2009.120","DOIUrl":null,"url":null,"abstract":"In the paper, we propose a N-policy working vacation scheme cyclic polling system for WDM. This system consists of multi-queues (terminals) whose service rates are one of the fast speed and lower speed. The fast speed mode moves cyclically from queue to queue with N-policy. Using the decomposition approach, each queue is analyzed as a single server queue with N-policy working vacation, which works at a different rate, rather than completely stops during the vacation polling period. Using quasi birth and death chain and matrix geometric solution method, we give some performance parameters, such as the mean number and mean waiting time of packet in the queue, the mean throughput. Finally, we analyze the effect of the parameters on the mean waiting time and mean throughput through numerical examples.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Communication Software and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2009.120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In the paper, we propose a N-policy working vacation scheme cyclic polling system for WDM. This system consists of multi-queues (terminals) whose service rates are one of the fast speed and lower speed. The fast speed mode moves cyclically from queue to queue with N-policy. Using the decomposition approach, each queue is analyzed as a single server queue with N-policy working vacation, which works at a different rate, rather than completely stops during the vacation polling period. Using quasi birth and death chain and matrix geometric solution method, we give some performance parameters, such as the mean number and mean waiting time of packet in the queue, the mean throughput. Finally, we analyze the effect of the parameters on the mean waiting time and mean throughput through numerical examples.