Glenayre Electronics, Inc.

Joseph P Tosey

Andrei Godoroja

Glenn S Fawcett

James H Belton

An authorization-update process for use in a user-operated device re-authorizes an operating session after a rapid idle timeout using the authorization-update process, which has fewer steps than a normal authorization process. The re-authorization process can require only a single entry or input event by the user in response to a prompt by the device to re-authorize the user and continue to the operating session. Thus, the authorization-update process is significantly faster than re-authorization in the conventional manner. In one embodiment, the prompt includes a display of several characters. The user selects a predetermined character to re-authenticate the user, thereby continuing the operating session from the same point at which the idle timeout occurred. In a further aspect, the user has a predetermined time period to select the correct character to continue the operation session. Not meeting the time requirement or selecting a wrong character or icon will cause the device to require a full authorization process to enable the user to operate the device. Alternatively, the authorization update process may use the position of the cursor or a voice signal to re-authorize the operating session.

Operating session reauthorization in a user-operated device

A method of preparing a group distribution graph for multicast transmission of a packet to a group of nodes in a computer network is disclosed. The method includes first preparing a spanning tree that includes every node in the computer network. A group distribution graph patterned after the spanning tree is then prepared by evaluating a node in the group distribution graph to determine whether the node is included in the group of nodes. If the node is not included in the group of nodes, and if the node has exactly one neighboring node, the node is removed from the group distribution graph. Likewise, if the node is not included in the group of nodes, and if the node has exactly two neighboring nodes, the node is removed from the group distribution graph by prescribing direct communication between the neighboring nodes, thus bypassing the removed node. In this manner, packet transmission and processing capacity of the network is more efficiently managed.

Computer network and methods for multicast communication

A method for validating a message packet communicated from a source node to a destination node in a computer network is disclosed. The source node and destination node have access to a clock mechanism synchronized with a common time frame. The method comprises generating a first security key using a time reference obtained from the clock mechanism and a password known by the source node and destination node, communicating the first security key with a message packet from the source node to the destination node, and when the first security key and message packet are received by the destination node, generating a second security key using the password and the time reference and comparing the second security key with the first security key. The message packet is discarded if the second security key does not correspond with the first security key. In another aspect of the invention, the method further comprises communicating a first time reference obtained from the clock mechanism with a message packet, and when the first time reference and message packet are received by the destination node, comparing the first time reference with a second time reference obtained from the clock mechanism. The message packet is discarded if the time difference between the first time reference and the second time reference is greater than a predetermined amount of time. The predetermined amount of time may be based on a calculated normal packet transmission delay.

Apparatus and methods for transmission security in a computer network

An improved computer network and methods for determining current configurations of abstract nodes is accomplished by using era values in the configurations of the abstract nodes. Abstract nodes which represent network components within the network have access to databases containing recorded node configurations. Associations between nodes are established when a node configuration is advertised and recorded in another node's database. Database information on node configurations is kept current by comparing the era value of each advertised node against the era value of the same node as recorded in the database. Since era values indicate a relative time reference for which the node configuration is operative, a more current era value indicates a more current node configuration. Abstract nodes are completely independent entities. As a result, a node's configuration may be independently modified by more than one component in the network. Application of the network in a hot-standby system is also disclosed.

Growing community of inventors

Burnaby, Canada

Joseph P Tosey