A fast search algorithm for the quorumcast routing problem

Information Processing Letters

Volumn 66, Issue 2, 1998, Pages 87-92

  Low, Chor Ping ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Algorithms; Exhaustive search algorithm; Multicast; NP completeness; Pruning search space; Quorumcast routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; PACKET NETWORKS;

PRUNING SEARCH SPACE; QUORUMCAST ROUTING;

DATA PROCESSING;

EID: 0032045979     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00033-7     Document Type: Article

References (5)

1. M. Ahmad, M.H. Ammar, S.Y. Cheung, Multi-dimensional voting, ACM Trans. Comput Systems 9 (1991) 399-431.
2. E.W. Dijkstra, A note on two problems in connexion with graphs. Numer. Math. 1 (1959) 269-271.
3. H. Garcia-Molina, D. Barbara, How to assign votes in a distributed system, J. ACM 32 (4) (1985) 841-860.
4. S.Y. Cheung, A. Kumar, Efficient quorumcast Routing Algorithms, IEEE INFOCOM 2 (1994) 840-847.
5. P. Winter, Steiner problem in networks: A survey, Networks 17 (1987) 129-167.