Name
Abstract | ||
|---|---|---|
The literature contains propositions for the use of overlay networks to supplement the normal IP routing functions with higher-level information in order to improve aspects of network behavior. We consider the use of such an overlay to optimize the end-to-end behavior of some special traffic flows. Measurements are used both to construct the virtual links of the overlay and to establish the link costs for use in a link-state routing protocol. The overlay attempts to forward certain packets over the least congested rather than the shortest path. We present simulation results showing that contrary to common belief overlay networks are not always beneficial and can be detrimental. |
Year | Venue | Keywords |
|---|---|---|
2002 | QofIS | link-state routing protocol,overlay network,measurement-based overlay network,common belief overlay network,normal ip routing function,overlay attempt,network behavior,certain packet,link cost,higher-level information,end-to-end behavior,ip routing,shortest path,routing protocol |
Field | DocType | Volume |
Shortest path problem,Computer science,Key-based routing,Network packet,Network architecture,Computer network,Overlay,Overlay network,Routing protocol,Distributed computing,The Internet | Conference | 2511 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-44356-8 | 2 |
PageRank | References | Authors |
0.37 | 10 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Bauer | 1 | 2 | 0.37 |
| Sean Rooney | 2 | 81 | 12.50 |
| Paolo Scotton | 3 | 74 | 12.65 |
| Sonja Buchegger | 4 | 1292 | 85.73 |
| I. Iliadis | 5 | 269 | 26.31 |