Sciweavers

1503 search results - page 72 / 301
» Self-optimizing distributed trees
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
14 years 1 months ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu
ICPPW
2002
IEEE
14 years 2 months ago
A Structural Framework for Modeling Multi-Stage Network Attacks
Incidents such as Solar Sunrise and Nimda demonstrate the need to expressively model distributed and complex network attacks. To protect information systems, system administrators...
Kristopher Daley, Ryan Larson, Jerald Dawkins
ICDCS
1999
IEEE
14 years 2 months ago
On Providing Quality-of-Service Control for Core-Based Multicast Routing
In this paper, we develop e cient admission control tests for member join leave and its associated state refresh and update procedures for receiver-initiated core-based multicast ...
Hung-Ying Tyan, Chao-Ju Hou, Bin Wang 0002
ICDCS
1996
IEEE
14 years 2 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda