Title :
Improving shortest path routing in Hyper-de Bruijn networks
Author :
Nguyen, Ngoc Chi ; Dinh, Thanh Vu ; Anh, Tuan Dang
Author_Institution :
Dept. of Telecommun. Eng., HoChiMinh City of Univ. Technol., Ho Chi Minh City
Abstract :
The Hyper de Bruijn networks have shown to have both advantages of Hypercube and de Bruijn network including short diameter for a large number of nodes, independence of degree and diameter, supporting for fault tolerance and shortest path routing. Therefore, in this article, we investigate the properties of Hyper de Bruijn Network in general cases (not binary case like the other authors) and propose an efficient shortest path routing algorithm in this topology.
Keywords :
graph theory; hypercube networks; fault tolerance; hyper-de Bruijn networks; hypercube network; shortest path routing; Broadcasting; Cities and towns; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Network topology; Parallel processing; Routing; Telecommunication network topology; Very large scale integration; Hypercube graph; de Bruijn graph; fault tolerant; hyper-deBruijn; hyper-deBruijn-Aster; interconnection network; shortest path;
Conference_Titel :
Strategic Technology, 2007. IFOST 2007. International Forum on
Conference_Location :
Ulaanbaatar
Print_ISBN :
978-1-4244-3589-0
Electronic_ISBN :
978-1-4244-1831-2
DOI :
10.1109/IFOST.2007.4798585
