Abstract: A system has a node connected to a network, the node generating a separate session message for each of a plurality of users. The node places each of the separate session message in a slot in a single virtual circuit message, and transmits the virtual circuit message onto the network. A server is connected to the network, and the server receives the virtual circuit message, and the server identifies each of the separate session messages. The server then transmits each of the separate session message to a user having a session corresponding to each of the separate session messages.

Abstract: A ring purging station for a token-ring network is disclosed. The station performs purging operations to remove no-owner frames and frame remnants from the network. The station begins a purging operation by detecting the token on the network and removing it. The station then begins stripping all frames and remnants of frames that it receives from the network, and transits one or more purge marker frames. When the station detects one of the one or more purge marker frames it transmitted, it ends the purging operation, and releases the token back onto the ring. In this way no-owner frames and frame fragments are removed from the network, while the ring is otherwise normally operating. In an embodiment of the invention, a sequence number is associated with each purging operation, included in the purge marker frame(s), and verified upon receipt of the purge marker frame(s). The station also corrects multiple token conditions when a multiple token condition is detected during a purging operation.

Abstract: A method and related apparatus for establishing a point-to-point cross-link between two bridges in a bridged communication network. The bridged communication network is first configured in a loop-free arrangement by a spanning tree algorithm that selects which links of every bridge to activate in order to form the spanning tree active configuration. Then at least one cross-link not defined by the spanning tree configuration is established for routing of messages as an alternative to a spanning tree path. A protocol in each bridge ensures that no loops are formed and that only messages to preselected locations are passed over the cross-link. An optional optimization procedure measures message propagation times in both directions between the two bridges and over both the cross-link path and the spanning tree path, to determine whether to modify usage of the cross-link.

Abstract: A distributed digital data processing system includes a plurality of nodes which communicate over a network. A node maintains one or more objects, each of which may be a file, that is, an addressable unit in the system, such as a program, database, text file, or the like, or a directory which may contain one or more files or other directories. One node maintains a naming service which associates each object in the system with one or more protocol towers. Each protocol tower identifies the object name and a series of entries each identifying a name for each of the protocol layers, along with the communications parameters and address information, to be used in communicating with the object. When a node requires access to an object maintained by another node, it first retrieves from the naming service the protocol towers for the object. The node also maintains a tower identifying the names of each of the protocols over which it can communicate.

Abstract: A local area network for interconnecting terminals and other users and data processing systems and other service providers over a communications link. The users and providers connect to the communications link by means of interface units each of which may connect to several users or providers. The interface units communicate over the communications link by means of messages. When a user requires the use of a service, the interface unit establishes a virtual circuit between it and the interface unit connected to the service provider and a service session which allows the user and the service provider to communicate over the virtual circuit. If several users connected to the one interface unit as the first user require services provided by providers which connected to the same interface unit as the first provider, they communicate in sessions over the same virtual circuits. The session messages are accumulated into single virtual circuit messages that are acknowledged in unison by the receiving interface unit.

Abstract: A local area network for interconnecting terminals and other users and data processing systems and other service providers over a communications link by means of interface units each of which may connect to several users or providers. The interface units communicate over the communications link by means of messages. When a user requires the use of a service, the interface unit establishes a virtual circuit between it and the interface unit connected to the service provider and a service session which allows the user and the service provider to communicate over the virtual circuit. If several users connected to the one interface unit as the first user require services provided by providers which connected to the same interface unit as the first provider, they communicate in sessions over the same virtual circuits. The session messages are accumulated into single virtual circuit messages that are acknowledged in unison by the receiving interface unit.