Probabilistic Optimization of LKH-based Multicast Key Distribution Schemes
draft-selcuk-probabilistic-lkh-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Christopher McCubbin , Professor Deepinder Sidhu | ||
| Last updated | 2001-01-30 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
Currently, the most efficient techniques for multicast key management are based on the Logical Key Hierarchy (LKH) scheme. In current practice, LKH trees are organized as balanced binary trees, which give a uniform O(log n) complexity for compromise recovery in an n- member group. In this draft, we propose organizing the LKH trees with respect to the members' compromise probabilities instead of keeping a balanced tree, in a spirit similar to data compression techniques such as Huffman and Shannon-Fano coding. We describe two such probabilistic algorithms which improve the performance of an LKH scheme by probabilistic organization of the tree. Preliminary simulation results show that significant gains can be obtained by these techniques.
Authors
Christopher McCubbin
Professor Deepinder Sidhu
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)