{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:37:41Z","timestamp":1729636661031,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/hpcsim.2016.7568317","type":"proceedings-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T20:53:29Z","timestamp":1473972809000},"page":"66-73","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating BFS shortest paths calculations using CUDA for Internet topology measurements"],"prefix":"10.1109","author":[{"given":"Eric","family":"Klukovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet","family":"Hadi Gunes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee","family":"Barford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederick C.","family":"Harris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2012.6151326"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"year":"0","key":"ref12","article-title":"Computer networking lab, computer science and engineering, university of nevada, reno"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/956993.956995"},{"year":"0","key":"ref14","article-title":"Caida - as rank: As ranking"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837289"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77220-0_21"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"ref5","first-page":"38","article-title":"Article: New approach for graph algorithms on gpu using cuda","volume":"72","author":"singla","year":"2013","journal-title":"International Journal of Computer Applications"},{"key":"ref8","first-page":"159","article-title":"Simulating large topologies in ns-3 using brite and cuda driven global routing","author":"swenson","year":"2013","journal-title":"SimuTools '13 Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004219"},{"year":"2014","key":"ref2","article-title":"Cisco Visual Networking Index:Forecast and Methodology, 2013-2018"},{"year":"2014","key":"ref1","article-title":"International Telecommunication Union (ITU), United Nations Population Division, Internet and Mobile Association of India (IAMAI)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-012-0811-9"}],"event":{"name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","start":{"date-parts":[[2016,7,18]]},"location":"Innsbruck, Austria","end":{"date-parts":[[2016,7,22]]}},"container-title":["2016 International Conference on High Performance Computing & Simulation (HPCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7562293\/7568299\/07568317.pdf?arnumber=7568317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,10,5]],"date-time":"2016-10-05T11:45:13Z","timestamp":1475667913000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7568317\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/hpcsim.2016.7568317","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}