{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:54:06Z","timestamp":1730224446376,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/glocom.2013.6831291","type":"proceedings-article","created":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T02:05:38Z","timestamp":1403316338000},"page":"1532-1537","source":"Crossref","is-referenced-by-count":2,"title":["A decentralized algorithm for Network Flow Optimization in mesh networks"],"prefix":"10.1109","author":[{"given":"Kiyoshi","family":"Nakayama","sequence":"first","affiliation":[]},{"given":"Toshio","family":"Koide","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/90.986592"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2196109"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2013.6754978"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1002\/cta.275"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2009.2036712"},{"key":"11","article-title":"On reducibility among combinatorial problems","author":"herrmann","year":"1973","journal-title":"Report No TR-113 Project MAC Massachusetts Institute of Technology"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/cta.155"},{"journal-title":"Flows in Networks","year":"1962","author":"ford","key":"3"},{"key":"2","first-page":"385","article-title":"Maximal flow in a lossy network","author":"fujisawa","year":"1963","journal-title":"Proc of First Annual Allerton Conference on Circuit and System Theory"},{"journal-title":"Network Flow and Testing Graph Connectivity","year":"1975","author":"even","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2001.956289"},{"journal-title":"A Simple Practical Distributed Multi-path Routing Algorithm","year":"1998","author":"chen","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662959"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0141-9331(00)00086-7"},{"journal-title":"Graph Theory with Exercises","year":"1983","author":"iri","key":"4"},{"key":"9","first-page":"2431","article-title":"A constrained multipath traffic engineering scheme for MPLS networks","author":"lee","year":"2002","journal-title":"IEEE International Conference on Communications (ICC)"},{"key":"8","first-page":"2833","article-title":"Traffic engineering with MPLS in the Internet","volume":"14","author":"xiao","year":"2000","journal-title":"IEEE Networks"}],"event":{"name":"2013 IEEE Global Communications Conference (GLOBECOM 2013)","start":{"date-parts":[[2013,12,9]]},"location":"Atlanta, GA","end":{"date-parts":[[2013,12,13]]}},"container-title":["2013 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6821297\/6831034\/06831291.pdf?arnumber=6831291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T17:29:32Z","timestamp":1490290172000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6831291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/glocom.2013.6831291","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}