Greedy Routing in Circulant Networks

Identificador:  imarina:9261594

Handle: https://hdl.handle.net/20.500.11797/imarina9261594

Autors:  Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose

Resum:
We address the problem of constructing large circulant networks with given degree and diameter, and efficient routing schemes. First we discuss the theoretical upper bounds and their asymptotics. Then we apply concepts and tools from the change-making problem to efficient routing in circulant graphs. With these tools we investigate some of the families of circulant graphs that have been proposed in the literature, and we construct tables of large circulant graphs and digraphs with efficient routing properties.