{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:08:33Z","timestamp":1762322913017,"version":"3.41.2"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,11]]},"DOI":"10.1109\/tit.1983.1056748","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"914-918","source":"Crossref","is-referenced-by-count":27,"title":["The throughput time delay function of anM\/M\/1queue (Corresp.)"],"prefix":"10.1109","volume":"29","author":[{"given":"A.","family":"Lazar","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Congestion control of store-and-forward networks by input buffer limits?An analysis","volume":"com 27","author":"lam","year":"1979","journal-title":"IEEE Trans Commun"},{"key":"ref3","first-page":"43.1.1","article-title":"Power and deterministic rules of thumb for probabilistic problems in computer communications","author":"kleinrock","year":"1979","journal-title":"Conf Rec Int Conf Commun"},{"key":"ref6","first-page":"242","author":"schwartz","year":"1976","journal-title":"Computer Communication Networks Design and Analysis"},{"journal-title":"Optimal information processing using counting point process observations","year":"1980","author":"lazar","key":"ref5"},{"key":"ref8","first-page":"122","author":"gerla","year":"1981","journal-title":"Protocols and Techniques for Data Communication Networks"},{"journal-title":"Routing and flow control in data networks","year":"1980","author":"schwartz","key":"ref7"},{"key":"ref2","first-page":"147","author":"kleinrock","year":"1975","journal-title":"Queueing Systems Volume I Theory"},{"key":"ref9","first-page":"137","author":"tanenbaum","year":"1981","journal-title":"Computer Networks"},{"key":"ref1","first-page":"23.3.1","article-title":"Optimum end-to-end flow control in networks","author":"bharath-kumar","year":"1980","journal-title":"Conf Rec Int Conf Commun"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22735\/01056748.pdf?arnumber=1056748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:39Z","timestamp":1753121259000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056748\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":9,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056748","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}