{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:19:37Z","timestamp":1729628377312,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/hpsr.2010.5580283","type":"proceedings-article","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T15:57:52Z","timestamp":1285171072000},"page":"82-87","source":"Crossref","is-referenced-by-count":2,"title":["Computing alternate multicast trees with maximum latency guarantee"],"prefix":"10.1109","author":[{"given":"Limin","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanjun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Razo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arularasi","family":"Sivasankaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Monti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Tacca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Fumagalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CSSE.2008.1264"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.872827"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref8","first-page":"121","article-title":"A new implementation of Yen's ranking loopless paths algorithm","volume":"1","author":"martins","year":"2003","journal-title":"Quarterly Journal of the Belgian French and Italian Operations Research Societies"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","article-title":"Computing the k shortest paths: A new algorithm and an experimental comparison","author":"jim\u00e9nez","year":"1999","journal-title":"Proc of the 3rd Intl Workshop on Algorithm Engineering"},{"key":"ref2","article-title":"Load balancing in ad hoc networks: Single-path routing vs. multi-path routing","author":"yashar ganjali","year":"2004","journal-title":"IEEE INFOCOM"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CAMAD.2009.5161474"},{"key":"ref1","article-title":"Load-balanced k-shortest path routing for circuit-switched networks","author":"hsu","year":"1992","journal-title":"Proceedings of IEEE NY\/NJ Regional Control Conference"}],"event":{"name":"2010 International Conference on High Performance Switching and Routing (HPSR)","start":{"date-parts":[[2010,6,13]]},"location":"Richardson, TX, USA","end":{"date-parts":[[2010,6,16]]}},"container-title":["2010 International Conference on High Performance Switching and Routing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5564176\/5580251\/05580283.pdf?arnumber=5580283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T10:22:43Z","timestamp":1497867763000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5580283\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/hpsr.2010.5580283","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}