Paper Info
Title
Parallel algorithm of MCQoS routing based on improved PSRS and binary search
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.
Year
DOI
Venue
2008
10.1145/1509315.1509362
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Keywords
DocType
Citations 
parallel algorithm,np-hard multi-constrained qos,improved psrs,binary search,multifold qos requirement,routing,qos routing problem,regular sampling,computation problem,parallel mcqos routing algorithm,multi-constraints qos,program formulation,mcqos model,parallel sorting by regular sampling,novel parallel algorithm,speedup
Conference
0
PageRank 
References 
Authors
0.34
4
4
Name
Order
Citations
PageRank
Linfeng Yang101.35
Jin-Bao Jian29617.50
Taoshen Li31914.68
Zhenrong Zhang4589.97