JPS63187937A - Network connection system - Google Patents

Abstract

PURPOSE:To combine a complicated network with giving the number of degrees of freedom of a composite network constitution by adopting a routing method with less regulation on an address giving limit. CONSTITUTION:The subnetworks of bus-type networks and star-type networks 3 are connected with the backbone networks of ring-type networks 1, and the complicated network of a logically tree structure is constituted. Plural ring nodes 5 are connected to the ring-type networks in rings so as to generate the network. The stations 4 which have unique addresses in the whole composite network are connected to transmission lines to be shared in the bus-type networks 2. The stations 4 which have unique addresses in the whole network are connected in a star-type with the controller of the star-type networks such as a PBX in a center in the star-type networks 3. From the above station 4, and based on the address of the transmitter contained in the selected packet, the address of the station 4 on the subtransmitting lines of one node and the station address on the other subtransmitting lines are registered on the table with discrimination. And on the basis of the table, the lines are set up.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to means for interconnecting a composite network in which a ring network and a bus or star network are combined.

〔overview〕

The present invention provides a network in which one or more ring networks and a plurality of bus-type or star-type subnetworks are logically combined into a tree structure, by having station address tables in nodes on the ring network. , it is possible to reduce the routing load.

[Conventional technology]

Traditionally, this type of complex network architecture was created with the assumption that it would be a small network, and the routing load was reduced by placing restrictions on the address assignment method.

[Problem that the invention seeks to solve]

These conventional routing methods place restrictions on address allocation and are based on small-scale networks, making it impossible to build large-scale, complex networks. Since an address is assigned, there is a drawback that the station address changes as the device moves.

The present invention aims to eliminate such drawbacks, and aims to provide a network connection system that employs a routing method with fewer restrictions on address assignment.

[Means for solving problems]

In the present invention, one node on one ring-shaped main transmission path is connected to one node on another ring-shaped main transmission path, and a bus-shaped or star-shaped secondary transmission is connected to each node on each main transmission path. In a network connection method, the ring-shaped The main transmission path of is configured to broadcast packets, and each of the above nodes uses the address of the station on its own secondary transmission path and the address of the other node based on the source address included in the packet sent from the above station. The apparatus is characterized in that it includes table means for distinguishing and registering the addresses of stations on the secondary transmission path, and the setting means sets the route based on this table.

[Effect]

A station address table of stations connected to a ring node is automatically created during operation based on SA information in the SA field on a packet frame. Packets are sent as broadcasts, and the node that receives them will frame the packet if it is addressed to a station under it based on the station address table, and will not bridge it if the packet is not addressed to a station under it.

〔Example〕

Embodiments of the present invention will be described below based on the drawings.

FIG. 1 is a block configuration diagram showing the configuration of a composite network that is an embodiment of the present invention. Bus type network 2 is added to the backbone network of ring type network 1.
and the subnetworks of the star network 3 are connected to form a logically complex network with a tree structure. That is, in this network, there are no redundant buses in the communication route, and the communication route is uniquely determined. A plurality of ring nodes 5 are connected in a ring shape to the ring network 1 to form a network. In the bus type network 2, a station 4 having a unique station address in the entire complex network is connected to a shared transmission path. In the star network 3, stations 4 having unique addresses in the entire composite network are connected in a star configuration around a star network control device such as a PBX.

FIG. 2 shows an example of a packet format flowing within a ring and a packet format flowing through a bus network 2 and a star network 3. In FIG. A subnetwork packet has a field DA indicating the destination address of the station and a field SA indicating the source address.
and the control field C of the subnetwork,
It consists of a data field DATA on the subnetwork and a frame check sequence field FC3 of the subnetwork. Further, a ring type network packet includes a field R-DA indicating a destination node number on the ring, a field R-3A indicating a source ring number on the ring, and a control field on the ring)'R-CONT. It consists of a ring network frame check sequence field R-Fe2 and a subnetwork packet field in which a subnetwork packet is loaded as is. However, it is also possible that the frame check sequence FC3 of the subnetwork is not rotated around the ring, but is checked at the ring node, and then generated and added again at the final stage of the ring.

FIGS. 3 to 6 are diagrams explaining the routing method used in the present invention. Here, one ring-type network and a path-type network around it will be explained as an example, but the principle is the same even if the network becomes complex. A node 5A with a node number A, a node 5B with a node number B, a node 5C with a node number C, and a node 5D with a node number are connected to the ring network. Further, a bus type network is connected to the node 5A, and a station 4a with a station address a is on this path type network.

