{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:58:11Z","timestamp":1725731891171},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/icc.2005.1494476","type":"proceedings-article","created":{"date-parts":[[2005,8,16]],"date-time":"2005-08-16T11:17:27Z","timestamp":1124191047000},"page":"875-880 Vol. 2","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the number of detectors in poll-based link failure detection and identification"],"prefix":"10.1109","author":[{"family":"Hwa-Chun Lin","sequence":"first","affiliation":[{"name":"Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Chien-Hsing Wang","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Lung-Chih Tung","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Routing Information Protocol","author":"hedrick","year":"0","journal-title":"RFC 1058"},{"year":"0","author":"van jacobson","journal-title":"Traceroute source code and documentation","key":"ref3"},{"key":"ref6","article-title":"OSPF Version 2","author":"moy","year":"0","journal-title":"RFC 1247"},{"key":"ref5","article-title":"A Simple Network Management Protocol (SNMP)","author":"case","year":"0","journal-title":"RFC 1157"},{"year":"1996","author":"zegura","article-title":"GT-ITM: Georgia Tech internetwork topology models (software)","key":"ref8"},{"key":"ref7","article-title":"A Border Gateway Protocol 3 (BGP-3)","author":"lougheed","year":"0","journal-title":"RFC 1267"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1287\/moor.4.3.233"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/90.650138"},{"key":"ref1","article-title":"A Davis-Putnam Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization","author":"barth","year":"1995","journal-title":"Technical Report MPI-I-95-2-003"}],"event":{"name":"2005 IEEE International Conference on Communications","start":{"date-parts":[[2005,5,16]]},"location":"Seoul, Korea (South)","end":{"date-parts":[[2005,5,20]]}},"container-title":["IEEE International Conference on Communications, 2005. ICC 2005. 2005"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9996\/32110\/01494476.pdf?arnumber=1494476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T13:47:08Z","timestamp":1709905628000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1494476\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/icc.2005.1494476","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}