{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:10:17Z","timestamp":1648735817207},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Comput. Sci. & Technol."],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1007\/bf02948514","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T04:19:27Z","timestamp":1221193167000},"page":"259-266","source":"Crossref","is-referenced-by-count":2,"title":["An assignment method for IPUs in distributed systems"],"prefix":"10.1007","volume":"14","author":[{"given":"Liang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guowei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02948514_CR1","unstructured":"He C W. Automata Theory and Application. Science Press, 1990."},{"key":"BF02948514_CR2","unstructured":"Lazar A A, Orda A, Pendarakis D E. Virtual path bandwidth allocation in multi-user networks. InIEEE INFOCOM\u201995."},{"key":"BF02948514_CR3","doi-asserted-by":"crossref","unstructured":"Shenker S J. Making greed work in networks: a game-theoretic analysis of switch service disciplines.IEEE\/ACM Trans. Networking, Dec. 1995, 3.","DOI":"10.1109\/90.477727"},{"key":"BF02948514_CR4","doi-asserted-by":"crossref","unstructured":"Korilis Y A, Lazar A A, Orda A. Achieving network optima using stackelberg routing strategies.IEEE\/ACM Trans. Networking, Feb. 1997, Vol.5.","DOI":"10.1109\/90.554730"},{"key":"BF02948514_CR5","unstructured":"Tsetlin M L. Finite automata and modeling the simplest forms of actions. Ph.D. thesis, U.A.Steklov Math. Inst., 1964."},{"key":"BF02948514_CR6","doi-asserted-by":"crossref","unstructured":"Tung B, Kleinrock L. Using finite state automata to produce self-optimization and self-control.IEEE Trans. Parallel and Distributed System. Apr. 1996, Vol.7.","DOI":"10.1109\/71.494637"},{"key":"BF02948514_CR7","unstructured":"Qian S H. Operational Research. TsingHua University Press, 1990."},{"key":"BF02948514_CR8","unstructured":"Rabin M O. Probabilistic automata.Inf & Control, 1968, (12)."},{"key":"BF02948514_CR9","unstructured":"Tanenbaum A S. Distributed Operating Systems. Prentice-Hall, Inc., 1995."},{"key":"BF02948514_CR10","doi-asserted-by":"crossref","unstructured":"Zhang Z Z, Douligeris C. Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications.IEEE Trans. Communications, Aug. 1992, 40(8).","DOI":"10.1109\/26.156630"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948514.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02948514\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:03:07Z","timestamp":1558566187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02948514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["BF02948514"],"URL":"https:\/\/doi.org\/10.1007\/bf02948514","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}