{"id":199,"date":"2001-09-16T14:07:37","date_gmt":"2001-09-16T14:07:37","guid":{"rendered":"http:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=199"},"modified":"2010-08-24T10:26:52","modified_gmt":"2010-08-24T10:26:52","slug":"finding-delay-constrained-cost-optimization-path","status":"publish","type":"post","link":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=199","title":{"rendered":"Finding Delay-constrained Cost-optimization Path"},"content":{"rendered":"<p><a href=\"http:\/\/network.ee.tsinghua.edu.cn\/papers\/xiang_dccop_apcc2001.pdf\" target=\"_blank\"><img loading=\"lazy\" decoding=\"async\" class=\"alignright size-full wp-image-117\" title=\"pdf\" src=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2010\/08\/pdf.gif\" alt=\"\" width=\"95\" height=\"50\" \/><\/a><br \/>\n<span class=\"paper_subtitle\">LANGUAGE<\/span><br \/>\nEnglish<br \/>\n<span class=\"paper_subtitle\">SOURCE<\/span><br \/>\nProc. APCC'2001, Sept. 2001, Tokyo, Japan.<br \/>\n<span class=\"paper_subtitle\">Published Date<\/span>:2001-09-16<br \/>\n<span class=\"paper_subtitle\">ABSTRACT<\/span><br \/>\nIn this paper, we propose a heuristic algorithm to deal with the problem of finding delay-constrained cost-optimization path in communication networks, which is a NP-complete problem. Our algorithm uses an adjustable parameter to control the tradeoff between the probability of finding the optimal path and complexity. Simulation results show that, with relatively low complexity, the probability of finding the optimal path is high.<br \/>\n<span class=\"paper_subtitle\">KEYWORDS<\/span><br \/>\nDCCOP, NP-complete, heuristic.<\/p>\n","protected":false},"excerpt":{"rendered":"<p><a href=\"http:\/\/network.ee.tsinghua.edu.cn\/papers\/xiang_dccop_apcc2001.pdf\" target=\"_blank\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft size-full wp-image-117\" title=\"pdf\" src=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2010\/08\/pdf.gif\" alt=\"\" width=\"95\" height=\"50\" \/><\/a>Xiang Duan, Zhisheng Niu, Junli Zheng, <span class=\"papertitle\">Finding Delay-constrained Cost-optimization Path <\/span>, <span class=\"papersource\">Proc. APCC'2001, Sept. 2001, Tokyo, Japan.<\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[7],"tags":[99,19,31,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/199"}],"collection":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=199"}],"version-history":[{"count":3,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/199\/revisions"}],"predecessor-version":[{"id":936,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/199\/revisions\/936"}],"wp:attachment":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=199"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=199"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=199"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}