{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:14:28Z","timestamp":1761488068273},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[1985]]},"DOI":"10.1109\/tcom.1985.1096402","type":"journal-article","created":{"date-parts":[[2008,6,19]],"date-time":"2008-06-19T15:17:54Z","timestamp":1213888674000},"page":"919-933","source":"Crossref","is-referenced-by-count":62,"title":["Virtual Time CSMA: Why Two Clocks Are Better than One"],"prefix":"10.1109","volume":"33","author":[{"given":"M.","family":"Molle","sequence":"first","affiliation":[]},{"given":"L.","family":"Kleinrock","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref27a","article-title":"Free synchronous packet access in a broadcast channel with feedback","author":"tsybakov","year":"1980","journal-title":"Probl Inform Transmiss"},{"key":"ref29a","article-title":"Random multiple packet access: Part-and-try algorithm","year":"1981","journal-title":"Probl Inform Transmiss"},{"key":"ref27b","first-page":"32","volume":"14","year":"1978","journal-title":"Probl Peredachi Inform"},{"key":"ref29b","first-page":"65","volume":"16","year":"1980","journal-title":"Probl Peredachi Inform"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092768"},{"key":"ref11","author":"kleinrock","year":"1976","journal-title":"Queueing Systems Vol II Computer Applications"},{"key":"ref12","author":"konstantas","year":"1983","journal-title":"Virtual time CSMA A study"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092917"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.3.383"},{"key":"ref15","author":"massey","year":"1980","journal-title":"Collision-Resolution Algorithms and Random-Access Communications"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1145\/360248.360253","article-title":"Ethernet: Distributed packet switching for local computer networks","volume":"19","author":"metcalfe","year":"1976","journal-title":"Commun ACM"},{"key":"ref17","author":"molle","year":"1981","journal-title":"Unifications and extensions of the multiple access communications problem"},{"key":"ref22b","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"ref19","first-page":"295","article-title":"A simulation study of retransmission strategies for the asynchronous virtual-time CSMA protocol","author":"molle","year":"1983","journal-title":"Proc Performance '83 9th Int Symp Comput Perform Modeling Meas Eval"},{"key":"ref22a","author":"roberts","year":"1972","journal-title":"Aloha packet system with and without slots and capture"},{"key":"ref28","article-title":"Ergodicity of a slotted Aloha system","year":"1980","journal-title":"Probl Inform Transmiss"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092743"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/322017.322019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1035293.1035328"},{"key":"ref5","first-page":"74","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"Proc AFOSR Workshop Commun Theory AppL"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1978.11151"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094298"},{"key":"ref9","author":"kleinrock","year":"1975","journal-title":"Queueing Systems vol I Theory"},{"key":"ref1","first-page":"281","article-title":"The ALOHA system?Another alternative for computer communications","volume":"37","author":"abramson","year":"1970","journal-title":"AFIPS Conf Proc Fall Joint Comput Conf"},{"key":"ref18b","year":"1982","journal-title":"Tech Rep"},{"key":"ref18a","doi-asserted-by":"publisher","DOI":"10.1145\/1035237.1035279"},{"key":"ref20","author":"polyzos","year":"1984","journal-title":"Tree conflict resolution algorithms The non-homogeneous case"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094189"},{"key":"ref24","author":"tanenbaum","year":"1981","journal-title":"Computer Networks Englewoods Cliffs"},{"key":"ref23","author":"sevcik","year":"0","journal-title":"Private Communications"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094698"},{"key":"ref25","author":"tobagi","year":"1974","journal-title":"Random access techniques for data transmission over packet switched radio networks"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/23999\/01096402.pdf?arnumber=1096402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:42:05Z","timestamp":1638200525000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1096402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":33,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tcom.1985.1096402","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}