An Improved Routing Algorithm Subject to Multiple  Constraints for ATM Networks

LIU Jin; NIU Zhi  sheng; ZHENG Jun  li

您当前的位置：

首页 >

文章列表页 >

An Improved Routing Algorithm Subject to Multiple Constraints for ATM Networks

更新时间：2025-12-08

- An Improved Routing Algorithm Subject to Multiple Constraints for ATM Networks
- Acta Electronica Sinica Issue 10, Pages: 4-7(1999)
- 作者机构：
  
  清华大学电子工程系微波与数字通信国家重点实验室!北京100084
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN915.2
- Published：1999
- 稿件说明：
移动端阅览
[1]刘进,牛志升,郑君里.多约束ATM网络路由选择的改进多标号算法[J].电子学报,1999(10):4-7+29.

LIU Jin, NIU Zhi sheng, ZHENG Jun li. An Improved Routing Algorithm Subject to Multiple Constraints for ATM Networks[J]. Acta Electronica Sinica, 1999, (10): 4-7.
[1]刘进,牛志升,郑君里.多约束ATM网络路由选择的改进多标号算法[J].电子学报,1999(10):4-7+29. DOI：

LIU Jin, NIU Zhi sheng, ZHENG Jun li. An Improved Routing Algorithm Subject to Multiple Constraints for ATM Networks[J]. Acta Electronica Sinica, 1999, (10): 4-7. DOI：

摘要

面向连接的ＡＴＭ网络为保证多种用户服务质量，要求建立的连接满足一个或多个约束的同时优化网络资源，这已经被证明是ＮＰ完全问题．本文提出了一种改进的多标号算法，用于解决ＡＴＭ网络中多个约束条件下的最优路径选择问题．该改进算法可以在多项式级的复杂度内找出任意近似程度的最优路径．对于一个２００个节点的具体网络，实际运算结果表明，本文所提算法的循环次数减小到原始多标号法的１／３以下．

Abstract

It is known that the shortest path problem with one or more constraints is NP complete.The paper proposes an improved multi label routing algorithm for ATM networks

which can find an approximate optimal path subject to multiple constraints with arbitrary accuracy in polynomial time scale.For the experimental network of 200 nodes

the numerical results show that the algorithmic loops are reduced to about 1/3 of the original multi label algorithm.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Multi-hop WLAN Video Distortion Optimized Routing and Source Rate Control

Design of Multicast Network of Dawning 5000 High Performance Computer

A Contention-Based Forwarding Routing Protocol for Vehicular Ad Hoc Networks in City Scenarios LI Yuan-zhen^1,2,LIAO Jian-xin^1,2,LI Tong-hong³,ZHU Xiao-min1,2

Analysis of Key Parameter of Contention-Based Forwarding Strategy for Vehicular Ad Hoc Networks in City Scenarios

Related Author

FONT face

Verdana

LI Xin

ZHANG Hong-ke

FONT

CAO Zheng

WANG Da-wei

LIU Xin-chun

Related Institution

（北京交通大学电子信息工程学院，）

Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing China

National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Beijing China

Key Laboratory of Computer System and Architecture, Chinese Academy of Sciences

National Research Center for Intelligent Computing Systems, Institute of Computing Technology, Chinese Academy of Sciences

⁰