Stabilized binary tree protocol
US4796023A · kind A · utility
30Cited by
6References
14Claims
0Family size
Inventor
Key dates
| Filing date | Dec 5, 1986 |
| Grant date | Jan 3, 1989 |
| Priority date | — |
| Expiry date | Dec 5, 2006 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L12/28
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A binary tree protocol (FIG. 6 for example) in which for any given state in the binary tree, the subsequent state for each right substate is determined by applying the same state logic. In the preferred embodiment, (FIG. 6) a subsequent state of state 7, for example, may be state 2, just as the subsequent state of state 5 may be state 3. Since the state logic for the right-most substates is the same as for all other right substates, the concept of a "processing cycle" is eliminated. The protocol continuously moves from state to state (FIGS. 1, 6, 7, 8).
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.