浏览全部资源
扫码关注微信
1. ,山西,太原,030051
2. 华北工学院计算机科学与技术系,山西,太原,030051
Published:2004
移动端阅览
赵海雁, 陈立潮. Algorithm for the Shortest Route on Multi-Constrained QoS Routing[J]. 2004, (1): 49-51.
DOI:
赵海雁, 陈立潮. Algorithm for the Shortest Route on Multi-Constrained QoS Routing[J]. 2004, (1): 49-51. DOI:
多约束的服务质量路由(QoSR)是用来寻找一条同时满足多个约束条件的可行路径
这是NPC问题.结合线性与非线性度量函数将多个QoS度量转化为单一能量值
给出了多约束条件下层次最短路径的近似算法.
QoSR (quality-of-service routing) is used to find a feasible route to satisfy multi-constrained problem
which is a NP complexity of QoSR. The multiple weights are converted to a single metric with linear and non-linear weight functions
a hierarchical approximate algorithm for shortest route on multi-constrained problem is given.
SobrinhoJL.AlgebraandalgorithmsforQoSpathcomputationandhop-by-hoproutingintheinternet[A].IEEEINFOCOM01[C].AlaskaIEEEComputerandCommunicationsSocieties,2001.727-735.
WangZ,CrowcroftJ.Qualityofserviceroutingforsupportingmultimediaapplications[J].IEEEJournalonSelect-edAreasinCommunications,1996,14(7):1228-1234.
JaffeJM.Algorithmsforfindingpathswithmultipleconstraints[J].Networks,1984,14:95-116.
崔勇,徐恪,吴建平.性能可调启发多约束路由算法[J].电子学报,2002,30(z1):1968-1972.
ChenS,NahrstedtK.Onfindingmulti-constrainedpaths[J].IEEEICC′,1998,98:874-879.
KorkmazTrunzM.Multi-constrainedoptimalpathselection[A].IEEEINFOCOM01[C].AlaskaIEEEComputerandCommunicationsSocieties,2001.834-843.
张信明,陈国良,黄刘生.QoS路由近似算法的研究[J].计算机科学,2003,(1):105-107.
0
Views
502
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution