Parallel algorithm of MCQoS routing based on improved PSRS and binary search

Authors:
Linfeng Yang;Jinbao Jian;Taoshen Li;Zhenrong Zhang
Affiliations:
Guangxi University, Guangxi, Nanning, China;Guangxi University, Guangxi, Nanning, China;Guangxi University, Guangxi, Nanning, China;Guangxi University, Guangxi, Nanning, China
Venue:
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Year:
2008

Citing 5
Cited 0

On the versatility of parallel sorting by regular sampling

Parallel Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
A filled function method for finding a global minimizer on global integer optimization

Journal of Computational and Applied Mathematics
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multifold QoS requirements of multimedia applications make QoS provisioning extremely challenging, largely due to the NP-hard Multi-Constrained QoS (MCQoS) computation problem. A Nonlinear 0-1 program formulation of QoS routing problem with delay, loss possibility and cost constraints has been given. Other additive and multiple parameters all can be treated following this formulation by adding corresponding constraints. A parallel MCQoS routing algorithm based on improved Parallel Sorting by Regular Sampling (PSRS) and binary search has been proposed to solve the formulation of this MCQoS model. Numerical tests show that this novel parallel algorithm has the speedup near to number of processors.