Multicast is a convenient and important mode of communication in internetworks, and there has been a number of studies on eecient routing of multicast traac. In particular , simulation has been performed to evaluate the trade-oos between source-speciic trees and shared trees, and between various routing algorithms. In this paper, we show that the consideration of security brings a new set of trade-oos in routing private multicast traac. We describe these trade-oos between security, trust, knowledge of group membership and of topology, types of multicast tree, bandwidth consumption, and latency. We propose four methods to improve eeciency: message pruning, message reprocessing , hot-start authentication, and continuous authentica-tion. This study of new trade-oos helps in choosing the appropriate multicast strategies for speciic applications.
[1]
D. Estrin,et al.
The Trade o s of Multicast Trees and Algorithms
,
1994
.
[2]
George C. Polyzos,et al.
Multicast routing for multimedia communication
,
1993,
TNET.
[3]
R. Ravi,et al.
Rapid rumor ramification: approximating the minimum broadcast time
,
1994,
Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4]
Tony Ballardie,et al.
A New Approach to Multicast Communication in a Datagram Internetwork
,
1995
.
[5]
Li Gong,et al.
Multicast security and its extension to a mobile environment
,
1995,
Wirel. Networks.
[6]
James Kadirire.
Minimising packet copies in multicast routing by exploiting geographic spread
,
1994,
CCRV.
[7]
Hans Eriksson,et al.
MBONE: the multicast backbone
,
1994,
CACM.