Towards Link-disjoint paths under multiple additive QoS constraints
Finding disjoint paths between a source and destination node pair under quality of service (QoS) constraints is a significant scheme for improving both the network survivability and the QoS performances. This paper proposed a new algorithm, which aims to find a pair of link-disjoint paths that each of them satisfies two or more additive constraints. Our algorithm is on the basis of SAMCRA 12 and searches solutions according to the varied composition forms of the exact solutions. Comparisons and simulations show that our scheme is capable of getting feasible solutions and optimal solutions with higher probabilities than existing approaches.
Link-disjoint path QoS routing survivability
Ke Xiong Zheng-ding Qiu Hong-ke Zhang
Institute of Information Science,Beijing Jiaotong University,Beijing 100044,P.R.China School of Electronics and Information Engineering,Beijing Jiaotong University,Beijing 100044,P.R.Chi
国际会议
The IET 2nd International Conference on Wireless,Mobile & Multimedia Networks(第二届IET国际无线移动多媒体网络会议)
北京
英文
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）