Researches on the problem of link disjoint paths pair with QoS constraints
The problem of link disjoint paths pair with QoS constraints was discussed.Two routing models about link dis-joint optimal paths pair with QoS constraints were constructed.First it proved that the problem of link disjoint paths pair in the undirected graph without end to end QoS constraints counld b...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2006-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74661655/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537339856257024 |
|---|---|
| author | ZHANG Pin 1 ZHANG Jian-wu1 LI Le-min 2 WANG Sheng2 |
| author_facet | ZHANG Pin 1 ZHANG Jian-wu1 LI Le-min 2 WANG Sheng2 |
| author_sort | ZHANG Pin 1 |
| collection | DOAJ |
| description | The problem of link disjoint paths pair with QoS constraints was discussed.Two routing models about link dis-joint optimal paths pair with QoS constraints were constructed.First it proved that the problem of link disjoint paths pair in the undirected graph without end to end QoS constraints counld be converted to the correspond problem in its link split graph,while the problem with end to end QoS constraints counld not be converted.Then it’s proved that both of these questions are NP complete.Finally the approximation algorithms is given and simulation on them is made. |
| format | Article |
| id | doaj-art-2f6547e518634b8aa4da4806183a359b |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2006-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-2f6547e518634b8aa4da4806183a359b2025-01-14T08:39:06ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2006-01-01364274661655Researches on the problem of link disjoint paths pair with QoS constraintsZHANG Pin 1ZHANG Jian-wu1LI Le-min 2WANG Sheng2The problem of link disjoint paths pair with QoS constraints was discussed.Two routing models about link dis-joint optimal paths pair with QoS constraints were constructed.First it proved that the problem of link disjoint paths pair in the undirected graph without end to end QoS constraints counld be converted to the correspond problem in its link split graph,while the problem with end to end QoS constraints counld not be converted.Then it’s proved that both of these questions are NP complete.Finally the approximation algorithms is given and simulation on them is made.http://www.joconline.com.cn/zh/article/74661655/link disjoint pathsQoS constraintslink split graph |
| spellingShingle | ZHANG Pin 1 ZHANG Jian-wu1 LI Le-min 2 WANG Sheng2 Researches on the problem of link disjoint paths pair with QoS constraints Tongxin xuebao link disjoint paths QoS constraints link split graph |
| title | Researches on the problem of link disjoint paths pair with QoS constraints |
| title_full | Researches on the problem of link disjoint paths pair with QoS constraints |
| title_fullStr | Researches on the problem of link disjoint paths pair with QoS constraints |
| title_full_unstemmed | Researches on the problem of link disjoint paths pair with QoS constraints |
| title_short | Researches on the problem of link disjoint paths pair with QoS constraints |
| title_sort | researches on the problem of link disjoint paths pair with qos constraints |
| topic | link disjoint paths QoS constraints link split graph |
| url | http://www.joconline.com.cn/zh/article/74661655/ |
| work_keys_str_mv | AT zhangpin1 researchesontheproblemoflinkdisjointpathspairwithqosconstraints AT zhangjianwu1 researchesontheproblemoflinkdisjointpathspairwithqosconstraints AT lilemin2 researchesontheproblemoflinkdisjointpathspairwithqosconstraints AT wangsheng2 researchesontheproblemoflinkdisjointpathspairwithqosconstraints |