{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:20:35Z","timestamp":1648938035213},"reference-count":22,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0140-3664(91)90108-d","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T22:34:07Z","timestamp":1060295647000},"page":"507-514","source":"Crossref","is-referenced-by-count":13,"title":["Priorities and protocols in hard real-time LANs: implementing a crisis-free system"],"prefix":"10.1016","volume":"14","author":[{"given":"J","family":"Santos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.L.","family":"Gastaminza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J","family":"Orozco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D","family":"Picardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O","family":"Alimenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No 1","key":"10.1016\/0140-3664(91)90108-D_BIB1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/861.870","article-title":"Multiple-access protocols and time-constrained communications","volume":"Vol 16","author":"Kurose","year":"1984","journal-title":"Comput. Surv."},{"key":"10.1016\/0140-3664(91)90108-D_BIB2","series-title":"Proc. Symposium on Computers and Automata","first-page":"265","article-title":"On priorities and transferences in computer systems and networks","volume":"Vol XXI","author":"Santos","year":"1971"},{"key":"10.1016\/0140-3664(91)90108-D_BIB3","series-title":"Proc. INFOCOM '89","first-page":"1020","article-title":"Performance evaluation of standard LAN protocols in time-constrained environments","author":"Santos","year":"1989"},{"issue":"No 4","key":"10.1016\/0140-3664(91)90108-D_BIB4","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real time environments","volume":"Vol 19","author":"Liu","year":"1973","journal-title":"J.ACM"},{"issue":"No 9","key":"10.1016\/0140-3664(91)90108-D_BIB5","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1109\/12.57059","article-title":"A window protocol for transmission of time-constrained messages","volume":"Vol 39","author":"Thao","year":"1990","journal-title":"IEEE Trans. Comput."},{"issue":"No 7","key":"10.1016\/0140-3664(91)90108-D_BIB6","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/TCOM.1980.1094751","article-title":"Packet switching in radio channels: conflict-free multiple access schemes","volume":"Vol 28","author":"Kleinrock","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(91)90108-D_BIB7","series-title":"Proc. INFOCOM '83","first-page":"405","article-title":"A family of window protocols for time-constrained applications in CSMA networks","author":"Kurose","year":"1983"},{"key":"10.1016\/0140-3664(91)90108-D_BIB8","series-title":"Proc. 8th Int. Data Commun. Symposium","first-page":"75","article-title":"Controlling time-window protocols for time-constrained communication in multiple access environment","author":"Kurose","year":"1983"},{"issue":"No 4","key":"10.1016\/0140-3664(91)90108-D_BIB9","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1109\/TCOM.1980.1094698","article-title":"Multiaccess protocols in packet communication systems","volume":"Vol 28","author":"Tobagi","year":"1980","journal-title":"IEEE Trans. Commun."},{"issue":"No 10","key":"10.1016\/0140-3664(91)90108-D_BIB10","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TCOM.1979.1094298","article-title":"Generalized TDMA: the multi-accessing tree protocol","volume":"Vol 27","author":"Capetamakis","year":"1979","journal-title":"IEEE Trans. Commun."},{"issue":"No 8","key":"10.1016\/0140-3664(91)90108-D_BIB11","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1109\/TCOM.1978.1094204","article-title":"An adaptive technique for local distribution","volume":"Vol 26","author":"Hayes","year":"1978","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(91)90108-D_BIB12","series-title":"Proc. Int. Commun. Conf.","first-page":"1C.3.1","article-title":"Further results on probing","author":"Grami","year":"1982"},{"key":"10.1016\/0140-3664(91)90108-D_BIB13","series-title":"Proc. IFIP Congress 77","first-page":"431","article-title":"MLMA: a collision-free multiaccess method","author":"Rothauser","year":"1977"},{"issue":"No 10","key":"10.1016\/0140-3664(91)90108-D_BIB14","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1109\/TCOM.1981.1094893","article-title":"Local-area subnetworks: a performance comparison","volume":"Vol 29","author":"Bux","year":"1981","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(91)90108-D_BIB15","series-title":"Local Area Networks: Token Ring Access Method: ANSI\/IEEE Standard 802.5","year":"1985"},{"key":"10.1016\/0140-3664(91)90108-D_BIB16","series-title":"Proc. Local Area Commun. Symposium","first-page":"49","article-title":"The Cambridge digital communication ring","author":"Wilkes","year":"1979"},{"key":"10.1016\/0140-3664(91)90108-D_BIB17","article-title":"Performance characteristics of the FDDI token ring priority mechanism","author":"Scott MacLean","year":"1989"},{"key":"10.1016\/0140-3664(91)90108-D_BIB18","series-title":"Local Area Networks: Token-Passing Bus Access Method: ANSI\/IEEE Standard 802.4","year":"1985"},{"key":"10.1016\/0140-3664(91)90108-D_BIB19","series-title":"Proc. 23rd Ann. Allerton Conf.","article-title":"An analysis of the silent channel access method","author":"Nadkarni","year":"1985"},{"issue":"No 8","key":"10.1016\/0140-3664(91)90108-D_BIB20","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/TCOM.1979.1094529","article-title":"BRAM: The Broadcast Recognizing Access Method","volume":"Vol 27","author":"Chlamtac","year":"1989","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(91)90108-D_BIB21","first-page":"83","article-title":"An efficient collision-free protocol for prioritized access control of cable or radio channels","volume":"Vol 7","author":"Gold","year":"1983","journal-title":"Comput. Networks"},{"key":"10.1016\/0140-3664(91)90108-D_BIB22","article-title":"A demand adaptive protocol to serve an LTC discipline","author":"Santos","year":"1987"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014036649190108D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014036649190108D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T08:51:15Z","timestamp":1552639875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/014036649190108D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["014036649190108D"],"URL":"https:\/\/doi.org\/10.1016\/0140-3664(91)90108-d","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}