Unicast, multicast, and broadcast in enhanced Fibonacci cubes

Author

Qian, Haifeng ; Wu, Jie

Author_Institution

Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA

fYear

1995

fDate

20-23 Sep 1995

Firstpage

158

Lastpage

161

Abstract

The enhanced Fibonacci cube (EFC) is defined based on the sequence F_n=2F_n-2+2F_n-4. It contains the Fibonacci cube as a subgraph and maintains virtually all the desirable properties of the Fibonacci cube, and it also possesses properties such as the Hamiltonian property that the Fibonacci cube does not have. In this paper, we study data routing, namely, unicast, multicast and broadcast in the enhanced Fibonacci cube. The time and traffic steps are used to measure the efficiency of the routing algorithms. The unicast algorithm, which uses a Hamming distance path for any two nodes in EFC, is time and traffic optimal. The broadcast algorithm which employs the enhanced Fibonacci tree is traffic optimal and near time optimal. Two heuristic multicast algorithms are proposed which are based on an enhanced Fibonacci tree and a Hamiltonian cycle, respectively

Keywords

broadcasting; hypercube networks; telecommunication network routing; telecommunication traffic; trees (mathematics); Hamiltonian cycle; Hamiltonian property; Hamming distance path; broadcasting; data routing; efficiency; enhanced Fibonacci cubes; heuristic multicast algorithms; multicasting; sequence; subgraph; time steps; traffic steps; unicasting; Broadcasting; Computer science; Hamming distance; Hypercubes; Multicast algorithms; Multiprocessor interconnection networks; Routing; Telecommunication traffic; Time measurement; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 1995. Proceedings., Fourth International Conference on

Conference_Location

Las Vegas, NV

Print_ISBN

0-8186-7180-7

Type

conf

DOI

10.1109/ICCCN.1995.540114

Filename

540114