Abstract
We study the source routing problem on (formula presented) tori and meshes. In this problem, the paths for packets are the shortest ones. And the routing decision is distributed in a way that the path designated to a packet is determined entirely on its source node, with no knowledge of the other packets injected to other nodes and the system load distribution. The cost we concern about is the maximum load among the edges. We use competitive analysis to measure the performance of algorithms. We show that the competitive ratio for any algorithm is Ω(logN), and we provide an algorithm whose competitive ratio is O(log N).
Cite
CITATION STYLE
Yeh, T. H., Kuo, C. M., Lei, C. L., & Yen, H. C. (1997). Competitive source routing on tori and meshes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1350, pp. 82–91). Springer Verlag. https://doi.org/10.1007/3-540-63890-3_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
