非确定环境下的QoS网络路由问题  

QoS Routing in Networks with Uncertain Condition

作　　者：张品[1] 李乐民[1] 王晟[1] 

机构地区：[1]电子科技大学宽带光纤传榆与通信系统技术重点实验室,成都610054

出　　处：《电子与信息学报》2005年第5期707-711,共5页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(No.60002004)资助课题

摘　　要：该文探讨非确定环境下的QoS路由问题,包括最大可能性路径,最优路径分解以及最优分解路径问题。本文分析了当链路延迟为连续变量时最大可能性路径问题的求解,给出了链路延迟为正态分布时的相关算法。对于最优路径分解以及最优分解路径问题,本文给出了两种QoS分解方式:方式Ⅰ优化路径各链路满足QoS需求的可能性的乘积,方式Ⅱ优化路径各链路满足QoS需求的可能性的最小值。该文对其分别进行分析并给出具体算法。The paper investigates the QoS routing problem with uncertain network condition, including MP(Most Probable Path), OP(Optimal Partition) and OP-MP(Optimally Partitioned MP). The question MP is studied when density function of the link delay is continuous and an algorithm for a special case that the link delay has normal distribution is proposed. For question OP and OP-MP, two cases of QoS partition are given: Case I optimizes the product of the probability that all the links of the path satisfy the partitioned constraints, while the case II maximizes the minimum of them. The two cases are analyzed and the algorithms are given.

关 键 词：非确定网络参数 延迟 最优分解 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]