Technical reports

# Optimal routing in 2-jump circulant networks

**Borut Robič**

June 1996, 7 pages

## Abstract

An algorithm for routing a message along the shortest path between a pair of processors in 2-jump circulant (undirected double fixed step) network is given. The algorithm requires O(d) time for preprocessing, and l = O(d) routing steps, where l is the distance between the processors and d is the diameter of the network.

## Full text

PS (0.1 MB)

## BibTeX record

@TechReport{UCAM-CL-TR-397, author = {Robi{\v c}, Borut}, title = {{Optimal routing in 2-jump circulant networks}}, year = 1996, month = jun, url = {http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-397.ps.gz}, institution = {University of Cambridge, Computer Laboratory}, number = {UCAM-CL-TR-397} }