Link-disjoint routing algorithm under multiple additive QoS constraints
The problem of finding link-disjoint paths under multiple additive QoS constraints was studied.Since the existing algorithms depended on network’s structure and could not guarantee to find feasible solutions for arbitrary net-works,a novel algorithm called multiple constrained link-disjoint path rou...
Saved in:
Main Authors: | XIONG Ke1, QIU Zheng-ding1, ZHANG Yu1, ZHANG Hong-ke3 |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2010-01-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/74647201/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Researches on the problem of link disjoint paths pair with QoS constraints
by: ZHANG Pin 1, et al.
Published: (2006-01-01) -
Delay constraint minimum interruption routing algorithm for mobile satellite network
by: ZHANG Tao, et al.
Published: (2006-01-01) -
Multi-constraints QoS routing optimization based on improved immune clonal shuffled frog leaping algorithm
by: Yi LU, et al.
Published: (2020-05-01) -
QoS routing algorithm based on multiple domain architecture of SDN
by: Wei HUANG, et al.
Published: (2019-10-01) -
Secure and high throughput routing protocol with QoS constraints in cognitive wireless Mesh networks
by: Zhu-fang KUANG, et al.
Published: (2014-11-01)