Optimal quorumcast routing

Author

Low, Chor Ping

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore

Volume

5

fYear

1998

fDate

1998

Firstpage

3013

Abstract

Multicasting is the transmission of data packets from a source to multiple destinations, known as the multicast group. Quorumcasting, which is generalization of multicasting, is the sending of these data packets to only a subset of nodes in the multicast group, which we call the quorum group. The quorumcast routing problem is that of finding the least cost tree which spans the source node and a quorum group. This problem is known to be NP-complete. Therefore, exhaustive search algorithms are generally used to find a solution for the problem. We introduce the notion of a threshold value and show that how this value can be used to significantly reduce the running time of exhaustive search algorithms for the quorumcast routing problem

Keywords

multicast communication; optimisation; packet switching; telecommunication network routing; tree searching; NP-complete problem; data packets transmission; exhaustive search algorithms; least cost tree; multicast group; multicasting; optimal quorumcast routing; quorum group; running time reduction; source node; threshold value; Access protocols; Costs; Data engineering; Database systems; Multicast algorithms; Permission; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE

Conference_Location

Sydney,NSW

Print_ISBN

0-7803-4984-9

Type

conf

DOI

10.1109/GLOCOM.1998.776625

Filename

776625