Name
Abstract | ||
|---|---|---|
In this paper, we study the problem of QoS routing with two concave constraints in the Internet. We propose an efficient approach for computing the supported QoS across domains based on the aggregated intradomain topology. The time complexity of our approach is polynomial. Moreover, our approach can be incorporated in the distance-vector based routing protocol, such as BGP, the de facto inter- domain routing protocol in the Internet. Our simulation results show that our interdomain QoS routing protocol can successfully serve more than 80% of the total connection requests and is very scalable. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.4304/jcm.5.3.239-246 | JCM |
Keywords | Field | DocType |
topology aggregation.,hierarchical networks,concave constraints,index terms—qos routing,indexing terms,time complexity,routing protocol | Link-state routing protocol,Dynamic Source Routing,Computer science,Hierarchical routing,Static routing,Enhanced Interior Gateway Routing Protocol,Computer network,Wireless Routing Protocol,Distributed computing,Routing protocol,Zone Routing Protocol | Journal |
Volume | Issue | Citations |
5 | 3 | 0 |
PageRank | References | Authors |
0.34 | 14 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ronghui Hou | 1 | 73 | 13.79 |
| Ka-chung Leung | 2 | 2 | 0.72 |
| King-Shan Lui | 3 | 294 | 26.21 |
| Ka-Cheong Leung | 4 | 318 | 35.54 |
| Fred Baker | 5 | 182 | 12.94 |