一种多约束理想路径改进算法.pdfVIP

2006中国控制与决策学术年会论文集 2006ChiMseControlandDecbion 771 Proveeding$of cm}““ct 一种多约束理想路径改进算法 张世辉，王向东 (沈阳工业大学信息科学与工程学院，沈阳110023) 摘要t描逮了网络服务质量中的多约束理想路径闻题和多种启发武算法．深入分析了H—MCOP算法，指出它在应 用非线蛙函数作为廑量函数时井不能保证找到最理想蓐径．在不敢变其复杂性的情况下，对其做出了改进． 关键词；服务质t路由}多约束路径，多约束理想路径}H—MCOP算法 AnEnhanced forMulti—constrainedPath Algorithm Optimal ZHANGShi-huiWANG t Xiang—dong of (SchoolInformationScienceand of 110023，China． Engineering．ShenyangUniversityTechnology．Shenyang Correspondent：ZHANGShi—hui，E-mail：nguimeimeis@yahoo．corft．cn) riseto in networks issues． Abstract：Providingquality-of-service(QoS)guaranteespacket gives severs]challenging to Oneofthemishowdetermineafeasiblethatsatisfiesasetofconstraintswhile utilizationof path maintaininghigh networkresources．Multi·constrainedselectionwithorwithout isa optimizationNP-complete path problem．Some researchershave someheuristics with8nonlinearcostfunction．Buttherearesome recentlyproposed algorithms defectsinthe reasonofdefectsand is anefficient that solvedthe algorithms．The proposeanalyzed algorithmpartly defeCt$． Key H—MCOP words：Quality—of《erviee path，Multi-constrainedoptimalpathl touting；Multi-constrained algorithm 1；I 言 链路。而可乘性参数通过取对数变为可加性参数，所 随着高速网络技术和多媒体技术的飞速发展，