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 language||English (US)|
|Number of pages||8|
|Journal||Proceedings - IEEE INFOCOM|
|State||Published - 1994|
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering