“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 11093 |
|
||||||
| Abstract: | |||||||
|
Several analytical models of fully adaptive routing have recently been proposed for wormhole-routed k-ary n-cubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important nonuniform traffic patterns, such as hot-spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. In an effort to fill this gap, this paper describes the first analytical model of fully adaptive routing in k-ary n-cubes in the presence of hot-spot traffic. Results from simulation show close agreement with those predicted by the model
Download TeX format |
|||||||
| back to top | |||||||
