Abstract

A process is disclosed for effecting transmission over a generally cyclic communication system comprising numerous networks interconnected by gateway pairs. Each gateway of each pair implements a store-and-forward protocol whereby each gateway forwards message packets propagated over its associated network except for any packets that are destined for a device which has previously appeared in the sending address of another packet. In order to utilize this protocol as a basis for transmission, the system is covered with a set of spanning trees that satisfy capacity and reliability requirement. Each spanning tree is assigned a unique identifier and each packet traversing the system is assigned to and conveys the specified spanning tree. Each gateway passes the packet to determine the assigned spanning tree and forwards the packet accordingly. To mitigate system flooding by a newly connected device, the protocol may also incorporate a delay to allow the gateways to learn the location of the new device.

Other References

• Proceedings of the Fifth International Conference on Computer Communication; "On the Generation of Explicit Routing Tables"; K. Maruyama and G. Markowsky; 9-9-82,; pp. 90-95
• "Local Area Network Connection", Telecommunications, Apr., 1984 by B. Stewart, B. Hawe and A. Kirby
• "Transparent Interconnection of Local Area Networks", Journal of Telecommunications Networks, Sep., 1984 by B. Hawe, A. Kirby and B. Stewart
• "Local Area Network Applications," i Telecommunications, Sep., 1984 by B. Stewart and B. Hawe
• "An Architecture for Transparently Interconnecting IEEE 802 Local Area Networks", a Digital Equipment Corporation paper submitted to IEEE, Oct., 1984
• "Vitalink Satellite Communications Systems", an information brochure of the Vitalink Communications Corp., Oct., 1984
• "`Bridges` Smooth Troubled Waters for Wide-Area Networking", Data Communications, Mar., 1985 by J. H. Hart