{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:29Z","timestamp":1750307009624,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,1,9]],"date-time":"2012-01-09T00:00:00Z","timestamp":1326067200000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2013,1,9]]},"abstract":"<jats:p>Management and automated configuration of large-scale networks is one of the crucial issues for Internet Service Providers (ISPs). Since wrong configurations may lead to loss of an enormous amount of customer traffic, highly experienced network administrators are typically the ones who are trusted for the management and configuration of a running ISP network. We frame the management and experimentation of a network as a \"game\" for training network administrators without having to risk the network operation. The interactive environment treats the trainee network administrators as players of a game and tests them with various network failures or dynamics.<\/jats:p>","DOI":"10.1145\/2427036.2427045","type":"journal-article","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T15:42:48Z","timestamp":1357918968000},"page":"46-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Network management game"],"prefix":"10.1145","volume":"43","author":[{"given":"Engin","family":"Arslan","sequence":"first","affiliation":[{"name":"SUNY at Buffalo, Buffalo, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"Yuksel","sequence":"additional","affiliation":[{"name":"University of Nevada, Reno, Reno, NV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet Hadi","family":"Gunes","sequence":"additional","affiliation":[{"name":"University of Nevada, Reno, Reno, NV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.7551\/mitpress\/3867.003.0011","volume-title":"phInternet economics","author":"Srinagesh P.","year":"1997","unstructured":"P. Srinagesh , phInternet economics . MIT Press , 1997 , ch. Internet cost structures and interconnection agreements, pp. 121 -- 154 . P. Srinagesh, phInternet economics. MIT Press, 1997, ch. Internet cost structures and interconnection agreements, pp. 121--154."},{"key":"e_1_2_1_2_1","volume-title":"so does the need for configuration management\" Enterprise Computing and Networking","author":"Kerravala Z.","year":"2004","unstructured":"Z. Kerravala , \"As the value of enterprise networks escalates , so does the need for configuration management\" Enterprise Computing and Networking , The Yankee Group , January 2004 . Z. Kerravala, \"As the value of enterprise networks escalates, so does the need for configuration management\" Enterprise Computing and Networking, The Yankee Group, January 2004."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090408"},{"key":"e_1_2_1_4_1","volume-title":"Why do Internet services fail, and what can be done about it?\" in Proc. of USENIX USITS","author":"Oppenheimer D.","year":"2003","unstructured":"D. Oppenheimer , A. Ganapathi , and D. A. Patterson , \" Why do Internet services fail, and what can be done about it?\" in Proc. of USENIX USITS , 2003 . D. Oppenheimer, A. Ganapathi, and D. A. Patterson, \"Why do Internet services fail, and what can be done about it?\" in Proc. of USENIX USITS, 2003."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2001729"},{"key":"e_1_2_1_6_1","first-page":"948","article-title":"On the stability of adaptive routing in the presence of congestion control","author":"Anderson E. J.","year":"2003","unstructured":"E. J. Anderson and T. E. Anderson , \" On the stability of adaptive routing in the presence of congestion control ,\" in Proc. of IEEE INFOCOM , 2003 , pp. 948 -- 958 . E. J. Anderson and T. E. Anderson, \"On the stability of adaptive routing in the presence of congestion control,\" in Proc. of IEEE INFOCOM, 2003, pp. 948--958.","journal-title":"Proc. of IEEE INFOCOM"},{"key":"e_1_2_1_7_1","volume-title":"Probabilistic trans-algorithmic search for automated network management and configuration,\" in Proc. of IEEE GLOBECOM MENS Workshop","author":"Gonen B.","year":"2010","unstructured":"B. Gonen , M. Yuksel , and S. Louis , \" Probabilistic trans-algorithmic search for automated network management and configuration,\" in Proc. of IEEE GLOBECOM MENS Workshop , Miami, FL , 2010 . B. Gonen, M. Yuksel, and S. Louis, \"Probabilistic trans-algorithmic search for automated network management and configuration,\" in Proc. of IEEE GLOBECOM MENS Workshop, Miami, FL, 2010."},{"key":"e_1_2_1_8_1","first-page":"519","article-title":"Internet traffic engineering by optimizing OSPF weights","author":"Fortz B.","year":"2000","unstructured":"B. Fortz , \" Internet traffic engineering by optimizing OSPF weights ,\" in Proc. of IEEE INFOCOM , 2000 , pp. 519 -- 528 . B. Fortz, \"Internet traffic engineering by optimizing OSPF weights,\" in Proc. of IEEE INFOCOM, 2000, pp. 519--528.","journal-title":"Proc. of IEEE INFOCOM"},{"key":"e_1_2_1_9_1","first-page":"299","article-title":"A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing","volume":"6","author":"Buriol L. S.","year":"2003","unstructured":"L. S. Buriol , M. G. C. Resende , C. C. Ribeiro , and M. Thorup , \" A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing ,\" Journal of Combinatorial Optimization , vol. 6 , pp. 299 -- 333 , 2003 . L. S. Buriol, M. G. C. Resende, C. C. Ribeiro, and M. Thorup, \"A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing,\" Journal of Combinatorial Optimization, vol. 6, pp. 299--333, 2003.","journal-title":"Journal of Combinatorial Optimization"},{"key":"e_1_2_1_10_1","unstructured":"\"Cisco Certifications \" http:\/\/www.cisco.com\/web\/learning\/index.html. \"Cisco Certifications \" http:\/\/www.cisco.com\/web\/learning\/index.html."},{"key":"e_1_2_1_11_1","unstructured":"Mate http:\/\/www.cariden.com\/products. Mate http:\/\/www.cariden.com\/products."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/10864415.1997.11518297"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/prs.680220103"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276337"},{"key":"e_1_2_1_15_1","first-page":"2258","article-title":"Link gradients: Predicting the impact of network latency on multitier applications","author":"Chen S.","year":"2009","unstructured":"S. Chen , K. R. Joshi , M. A. Hiltunen , W. H. Sanders , and R. D. Schlichting , \" Link gradients: Predicting the impact of network latency on multitier applications ,\" in Proc. of IEEE INFOCOM , 2009 , pp. 2258 -- 2266 . S. Chen, K. R. Joshi, M. A. Hiltunen, W. H. Sanders, and R. D. Schlichting, \"Link gradients: Predicting the impact of network latency on multitier applications,\" in Proc. of IEEE INFOCOM, 2009, pp. 2258--2266.","journal-title":"Proc. of IEEE INFOCOM"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402971"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272516.1272537"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.2007.00318.x"},{"key":"e_1_2_1_19_1","unstructured":"\"Wikipedia: Flight Simulator \" http:\/\/en.wikipedia.org\/wiki\/Flight_simulator. \"Wikipedia: Flight Simulator \" http:\/\/en.wikipedia.org\/wiki\/Flight_simulator."},{"key":"e_1_2_1_20_1","unstructured":"\"Serious Games by BreakAway \" http:\/\/www.breakawaygames.com. \"Serious Games by BreakAway \" http:\/\/www.breakawaygames.com."},{"key":"e_1_2_1_21_1","unstructured":"\"The Stock Market Game \" http:\/\/www.stockmarketgame.org. \"The Stock Market Game \" http:\/\/www.stockmarketgame.org."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/141800.141805"},{"key":"e_1_2_1_23_1","unstructured":"\"Visualization of NYC Subway Rides \" http:\/\/data.fabernovel.com\/nyc-subway\/. \"Visualization of NYC Subway Rides \" http:\/\/data.fabernovel.com\/nyc-subway\/."},{"key":"e_1_2_1_24_1","unstructured":"\"Musical Visualization of NYC Daily Schedule \" http:\/\/mta.me. \"Musical Visualization of NYC Daily Schedule \" http:\/\/mta.me."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.865877"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2005.857499"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/6.898800"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.10.023"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2427036.2427045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2427036.2427045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:00Z","timestamp":1750236540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2427036.2427045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,9]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1,9]]}},"alternative-id":["10.1145\/2427036.2427045"],"URL":"https:\/\/doi.org\/10.1145\/2427036.2427045","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2012,1,9]]},"assertion":[{"value":"2012-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}