Name
Abstract | ||
|---|---|---|
Overlay routing has been widely used in Internet, mainly because of user demands for security, reliability, bandwidth, etc. Many approaches use overlay routing by deploying certain number of overlay nodes and expose them to users. Thus, users have much more flexibility in specifying their end-to-end paths. But these benefits also bring some troubles, e.g., more serious congestions may happen on some links due to the selfish nature of network. In this paper, we adopt ROR (restricted overlay routing) which will not expose all overlay nodes to users, but provide limited number of them while considering overall performance. Different users may get different overlay nodes, and they can still make their choice according to their own demands. We carry out substantial simulations under various topologies and parameters, we show that we can achieve better performance, i.e., lower Min-max link utilization. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s13042-015-0437-3 | INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS |
Keywords | Field | DocType |
Overlay Routing,Diff-Serv,Overlay Node | Key-based routing,Computer science,Computer network,Network topology,Bandwidth (signal processing),Overlay,Overlay network,Distributed computing,The Internet | Journal |
Volume | Issue | ISSN |
7 | 2 | 1868-8071 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Shu | 1 | 52 | 4.45 |
| Wei Zhao | 2 | 3532 | 404.01 |
| Jiang Yong | 3 | 156 | 41.60 |
| Mingwei Xu | 4 | 644 | 97.00 |
| Zhongxing Ming | 5 | 73 | 6.98 |