Andere Kunden interessierten sich auch für
![Fault and Defect Tolerant Computer Architectures: Reliable Computing with Unreliable Devices]( "Fault and Defect Tolerant Computer Architectures: Reliable Computing with Unreliable Devices")
Fault and Defect Tolerant Computer Architectures: Reliable Computing with Unreliable Devices60,99 €![Distributed Fault-Tolerant Quality of Service Routing in Hybrid Directional Wireless Networks]( "Distributed Fault-Tolerant Quality of Service Routing in Hybrid Directional Wireless Networks")
Distributed Fault-Tolerant Quality of Service Routing in Hybrid Directional Wireless Networks60,99 €![An Analysis of Failure Handling in Chameleon, A Framework for Supporting Cost-Effective Fault Tolerant Services]( "An Analysis of Failure Handling in Chameleon, A Framework for Supporting Cost-Effective Fault Tolerant Services")
An Analysis of Failure Handling in Chameleon, A Framework for Supporting Cost-Effective Fault Tolerant Services60,99 €![Battle of Midway: USS Hornet Air Group]( "Battle of Midway: USS Hornet Air Group")
Battle of Midway: USS Hornet Air Group60,99 €![1111th Engineer Group in the Bulge: The Role of Engineers as Infantry in AirLand Battle]( "1111th Engineer Group in the Bulge: The Role of Engineers as Infantry in AirLand Battle")
1111th Engineer Group in the Bulge: The Role of Engineers as Infantry in AirLand Battle61,99 €![Combat Air Forces Campaign Level Modernization Planning: A Study in Group Decision Making]( "Combat Air Forces Campaign Level Modernization Planning: A Study in Group Decision Making")
Combat Air Forces Campaign Level Modernization Planning: A Study in Group Decision Making60,99 €![It was Sheridan's Fault not Custer's: LTG Sheridan's Campaign Plans Against the Plains Indians and the Ties to Current Planning]( "It was Sheridan's Fault not Custer's: LTG Sheridan's Campaign Plans Against the Plains Indians and the Ties to Current Planning")
It was Sheridan's Fault not Custer's: LTG Sheridan's Campaign Plans Against the Plains Indians and the Ties to Current Planning60,99 €
To address the group key management problem for modern networks this research proposes a lightweight group key management protocol with a gossip-based dissemination routine. Experiments show that by slightly increasing workload for the key update mechanism, this protocol is superior to currently available tree-based protocols with respect to reliability and fault tolerance, while remaining scalable to large groups. In addition, it eliminates the need for logical key hierarchy while preserving an overall reduction in rekey messages to rekey a group. The protocol provides a simple "pull" mechanism to ensure perfect rekeys in spite of the primary rekey mechanism's probabilistic guarantees, without burdening key distribution facilities. Benefits of this protocol are quantified versus tree-based dissemination in Java simulations on networks exhibiting various node failure rates.