| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 450336 | Computer Communications | 2008 | 7 Pages |
Abstract
Various algorithms have been presented to solve QoS (quality of service) routing problems, but few pervasive algorithms are presented for them. In this paper, we present a pervasive QoS routing algorithm, PQR, for the QoS routing problems. PQR has characteristics including pervasiveness, scalability, efficiency, fault-tolerance, invulnerability, load-balance, deadlock-free and profitability. PQR takes advantage of the idea of converting additive parameters to concave parameters, which has been little discussed in published papers.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Yu Wang, Lemin Li, Du Xu,