Multi-Constrained Path Selection Algorithm Based on the Depth of the Distance Vector

QI Xiao-gang; LIU Li-fang; LIU San-yang

您当前的位置：

首页 >

文章列表页 >

Multi-Constrained Path Selection Algorithm Based on the Depth of the Distance Vector

更新时间：2025-07-16

- Multi-Constrained Path Selection Algorithm Based on the Depth of the Distance Vector
- Acta Electronica Sinica Vol. 37, Issue 1, Pages: 175-179(2009)
- 作者机构：
  
  1. 西安电子科技大学数学科学系,陕西,西安,710071
  2. 西安电子科技大学计算机学院,陕西,西安,710071
  3. 综合业务网国家重点实验室,陕西,西安,710071
  4. 西安电子科技大学数学科学系陕西西安,710071
  5. 西安电子科技大学计算机学院陕西西安,710071
  6. 综合业务网国家重点实验室陕西西安,710071
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393.11
- Published：2009
- 稿件说明：
移动端阅览
QI Xiao-gang, LIU Li-fang, LIU San-yang. Multi-Constrained Path Selection Algorithm Based on the Depth of the Distance Vector[J]. Acta Electronica Sinica, 2009, 37(1): 175-179.
DOI：

QI Xiao-gang, LIU Li-fang, LIU San-yang. Multi-Constrained Path Selection Algorithm Based on the Depth of the Distance Vector[J]. Acta Electronica Sinica, 2009, 37(1): 175-179. DOI：

摘要

为各种应用提供不同的服务质量(Quality of Service

QoS)保证是下一代高速网络面临的一个重要难题

而服务质量路由(Quality of Service routing

QoSR)则是其中的一项核心技术.本文针对不精确状态信息下的多约束QoSR问题

建立了一种用于求解此类多约束QoSR问题的临界点模型

提出了一种基于距离向量深度的多约束QoS路径选择算法(MCPSA)

该算法以已有的QoS路由预计算算法为基础

设法选择一条能够最大程度适应不精确网络状态信息的路径

理论分析表明该算法具有一定的优势.最后

结合已有的路由预计算算法进行了大量的仿真试验

结果表明MCPSA具有很强的问题求解能力

能够有效克服路由状态信息的不确定性.

Abstract

It is a challenging problem to provide quality-of-service (QoS) guarantees in next generation high-speed network

and the QoS routing is one of the key issues of the problem.For the problem of multi-constrained QoS routing with the inaccurate state information of networks

a critical point model is constructed

and an algorithm based on the depth of the distance vector

MCPSA

is proposed for the problem.The MCPSA aims to select the path with the minimal depth of distance vector from the paths computed by an existing algorithm for QoS routing pre-computation.Theoretical analysis indicates the performance of the algorithm is superior to that of the other algorithm.Finally

extensive simulations are used to demonstrate the efficiency of the proposed algorithm for the problem of multi-constrained QoSR with the inaccurate state information.

关键词

Keywords

references

Views

873

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Hybrid Routing Based on Traffic Scheduling in Double-Layer Software Defined Satellite Networks

A Deflection Routing Algorithm Based on Priority and Parameter-tunable in Optical Burst Switching Networks

An Ant-Colony Optimization Based Service Aware Routing Algorithm for Multimedia Sensor Networks

A Branch Optimization Algorithm for the Delay Constrained Multicast Routing Problem

Related Author

WANG Chao-wei

DU Jia-nan

WANG Cheng

WANG Wei-dong

FU Hong-liang

ZHANG Yuan

WANG Bo-yun

GUAN Ai-hong

Related Institution

School of Electronic Engineering，Beijing University of Posts and Telecommunications

College of Information Science and Engineering, Henan University of Technology

Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications

Key Lab of Optical Fiber and Communication NetworksUESTCChengduSichuan 610054China

Institute of CommunicationHangzhou Dianzi UniversityHangzhouZhejiang 310018China

⁰