Many fully-adaptive algorithms have been proposed for k-ary ncubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormholerouted k-ary n-cubes with fully adaptive routing. This model requires a running time of O(I) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.