Efficient quorumcast routing algorithms

Shun Yan Cheung, Akhil Kumar

Research output: Contribution to journalArticle

52 Scopus citations

Abstract

The quorumcasting problem which is a generalization of multicasting is investigated with respect to the delivery of a message to its intended destination. While two straight forward solutions regarding the communication problem with an arbitrary q-subset suggest that with the appropriate set of q nodes the communications cost can be reduced, several heuristics to find low cost solutions for the quorumcasting problem are introduced. These heuristics are evaluated by comparing their solutions with exact solutions obtained from enumerating the solution space, and also with 'random' solutions from a problem treated like a multicast. The results were used to determine the performance of heuristics in comparison to optimal solutions and random solutions respectively.

Original languageEnglish (US)
Pages (from-to)840-847
Number of pages8
JournalProceedings - IEEE INFOCOM
Volume2
StatePublished - 1994

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Efficient quorumcast routing algorithms'. Together they form a unique fingerprint.

  • Cite this