Efficient algorithms for quorumcast routing
Chia, Yew Chong.
Date of Issue1997
School of Electrical and Electronic Engineering
Multicasting is the transmission of data packets from a source to multiple destinations, known as the multicast group. Quorumcast routing problem, which is a generalisation 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. The need for quorumcast routing arises when multiple processes need to update shared resources in a distributed application environment. With the increasing use of a distributed application paradigm, it is important that heuristics can produce near-optimal solution efficiently when solving the quorumcast routing problem. Some heuristics have been proposed in the literature for quorumcast routing problem by optimising the total cost of transmission. The purpose of this dissertation is to explore the different algorithms used to solve the quorumcast routing problem and compare existing algorithms to the algorithms proposed by us.
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
NANYANG TECHNOLOGICAL UNIVERSITY