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: | , , , |
|---|---|
| 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!
|
| _version_ | 1841537700621975552 |
|---|---|
| author | XIONG Ke1 QIU Zheng-ding1 ZHANG Yu1 ZHANG Hong-ke3 |
| author_facet | XIONG Ke1 QIU Zheng-ding1 ZHANG Yu1 ZHANG Hong-ke3 |
| author_sort | XIONG Ke1 |
| collection | DOAJ |
| description | 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 routing algorithm（MCLPRA） was proposed.MCLPRA was based on SAMCRA and didn’t rely on the network’s structure.By introducing the parameter to control its search depth,dividing the solution space into different classes and performing searching according to the classes respectively,MCLPRA was able to obtain the feasible solutions for arbitrary networks.Theoretic analysis shows that MCLPRA can get the feasible and optimal solutions when traditional schemes can not.Comprehensive simulations also show that MCLPRA has better performances than existing algorithms in terms of higher average successful rate of getting feasible solutions with shorter average total length of the obtained path pair. |
| format | Article |
| id | doaj-art-086f89d9f5ee4e1bba2b5bc1def17eab |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2010-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-086f89d9f5ee4e1bba2b5bc1def17eab2025-01-14T08:25:14ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2010-01-013112713574647201Link-disjoint routing algorithm under multiple additive QoS constraintsXIONG Ke1QIU Zheng-ding1ZHANG Yu1ZHANG Hong-ke3The 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 routing algorithm（MCLPRA） was proposed.MCLPRA was based on SAMCRA and didn’t rely on the network’s structure.By introducing the parameter to control its search depth,dividing the solution space into different classes and performing searching according to the classes respectively,MCLPRA was able to obtain the feasible solutions for arbitrary networks.Theoretic analysis shows that MCLPRA can get the feasible and optimal solutions when traditional schemes can not.Comprehensive simulations also show that MCLPRA has better performances than existing algorithms in terms of higher average successful rate of getting feasible solutions with shorter average total length of the obtained path pair.http://www.joconline.com.cn/zh/article/74647201/QoS routinglink-disjointreliable routingmulti-constrained routing |
| spellingShingle | XIONG Ke1 QIU Zheng-ding1 ZHANG Yu1 ZHANG Hong-ke3 Link-disjoint routing algorithm under multiple additive QoS constraints Tongxin xuebao QoS routing link-disjoint reliable routing multi-constrained routing |
| title | Link-disjoint routing algorithm under multiple additive QoS constraints |
| title_full | Link-disjoint routing algorithm under multiple additive QoS constraints |
| title_fullStr | Link-disjoint routing algorithm under multiple additive QoS constraints |
| title_full_unstemmed | Link-disjoint routing algorithm under multiple additive QoS constraints |
| title_short | Link-disjoint routing algorithm under multiple additive QoS constraints |
| title_sort | link disjoint routing algorithm under multiple additive qos constraints |
| topic | QoS routing link-disjoint reliable routing multi-constrained routing |
| url | http://www.joconline.com.cn/zh/article/74647201/ |
| work_keys_str_mv | AT xiongke1 linkdisjointroutingalgorithmundermultipleadditiveqosconstraints AT qiuzhengding1 linkdisjointroutingalgorithmundermultipleadditiveqosconstraints AT zhangyu1 linkdisjointroutingalgorithmundermultipleadditiveqosconstraints AT zhanghongke3 linkdisjointroutingalgorithmundermultipleadditiveqosconstraints |