Name
Abstract | ||
|---|---|---|
We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for the unicast case. We then explore the use of optimization techniques in devising heuristics for QoS routing both in the unicast and multicast settings using algorithmic techniques as well as techniques from optimization theory. We present test results showing that our techniques perform very well in the unicast case. For multicast with multiple constraints, we present the first results that we know of where one can quickly obtain near-optimal, feasible trees. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/978-3-540-30573-6_38 | QoS-IP |
Keywords | Field | DocType |
present test result,optimization technique,multiple constraint,unicast case,devising heuristics,optimization theory,multicast qos,service routing,algorithmic technique,feasible tree,multicast setting | Protocol Independent Multicast,Approximation algorithm,Computer science,Xcast,Computer network,Wireless Routing Protocol,Pragmatic General Multicast,Distance Vector Multicast Routing Protocol,Multicast,Unicast,Distributed computing | Conference |
Volume | ISSN | ISBN |
3375 | 0302-9743 | 3-540-24557-X |
Citations | PageRank | References |
2 | 0.41 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Wang | 1 | 169 | 13.41 |
| Funda Ergun | 2 | 151 | 10.13 |
| Zhan Xu | 3 | 2 | 0.41 |