{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:05:00Z","timestamp":1730268300589,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2005.1498333","type":"proceedings-article","created":{"date-parts":[[2005,8,24]],"date-time":"2005-08-24T10:00:58Z","timestamp":1124877658000},"page":"1049-1059","source":"Crossref","is-referenced-by-count":3,"title":["The BEST challenge for next-generation ethernet services"],"prefix":"10.1109","volume":"2","author":[{"given":"P.","family":"Risbood","sequence":"first","affiliation":[]},{"given":"S.","family":"Acharya","sequence":"additional","affiliation":[]},{"given":"B.","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354491"},{"journal-title":"Integer Programming and Network Flows","year":"1969","author":"hu","key":"13"},{"key":"14","first-page":"486","article-title":"Fast deterministic approximation for the multicommodity flow problem","author":"radzik","year":"1995","journal-title":"SODA"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2004.1378146"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"journal-title":"Computers and Intractability - A Guide to the Theory of NP-completeness","year":"1979","author":"garey","key":"3"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"corman","key":"2"},{"journal-title":"Metro Ethernet Services - A Technical Overview","year":"2003","author":"santitoro","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"7","article-title":"A tree building technique for overlay multicast in diffserve domain","author":"yang","year":"2003","journal-title":"International Conference on Internet Computing"},{"key":"6","article-title":"Survivable routing of logical topologies in WDM networks","author":"narula-tam","year":"2001","journal-title":"IEEE INFOCOM"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/90.879346"},{"key":"4","article-title":"When trees collide: An approximation algorithm for the generalized steiner problem on networks","volume":"24","author":"ravi","year":"1995","journal-title":"SIAM Journal on Computing"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050043"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548465"}],"event":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","location":"Miami, FL, USA"},"container-title":["Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9990\/32100\/01498333.pdf?arnumber=1498333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T19:32:45Z","timestamp":1489519965000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1498333\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/infcom.2005.1498333","relation":{},"subject":[]}}