{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T19:56:49Z","timestamp":1698004609758},"reference-count":12,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Store\u2010and\u2010forward communication networks may be designed so as to be free from store\u2010and\u2010forward deadlock. This is accomplished by incorporating in the network an acyclic buffer graph on which messages are forwarded, from buffer to buffer, according to all the desired routes. A technique producing minimum buffer graphs for a rather large class of networks is illustrated. Successively, a comparison is made with other well\u2010known deadlock avoidance techniques, showing that substantial savings can be achieved.<\/jats:p>","DOI":"10.1002\/net.3230170205","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:17:52Z","timestamp":1178921872000},"page":"187-200","source":"Crossref","is-referenced-by-count":5,"title":["Minimal deadlock\u2010free store\u2010and\u2010forward communication networks"],"prefix":"10.1002","volume":"17","author":[{"given":"G.","family":"Bongiovanni","sequence":"first","affiliation":[]},{"given":"D. P.","family":"Bovet","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096151"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/356586.356588"},{"key":"e_1_2_1_4_2","volume-title":"Communication Networks for Computers","author":"Davies D. W.","year":"1973"},{"key":"e_1_2_1_5_2","unstructured":"B.Gavish P. M.Merlin andP. J.Schweitzer Minimal buffer requirements for avoiding store and forward deadlock. IBM T. J. Watson Res. Cent. Yorktown Heights NY Rep. RC\u20106672 August (1977)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675690"},{"key":"e_1_2_1_7_2","first-page":"191","article-title":"Free buffer allocation\u2010an investigation by simulation","volume":"2","author":"Giessler A.","year":"1978","journal-title":"Comput. Networks"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1095021"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/356603.356607"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1972.1091202"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094666"},{"key":"e_1_2_1_12_2","unstructured":"E.RauboldandJ.Haenle A method of deadlock\u2010free resource allocation and flow control in packet networks. Proc. 3rd Int. Conf. Comput. Commun. Torondo Ont. Canada Aug.3\u20136 1976."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210044"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:25:23Z","timestamp":1697905523000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}