1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, CJen_US
dc.contributor.authorHWANG, LCen_US
dc.date.accessioned2014-12-08T15:03:50Z-
dc.date.available2014-12-08T15:03:50Z-
dc.date.issued1994-08-01en_US
dc.identifier.issn0916-8516en_US
dc.identifier.urihttp://hdl.handle.net/11536/2369-
dc.description.abstractA new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.en_US
dc.language.isoen_USen_US
dc.subjectGATED SERVICE DISCIPLINEen_US
dc.subjectGENERAL SERVICE ORDER SEQUENCEen_US
dc.subjectIMBEDDED MARKOV CHAINen_US
dc.subjectSTATIONen_US
dc.subjectSTAGEen_US
dc.subjectRECURSIVE METHODen_US
dc.titleA NEW RECURSIVE METHOD FOR THE MEAN WAITING TIME IN A POLLING NETWORK WITH GATED GENERAL ORDER SERVICEen_US
dc.typeArticleen_US
dc.identifier.journalIEICE TRANSACTIONS ON COMMUNICATIONSen_US
dc.citation.volumeE77Ben_US
dc.citation.issue8en_US
dc.citation.spage985en_US
dc.citation.epage991en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.department電信研究中心zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.contributor.departmentCenter for Telecommunications Researchen_US
dc.identifier.wosnumberWOS:A1994PD53500001-
dc.citation.woscount0-
Appears in Collections:Articles


Related Contents
Loading...