{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:27Z","timestamp":1750307787770,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T00:00:00Z","timestamp":1196640000000},"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":[],"published-print":{"date-parts":[[2007,12,3]]},"DOI":"10.1145\/1323548.1323567","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"97-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On LID assignment in infiniBand networks"],"prefix":"10.1145","author":[{"given":"Wickus","family":"Nienaber","sequence":"first","affiliation":[{"name":"Florida State University, Tallahassee, FL"}]},{"given":"Xin","family":"Yuan","sequence":"additional","affiliation":[{"name":"Florida State University, Tallahassee, FL"}]},{"given":"Zhenhai","family":"Duan","sequence":"additional","affiliation":[{"name":"Florida State University, Tallahassee, FL"}]}],"member":"320","published-online":{"date-parts":[[2007,12,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"A. Bermudez R. Casado F. J. Quiles T. M. Pinkston and J. Duato \"Evaluation of a Subnet Management Mechanism for InfiniBand Networks.\" Proc. of the 2003 IEEE International Conference on Parallel Processing (ICPP) pages 117--124 Oct. 2003. A. Bermudez R. Casado F. J. Quiles T. M. Pinkston and J. Duato \"Evaluation of a Subnet Management Mechanism for InfiniBand Networks.\" Proc. of the 2003 IEEE International Conference on Parallel Processing (ICPP) pages 117--124 Oct. 2003.","DOI":"10.1109\/ICPP.2003.1240572"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"A. Bermudez R. Casado F. J. Quiles and J. Duato \"Use of Provisional Routes to Speed-up Change Assimilation in InfiniBand Netrworks.\" Proc. of the 2004 IEEE International Workshop on Communication Architecture for Cl usters (CAC '04) page 186 April 2004. A. Bermudez R. Casado F. J. Quiles and J. Duato \"Use of Provisional Routes to Speed-up Change Assimilation in InfiniBand Netrworks.\" Proc. of the 2004 IEEE International Workshop on Communication Architecture for Cl usters (CAC '04) page 186 April 2004.","DOI":"10.1109\/IPDPS.2004.1303199"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.35"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"M. Koibuchi A. Funahashi A. Jouraku and H. Amano \"L-turn Routing: An Adaptive Routing in Irregular Networks.\" Proc. of the 2001 International Conference on Parallel Processing (ICPP) pages 383--392 Sept. 2001. M. Koibuchi A. Funahashi A. Jouraku and H. Amano \"L-turn Routing: An Adaptive Routing in Irregular Networks.\" Proc. of the 2001 International Conference on Parallel Processing (ICPP) pages 383--392 Sept. 2001.","DOI":"10.1109\/ICPP.2001.952084"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"P. Lopez J. Flich and J. Duato \"Deadlock-Free Routing in InfiniBand through Destination Renaming.\" Proc. of the 2001 International Conference on Parallel Processing (ICPP) pages 427--434 Sept. 2001. P. Lopez J. Flich and J. Duato \"Deadlock-Free Routing in InfiniBand through Destination Renaming.\" Proc. of the 2001 International Conference on Parallel Processing (ICPP) pages 427--434 Sept. 2001.","DOI":"10.1109\/ICPP.2001.952089"},{"key":"e_1_3_2_1_6_1","unstructured":"InfiniBand\u2122 Trade Association InfiniBand\u2122 Architecture Specification Release 1.2 October 2004. InfiniBand\u2122 Trade Association InfiniBand\u2122 Architecture Specification Release 1.2 October 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2004.11.003"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"J. C. Sancho A. Robles and J. Duato \"A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks.\" Proc. of the 4th Workshop on Communication Architecture and Applications for Network-Based Parallel Computing Jan. 2000. J. C. Sancho A. Robles and J. Duato \"A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks.\" Proc. of the 4th Workshop on Communication Architecture and Applications for Network-Based Parallel Computing Jan. 2000.","DOI":"10.1007\/10720115_4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"J. C. Sancho A. Robles and J. Duato \"Effective Strategy to Computing Forwarding Tables for InfiniBand Networks.\" Proc. of the International Conference on Parallel Processing (ICPP) pages 48--57 Sept. 2001. J. C. Sancho A. Robles and J. Duato \"Effective Strategy to Computing Forwarding Tables for InfiniBand Networks.\" Proc. of the International Conference on Parallel Processing (ICPP) pages 48--57 Sept. 2001.","DOI":"10.1109\/ICPP.2001.952046"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J. C. Sancho A. Robles and J. Duato \"Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks.\" Proc. of the 2002 International Conference on Parallel Processing (ICPP) pages 409--418 2002. J. C. Sancho A. Robles and J. Duato \"Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks.\" Proc. of the 2002 International Conference on Parallel Processing (ICPP) pages 409--418 2002.","DOI":"10.1109\/ICPP.2002.1040897"},{"issue":"8","key":"e_1_3_2_1_11_1","first-page":"1318","volume":"9","author":"Schroeder M. D.","journal-title":"IEEE JSAC"},{"key":"e_1_3_2_1_12_1","unstructured":"Top 500 supercomputer sites. http:\/\/www.top500.org Top 500 supercomputer sites. http:\/\/www.top500.org"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"J. Y. Yen. \"Finding the k shortest loopless paths in a network. \"Management Science 17(11) July 1971. J. Y. Yen. \"Finding the k shortest loopless paths in a network. \"Management Science 17(11) July 1971.","DOI":"10.1287\/mnsc.17.11.712"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1269899.1254922"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"E. W. Zegura K. Calvert and S. Bhattacharjee \"How to Model an Internetwork.\" IEEE Infocom'96 pages 594--602 April 1996. E. W. Zegura K. Calvert and S. Bhattacharjee \"How to Model an Internetwork.\" IEEE Infocom'96 pages 594--602 April 1996.","DOI":"10.1109\/INFCOM.1996.493353"}],"event":{"name":"ANCS07: Symposium on Architecture for Networking and Communications Systems","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Orlando Florida USA","acronym":"ANCS07"},"container-title":["Proceedings of the 3rd ACM\/IEEE Symposium on Architecture for networking and communications systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1323548.1323567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1323548.1323567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:14Z","timestamp":1750254974000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1323548.1323567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,3]]},"references-count":15,"alternative-id":["10.1145\/1323548.1323567","10.1145\/1323548"],"URL":"https:\/\/doi.org\/10.1145\/1323548.1323567","relation":{},"subject":[],"published":{"date-parts":[[2007,12,3]]},"assertion":[{"value":"2007-12-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}