Station 4b whose station address is b.

Station 4c with station address C is connected. The node 5B has a station 4h with a station address h, the node 5C has a station 4d with a station address d, the station 4e with a station address e, and the station 4f with a station address f, and the node 5D has a station address g. Station 4g is connected.

FIG. 3 shows that when the station address table for each node has not been created at all, station 4a
It shows the flow of packets when packets are sent from station 4e to station 4e and the generation results of station address tables for each node. When a packet is sent from station 4a, node 5A looks at address a in the SA frame of the packet, registers in the station address table that a is under its own node, and broadcasts it to all nodes. 5
It is registered in D that there is no a under its own node.And since the packet ODA address d is not in the "no side" table of the station address table, node 5
B, 5C and 5D pass and bridge the packet. Since station 4e has station address e in the bus network under node 5C, station 4e receives the packet.

FIG. 4 shows the flow of packets □ when a packet is sent from station 4e to station 4a after the state shown in FIG. 3, and the result of generating a station address table for each node. A station address table is created in the same manner as in FIG.
D passes the broadcast packet.

FIG. 5 shows the flow of packets when packets are sent from station 4a to station 4e in the state shown in FIG. 4, and the generation results of station address tables for each node. In this case, node 5B and node 5D
has a station address table in which address e is not under its own node, so nodes 5B and 5D do not pass the packet.

FIG. 6 shows the flow of packets when packets are sent from station 4g to station 4e and the generation results of station address tables for each node. Since the nodes 5A and 5D have station address tables in which the address e is not under their own nodes, the nodes 5A and 5D do not pass the packet.

(Hereinafter referred to as the margin of this page) The table shows the process of creating a station address table through the use of packets as shown in FIGS. 3 to 6.

In this way, during operation, a station address table is created using the SA frame of a packet as an information source, and when the station address table is finally completed, unnecessary frames no longer flow on the bus network.

FIG. 7 is a flowchart showing the procedure from receiving a packet from a bus network to sending the packet to a ring network or discarding the packet. If the received packet is determined to be communication within a bus network, the received packet is discarded within the node. All other packets are sent onto the ring. .

Since some of them are not registered in the station address table, there may actually be communication within the bus network. In such a case, even if a packet is sent out on the ring and flows to another bus network, no other station will receive this packet because the station address is unique throughout the network. Broadcast communication is always performed on the ring network.

FIG. 8 is a flowchart showing the procedure for receiving a packet from the loop-side network and bridging it to a bus-type network, or discarding the packet because it is not addressed to a station under its own node.

〔Effect of the invention〕

As explained above, by adopting a routing method with fewer restrictions on address allocation, the present invention allows for a degree of freedom in the configuration of complex networks, allowing for the creation of complex networks, and station addresses. Since it is not restricted by the location of the device on the network, there is an advantage that there is no need to change the station address even when the device is moved.

[Brief explanation of the drawing]

FIG. 1 is a block configuration diagram showing the configuration of an embodiment of the present invention. FIG. 2 is a formant diagram of a packet used in an embodiment of the present invention. FIG. 3, FIG. 4, FIG. 5, and FIG. 6 are explanatory diagrams of the routing method used in the embodiment of the present invention. FIGS. 7 and 8 are flowcharts showing the operating procedure of the embodiment of the present invention. l...Ring network, 2...Bus network, 3...Star network, 4...Station, 5...Ring node.

Claims (1)

[Claims] (1) One node (5) on one ring-shaped main transmission path (1) and one node (5) on another ring-shaped main transmission path (1) are connected, and each main A bus-shaped or star-shaped secondary transmission line (2) is connected to a node (5) on the transmission line.
, 3) is included in the connected network, and has a setting means for setting a route through which packets transmitted between the stations (4) connected to the slave transmission path and having their own unique addresses. In this case, the ring-shaped main transmission path is configured to broadcast packets, and each of the nodes (5) transmits information on its own secondary transmission path based on the source address included in the packet sent from the station. 1. A network connection system comprising: table means for separately registering the address of a station on a slave transmission path of another node and the address of a station on a slave transmission path of another node, and said setting means is configured to set said route based on said table.