{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:43:39Z","timestamp":1648601019035},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf01158961","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T18:25:20Z","timestamp":1108578320000},"page":"339-361","source":"Crossref","is-referenced-by-count":1,"title":["A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events"],"prefix":"10.1007","volume":"16","author":[{"given":"George C.","family":"Polyzos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mart L.","family":"Molle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"D. Bertsekas and R. Gallager,Data Networks, 2nd ed., (Prentice-Hall, Englewood Cliffs, NJ, 1992).","edition":"2nd ed."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TIT.1985.1057014","volume":"IT-31","author":"G. Fayolle","year":"1985","unstructured":"G. Fayolle, P. Flajolet, M. Hofri and P. Jacquet, Analysis of a stack algorithm for random multiple-access communication, IEEE Trans. Inf. Theory IT-31 (1985) 244?254.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/JSAC.1987.1146613","volume":"SAC-5","author":"L. Georgiadis","year":"1987","unstructured":"L. Georgiadis, L.F. Merakos and P. Papantoni-Kazakos, A method for the delay analysis of random multiple-access algorithms whose delay process is regenerative, IEEE J. Sel. Areas Commun. SAC-5 (1987) 1051?1062.","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/26.225484","volume":"COM-41","author":"L. Georgiadis","year":"1993","unstructured":"L. Georgiadis and M. Paterakis, Bounds on the delay distribution of window random-access algorithms, IEEE Trans. Commun. COM-41 (1993) 683?693.","journal-title":"IEEE Trans. Commun."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TIT.1985.1057016","volume":"IT-31","author":"J. Huang","year":"1985","unstructured":"J. Huang and T. Berger, Delay analysis of interval-searching contention resolution algorithms, IEEE Trans. Inf. Theory IT-31 (1985) 264?273.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1109\/TCOM.1986.1096639","volume":"COM-34","author":"J.-C. Huang","year":"1986","unstructured":"J.-C. Huang and T. Berger, Delay analysis of 0.487 contention resolution algorithms, IEEE Trans. Commun. COM-34 (1986) 916?926.","journal-title":"IEEE Trans. Commun."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1109\/TCOM.1975.1092768","volume":"COM-23","author":"L. Kleinrock","year":"1975","unstructured":"L. Kleinrock and F.A. Tobagi, Packet switching in radio channels: Part 1 ? Carrier sense multiple-access modes and their throughput-delay characteristics, IEEE Trans. Commun. COM-23 (1975) 1400?1416.","journal-title":"IEEE Trans. Commun."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1109\/26.61368","volume":"COM-38","author":"J.F. Kurose","year":"1990","unstructured":"J.F. Kurose, A. Shrivastava and D. Towsley, Stack algorithms for random multiple-access networks in the presence of asymmetric feedback, IEEE Trans. Commun. COM-38 (1990) 1308?1313.","journal-title":"IEEE Trans. Commun."},{"key":"CR9","volume-title":"Multi-User Communications","author":"J.L. Massey","year":"1981","unstructured":"J.L. Massey, Collision-resolution algorithms and random-access communications, in:Multi-User Communications, ed. G. Longo (Springer, New York, 1981)."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"J.L. Massey (ed.), Special issue on random-access communications, IEEE Trans. Inf. Theory IT-31 (1985).","DOI":"10.1109\/TIT.1985.1057027"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"P. Mathys and P. Flajolet, Q-ary collision resolution algorithms in random-access systems with free or blocked channel access, IEEE Trans. Inf. Theory IT-31 (1985).","DOI":"10.1109\/TIT.1985.1057013"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/18.21217","volume":"IT-34","author":"L. Merakos","year":"1988","unstructured":"L. Merakos and C. Bisdikian, Delay analysis of then-ary stack random-access algorithm, IEEE Trans. Inf. Theory IT-34 (1988) 931?942.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"M.L. Molle, Asynchronous multiple access tree algorithms,Proc. ACM Symp. on Communications Architectures and Protocols (ACM SIGCOMM '83) (March 1983).","DOI":"10.1145\/1035237.1035279"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"M.L. Molle and L. Kleinrock, Virtual time CSMA: Why two clocks are better than one, IEEE Trans. Commun. COM-33 (1985).","DOI":"10.1109\/TCOM.1985.1096402"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-5316(89)90045-X","volume":"9","author":"M.L. Molle","year":"1989","unstructured":"M.L. Molle, Analysis of a class of distributed queues with applications, Perf. Eval. 9 (1989) 271?286.","journal-title":"Perf. Eval."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TCOM.1987.1096710","volume":"COM-35","author":"G.C. Polyzos","year":"1987","unstructured":"G.C. Polyzos, M.L. Molle and A.N. Venetsanopoulos, Performance analysis of finite non-homogeneous population tree conflict resolution algorithms using constant size window access, IEEE Trans. Commun. COM-35 (1987) 1124?1138.","journal-title":"IEEE Trans. Commun."},{"key":"CR17","unstructured":"G.C. Polyzos and M.L. Molle, A generalized busy period approach to the delay analysis of window access tree conflict resolution algorithms,Proc. IEEE ICC '87, Seattle, WA (June 1987)."},{"key":"CR18","series-title":"Ph.D. Dissertation","volume-title":"Technical Report CSRI-224","author":"G.C. Polyzos","year":"1989","unstructured":"G.C. Polyzos, A queueing theoretic approach to the delay analysis for a class of conflict resolution algorithms, Technical Report CSRI-224, Computer Systems Research Institute, University of Toronto, Toronto, Canada (March 1989) (Ph.D. Dissertation)."},{"key":"CR19","volume-title":"Technical Report CS 90-179","author":"G.C. Polyzos","year":"1990","unstructured":"G.C. Polyzos and M.L. Molle, Delay analysis for the FCFS 0.487 conflict resolution algorithm, Technical Report CS 90-179, Dept. of Computer Science and Engineering, University of California, San Diego, La Jolla, CA (October 1990)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1109\/18.265498","volume":"IT-39","author":"G.C. Polyzos","year":"1993","unstructured":"G.C. Polyzos and M.L. Molle, A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm, IEEE Trans. Inf. Theory IT-39 (1993) 1887?1906.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3402-9","volume-title":"Multiple Access Protocols","author":"R. Rom","year":"1990","unstructured":"R. Rom and M. Sidi,Multiple Access Protocols (Springer, New York, NY, 1990)."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.34.4.619","volume":"34","author":"L.D. Servi","year":"1986","unstructured":"L.D. Servi,D\/G\/1 queues with vacations, Oper. Res. 34 (1986) 619?629.","journal-title":"Oper. Res."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0169-7552(90)90109-6","volume":"18","author":"T. Suda","year":"1990","unstructured":"T. Suda, J. Jungok Bae and D.C. Baxter, The robustness and performance of tree collision resolution algorithms in an unshared feedback error environment, Comp. Networks ISDN Syst. 18 (1990) 275?292.","journal-title":"Comp. Networks ISDN Syst."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1109\/TC.1982.1676077","volume":"C-31","author":"D. Towsley","year":"1982","unstructured":"D. Towsley and G. Venkatesh, Window random access protocols for local computer networks, IEEE Trans. Comp. C-31 (1982) 715?722.","journal-title":"IEEE Trans. Comp."},{"key":"CR25","first-page":"76","volume":"18","author":"B.S. Tsybakov","year":"1982","unstructured":"B.S. Tsybakov and N.B. Likhanov, Upper bound for the delay in a multiple-random-access system with a splitting algorithm, Problemy Peredachi Informatsii 18 (1982) 76?84.","journal-title":"Problemy Peredachi Informatsii"},{"key":"CR26","first-page":"69","volume":"21","author":"B.S. Tsybakov","year":"1985","unstructured":"B.S. Tsybakov and N.B. Likhanov, Some new random multiple-access algorithms, Problemy Peredachi Informatsii 21 (1985) 69?89.","journal-title":"Problemy Peredachi Informatsii"},{"key":"CR27","first-page":"69","volume":"19","author":"N.D. Vvedenskaya","year":"1983","unstructured":"N.D. Vvedenskaya and B.S. Tsybakov, Random multiple access of packets to a channel with errors, Problemy Peredachi Informatsii 19 (1983) 69?84.","journal-title":"Problemy Peredachi Informatsii"},{"key":"CR28","first-page":"94","volume":"24","author":"N.D. Vvedenskaya","year":"1988","unstructured":"N.D. Vvedenskaya and B.S. Tsybakov, Computing packet delay for some random multiple access stack algorithms, Problemy Peredachi Informatsii 24 (1988) 94?101.","journal-title":"Problemy Peredachi Informatsii"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","volume":"IT-31","author":"J.K. Wolf","year":"1985","unstructured":"J.K. Wolf, Born again group testing: multiaccess communications, IEEE Trans. Inf. Theory IT-31 (1985) 185?191.","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01158961.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01158961\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01158961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:01:04Z","timestamp":1586116864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01158961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":29,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF01158961"],"URL":"https:\/\/doi.org\/10.1007\/bf01158961","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}