{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:49Z","timestamp":1750221229945,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,6,13]],"date-time":"2018-06-13T00:00:00Z","timestamp":1528848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2018,9,30]]},"abstract":"<jats:p>This article evaluates the maximum data flow from a sender to a receiver via the internet when all transmissions are scheduled for early morning hours. The significance of early morning hours is that internet congestion is low while users sleep. When the sender and receiver lie in proximal time zones, a direct transmission from sender to receiver can be scheduled for early morning hours. When the sender and receiver are separated by several time zones such that their sleep times are non-overlapping, data can still be transmitted during early morning hours with an indirect store-and-forward transfer. The data are transmitted from the sender to intermediate end networks or data centers that serve as storage hops en route to receiver. The storage hops are placed in zones that are time proximal to the sender or the receiver so that all transmissions to and from storage hops occur during low-congestion early morning hours. This article finds the optimal locations and bandwidth distributions of storage hops for maximum nice internet flow from a sender to a receiver.<\/jats:p>","DOI":"10.1145\/3197656","type":"journal-article","created":{"date-parts":[[2018,6,13]],"date-time":"2018-06-13T15:30:12Z","timestamp":1528903812000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["GPSonflow"],"prefix":"10.1145","volume":"3","author":[{"given":"Elizabeth","family":"Varki","sequence":"first","affiliation":[{"name":"University of New Hampshire, Durham, NH"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"A. Agapi S. Soudan M. Pasin P. Vicat-Blanc Primet and T. Kielmann. 2009. Optimizing Deadline-Driven Bulk Data Transfers in Overlay Networks. IEEE.  A. Agapi S. Soudan M. Pasin P. Vicat-Blanc Primet and T. Kielmann. 2009. Optimizing Deadline-Driven Bulk Data Transfers in Overlay Networks. IEEE.","DOI":"10.1109\/ICCCN.2009.5235267"},{"volume-title":"AMS IX Amsterdam Internet Exchange","author":"AMS.","key":"e_1_2_1_2_1","unstructured":"AMS. 2017. AMS IX Amsterdam Internet Exchange ; statistics. Retrieved from https:\/\/www.ams-ix.net\/. AMS. 2017. AMS IX Amsterdam Internet Exchange; statistics. Retrieved from https:\/\/www.ams-ix.net\/."},{"key":"e_1_2_1_3_1","unstructured":"Azure. 2017. Microsoft Azure data transfers pricing details. Retrieved from https:\/\/azure.microsoft.com\/en-us\/pricing\/details\/data-transfers\/.  Azure. 2017. Microsoft Azure data transfers pricing details. Retrieved from https:\/\/azure.microsoft.com\/en-us\/pricing\/details\/data-transfers\/."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/eScience.2012.6404458"},{"key":"e_1_2_1_5_1","unstructured":"Xiaoqiang Cai Dan Sha and C. K. Wong. 2007. Time-Varying Network Optimization (International Series in Operations Research 8 Management Science). Springer.   Xiaoqiang Cai Dan Sha and C. K. Wong. 2007. Time-Varying Network Optimization (International Series in Operations Research 8 Management Science). Springer."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998582.1998595"},{"volume-title":"Introduction to Algorithms (3 ed.)","author":"Cormen Thomas H.","key":"e_1_2_1_7_1","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms (3 ed.) . MIT Press , Cambridge, MA . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3 ed.). MIT Press, Cambridge, MA."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2909493"},{"volume-title":"DE-CIX Where Networks Meet","author":"DECIX.","key":"e_1_2_1_9_1","unstructured":"DECIX. 2017. DE-CIX Where Networks Meet ; Statistics. Retrieved from http:\/\/www.de-cix.net\/about\/statistics\/. DECIX. 2017. DE-CIX Where Networks Meet; Statistics. Retrieved from http:\/\/www.de-cix.net\/about\/statistics\/."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.9.000218"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2016.7502815"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2012.43"},{"key":"e_1_2_1_14_1","unstructured":"GIG. 2017. Global Internet Map. Retrieved from https:\/\/www.telegeography.com\/telecom-maps\/global-internet-map.html.  GIG. 2017. Global Internet Map. Retrieved from https:\/\/www.telegeography.com\/telecom-maps\/global-internet-map.html."},{"key":"e_1_2_1_15_1","unstructured":"Google. 2017. Google cloud storage transfer service. Retrieved fromhttps:\/\/cloud.google.com\/storage\/transfer\/.  Google. 2017. Google cloud storage transfer service. Retrieved fromhttps:\/\/cloud.google.com\/storage\/transfer\/."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.3.419"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005697"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018446"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2237555"},{"key":"e_1_2_1_20_1","first-page":"8","article-title":"Efficient design and scalable control for store-and-forward capable optical transport networks","volume":"9","author":"Lee Chankyun","year":"2017","unstructured":"Chankyun Lee and June-Koo Kevin Rhee . 2017 . Efficient design and scalable control for store-and-forward capable optical transport networks . Journal of Optical Communications Networks 9 , 8 (Aug 2017), 699--710. Chankyun Lee and June-Koo Kevin Rhee. 2017. Efficient design and scalable control for store-and-forward capable optical transport networks. Journal of Optical Communications Networks 9, 8 (Aug 2017), 699--710.","journal-title":"Journal of Optical Communications Networks"},{"key":"e_1_2_1_21_1","first-page":"3","article-title":"Time-shifted multilayer graph: A routing framework for bulk data transfer in optical circuit-switched networks with assistive storage","volume":"8","author":"Lin Xiao","year":"2016","unstructured":"Xiao Lin , Weiqiang Sun , Malathi Veeraraghavan , and Weisheng Hu . 2016 . Time-shifted multilayer graph: A routing framework for bulk data transfer in optical circuit-switched networks with assistive storage . Journal of Optical Communications Networks 8 , 3 (Mar 2016), 162--174. Xiao Lin, Weiqiang Sun, Malathi Veeraraghavan, and Weisheng Hu. 2016. Time-shifted multilayer graph: A routing framework for bulk data transfer in optical circuit-switched networks with assistive storage. Journal of Optical Communications Networks 8, 3 (Mar 2016), 162--174.","journal-title":"Journal of Optical Communications Networks"},{"key":"e_1_2_1_22_1","unstructured":"LINX. 2017. LINX London Internet Exchange. Retrieved from https:\/\/www.linx.net.  LINX. 2017. LINX London Internet Exchange. Retrieved from https:\/\/www.linx.net."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2016.24"},{"key":"e_1_2_1_24_1","volume-title":"Zegura","author":"Shi Cong","year":"2011","unstructured":"Cong Shi , Mostafa H. Ammar , and Ellen W . Zegura . 2011 . IDTT : Delay tolerant data transfer for P2P file sharing systems. In GLOBECOM\u2019 11. 1--5. Cong Shi, Mostafa H. Ammar, and Ellen W. Zegura. 2011. IDTT: Delay tolerant data transfer for P2P file sharing systems. In GLOBECOM\u201911. 1--5."},{"key":"e_1_2_1_25_1","unstructured":"Snowball. 2017. Amazon\u2019s AWS Snowball. Retrieved from https:\/\/aws.amazon.com\/snowball\/.  Snowball. 2017. Amazon\u2019s AWS Snowball. Retrieved from https:\/\/aws.amazon.com\/snowball\/."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 23rd IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS)","author":"Adam","year":"2011","unstructured":"Adam H. Villa and Elizabeth Varki. 2011. The feasibility of moving terabyte files between campus and cloud . In Proceedings of the 23rd IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS) . Dallas, TX , December 2011 . Adam H. Villa and Elizabeth Varki. 2011. The feasibility of moving terabyte files between campus and cloud. In Proceedings of the 23rd IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS). Dallas, TX, December 2011."}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3197656","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3197656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:00Z","timestamp":1750212420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3197656"}},"subtitle":["Geographic Positioning of Storage for Optimal Nice Flow"],"short-title":[],"issued":{"date-parts":[[2018,6,13]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9,30]]}},"alternative-id":["10.1145\/3197656"],"URL":"https:\/\/doi.org\/10.1145\/3197656","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2018,6,13]]},"assertion":[{"value":"2017-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}