{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:33:35Z","timestamp":1753886015265,"version":"3.41.2"},"reference-count":6,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2009,7,19]],"date-time":"2009-07-19T00:00:00Z","timestamp":1247961600000},"content-version":"vor","delay-in-days":199,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60773137","2007AA01Z297"],"award-info":[{"award-number":["60773137","2007AA01Z297"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National High Technology Research and Development Program of China","award":["60773137","2007AA01Z297"],"award-info":[{"award-number":["60773137","2007AA01Z297"]}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>We propose a method called PacketTwins for estimating the capacity of heavy\u2010loaded paths. Unlike popular packet pair methods, which probe a path with a series of two equal\u2010sized packets, PacketTwins uses a series of twin probe packets that are slightly different in size. By sending twin probe packets alternately, we can obtain new information about selecting valid samples for capacity estimation when a network path is heavy loaded.<\/jats:p>","DOI":"10.1155\/2009\/721603","type":"journal-article","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T07:06:15Z","timestamp":1248073575000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PacketTwins: A Novel Method for Capacity Estimation of a Heavy\u2010Loaded Path"],"prefix":"10.1155","volume":"2009","author":[{"given":"Jie","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2009,7,19]]},"reference":[{"key":"e_1_2_6_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015476"},{"key":"e_1_2_6_2_2","doi-asserted-by":"crossref","unstructured":"HarfoushK. harfoush@cs.ncsu.edu BestavrosA. andbest@cs.bu.edu ByersJ. byers@cs.bu.edu Measuring bottleneck bandwidth of targeted path segments 3 Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM \u203203) March 2003 San Francisco Calif USA 2079\u20132089 EID2-s2.0-0041973440.","DOI":"10.1109\/INFCOM.2003.1209229"},{"key":"e_1_2_6_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347557"},{"key":"e_1_2_6_4_2","unstructured":"JacobsonV. Pathchar: a tool to infer characteristics of Internet paths 1997."},{"key":"e_1_2_6_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.838606"},{"key":"e_1_2_6_6_2","unstructured":"The Network Simulator\u2014ns-2 http:\/\/www.isi.edu\/nsnam\/ns."}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2009\/721603.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2009\/721603.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2009\/721603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T05:03:39Z","timestamp":1739250219000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2009\/721603"}},"subtitle":[],"editor":[{"given":"Jun","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1155\/2009\/721603"],"URL":"https:\/\/doi.org\/10.1155\/2009\/721603","archive":["Portico"],"relation":{},"ISSN":["2090-0147","2090-0155"],"issn-type":[{"type":"print","value":"2090-0147"},{"type":"electronic","value":"2090-0155"}],"subject":[],"published":{"date-parts":[[2009,1]]},"assertion":[{"value":"2009-03-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-06-20","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"721603"}}