Name
Abstract | ||
|---|---|---|
Traffic balancing algorithms represent a cost-effective alternative to balance traffic in high performance interconnection networks. The importance of these algorithms is increasing since most of the current network technologies for clusters are either based on source routing or use deterministic routing. In source-routed networks, the host is responsible for selecting the suitable path among the set of paths provided by the routing algorithm. The selection of an optimal path that maximizes the channel utilization is not trivial because of the huge amount of combinations. Traffic balancing algorithms are based on heuristics in order to find an optimal solution. In this paper, we propose a new methodology based on the use of metaheuristic algorithms to evaluate the effectiveness of traffic balancing algorithms. Preliminary results show that the set of paths provided by current traffic balancing algorithms are still far from an optimized solution. Thus, it is worth continuing to design more efficient traffic balancing algorithms. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-27866-5_118 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
source routing,cost effectiveness | Simulated annealing,Deterministic routing,Hill climbing,Computer science,Algorithm,Heuristics,Source routing,Deterministic system (philosophy),Virtual channel,Metaheuristic,Distributed computing | Conference |
Volume | ISSN | Citations |
3149 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 11 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. E. Villalobos | 1 | 0 | 0.34 |
| J. L. Sánchez | 2 | 4 | 1.42 |
| José A. Gámez | 3 | 640 | 61.05 |
| José Carlos Sancho | 4 | 382 | 29.97 |
| Antonio Robles | 5 | 481 | 30.40 |