{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:55:02Z","timestamp":1742403302588},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5934938","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T10:59:10Z","timestamp":1310036350000},"page":"1494-1502","source":"Crossref","is-referenced-by-count":14,"title":["The impact of storage capacity on end-to-end delay in time varying networks"],"prefix":"10.1109","author":[{"given":"George","family":"Iosifidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iordanis","family":"Koutsopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Smaragdakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180405"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/90.222926"},{"key":"ref12","first-page":"66","article-title":"Minimum Cost Flows Over Time without Intermediate Storage","author":"fleischer","year":"2003","journal-title":"Proc 14th ACM-SIAM Symp Discrete Algorithms"},{"article-title":"Algorithm Design","year":"2005","author":"kleinberg","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195238"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref16","article-title":"On Combining Shortest Path and Back Pressure Routing Over Multihop Wireless Networks","author":"ying","year":"2010","journal-title":"Proc of IEEE Infocom Mini Conference"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062262"},{"key":"ref18","article-title":"A Distributed Algorithm for the Maximum Flow Problem","author":"pham","year":"2005","journal-title":"Proc of ISPD"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015484"},{"article-title":"Flows in Networks","year":"1962","author":"ford","key":"ref3"},{"key":"ref6","article-title":"Good Things Come to Those Who (can) Wait or How to Handle Delay Tolerant Traffic and Make Peace on the Internet","author":"laoutaris","year":"2008","journal-title":"Proc of the ACM HotNets VI"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502217"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555376"},{"key":"ref2","article-title":"Parallel and Distributed Computation: Numerical Methods","author":"bertsekas","year":"1997","journal-title":"Athena Scientific"},{"key":"ref1","article-title":"Above the Clouds: A Berkeley View of Cloud Computing","author":"armbrust","year":"2009","journal-title":"Berkeley Technical Report (EECS-2009–28)"},{"key":"ref9","article-title":"An Annotated Overview of Dynamic Network Flows","author":"kotnyek","year":"2003","journal-title":"INRIA Technical Report No 4936"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1341431.1341442"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05934938.pdf?arnumber=5934938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:12:21Z","timestamp":1490065941000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934938\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5934938","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}