Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/72586
DC Field | Value | |
---|---|---|
dc.title | Distribution of token interarrival times in a counter-rotating double-ring network | |
dc.contributor.author | Wong, T.C. | |
dc.contributor.author | Chua, K.C. | |
dc.contributor.author | Lye, K.M. | |
dc.date.accessioned | 2014-06-19T05:09:43Z | |
dc.date.available | 2014-06-19T05:09:43Z | |
dc.date.issued | 1995 | |
dc.identifier.citation | Wong, T.C., Chua, K.C., Lye, K.M. (1995). Distribution of token interarrival times in a counter-rotating double-ring network. IEEE International Conference on Communications 2 : 945-949. ScholarBank@NUS Repository. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/72586 | |
dc.description.abstract | We present an approximate analysis of the token interarrival time distribution of a counter-rotating double-ring network with limited service discipline. The first and second moments of the token interarrival times are derived. We show that these two moments, obtained by assuming the token interarrival times to be uniformly distributed between zero and the mean token rotation time in either ring [2], are numerically close to our results. Thus, for the purpose of obtaining numerical results for the mean waiting delay of the double-ring token ring network as in [1,2], the assumption that the token interarrival times are uniformly distributed is reasonable. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.contributor.department | CENTRE FOR WIRELESS COMMUNICATIONS | |
dc.description.sourcetitle | IEEE International Conference on Communications | |
dc.description.volume | 2 | |
dc.description.page | 945-949 | |
dc.description.coden | 00211 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.