Stabilized binary tree protocol

Details Stabilized binary tree protocol Stabilized binary tree protocol

1986-12-05

1989-01-03

Yusko, Donald J.

Communications: electrical

Continuously variable indicating

With meter reading

340825510, 370 58, 364300, H04Q 900, H04Q 1104, G06F 700

Patent

active

047960230

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).

REFERENCES:
patent: 4071908 (1978-01-01), Brophy
patent: 4314233 (1982-02-01), Clark
patent: 4345326 (1982-08-01), Dieudonne et al.
patent: 4562426 (1985-12-01), Forney, Jr.
patent: 4562427 (1985-12-01), Ecton
patent: 4701756 (1987-10-01), Burr
Capetanakis, "Contention Resolving Tree Algorithms for Multiple Access Channels," IEEE CH 1435-7/79/0000 (1979).

Affiliated with

Also associated with

Rating

Stabilized binary tree protocol does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Stabilized binary tree protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stabilized binary tree protocol will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2170815