非確定環(huán)境下的QoS網(wǎng)絡路由問題
QoS Routing in Networks with Uncertain Condition
-
摘要: 該文探討非確定環(huán)境下的QoS路由問題,包括最大可能性路徑,最優(yōu)路徑分解以及最優(yōu)分解路徑問題。本文分析了當鏈路延遲為連續(xù)變量時最大可能性路徑問題的求解,給出了鏈路延遲為正態(tài)分布時的相關算法。對于最優(yōu)路徑分解以及最優(yōu)分解路徑問題,本文給出了兩種QoS分解方式:方式Ⅰ優(yōu)化路徑各鏈路滿足QoS需求的可能性的乘積,方式Ⅱ優(yōu)化路徑各鏈路滿足QoS需求的可能性的最小值。該文對其分別進行分析并給出具體算法。Abstract: 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.
-
計量
- 文章訪問數(shù): 1917
- HTML全文瀏覽量: 113
- PDF下載量: 554
- 被引次數(shù): 0
下載:
