Patent
1993-10-13
1997-05-13
Lee, Thomas C.
39520004, 39520012, G06F 1516
Patent
active
056301847
ABSTRACT:
A computer forms a node in a network, consisting of computer nodes linked together into a minimum spanning tree topology. When a computer receives a message from a first node linked to it, it forwards the message to other nodes linked to that computer, as well as storing information about the message. As replies are received from the other computers, they are stored and collated together, to allow the computer to send just a single reply message back to the originating node based on the collated replies. This single reply is in turn collated at the next node. The message requests deletion of a particular node from the network. No node deletes the node from the network until replies have been received from all the nodes to which the message was forwarded.
REFERENCES:
patent: 5355371 (1994-10-01), Auerbach et al.
patent: 5437046 (1995-07-01), Bright et al.
Adrian Segall et al. "Reliable Multiuser Tree Setup with Local Identifiers", IEEE Journal on Selected Areas in Comm., vol. 9 No. 9 Dec. 1991.
Adrian Segall et al. "Route Setup with Local Identifiers", IEEE Transactions on Comm., vol. COM34 No. 1 Jan. 1986.
Gopal et al. "Directories for networks with casually connected users" IEEE Infocom '88, pp. 1060-1064 1988.
Roper Michael I.
Wallis Graham D.
Cockburn Joscelyn G.
Dinh D.
International Business Machines - Corporation
Lee Thomas C.
LandOfFree
Method of deleting and adding nodes in a spanning tree network b does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of deleting and adding nodes in a spanning tree network b, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of deleting and adding nodes in a spanning tree network b will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1395099