JPH022762A - Inter-node traffic congestion informing system - Google Patents

Abstract

PURPOSE:To inform congestion in traffic to an adjacent node without interposing the processing of a processor and to follow the congestion in the traffic whose state changes frequently by expressing the congestion in the traffic in a numeric value at each node, and controlling the length of a packet to be transmitted corresponding to the numeric value. CONSTITUTION:Each node expresses the congestion state of the traffic in the numeric value by a state expression means 1, and controls the length of a transmission packet corresponding to the numeric value by an adaptive type packet assembling means 2. When no data to be transmitted exists, a dummy data is transmitted by putting with a dummy data insertion means 3. At a reception side, packet size is counted by a traffic congestion state counting storage means 4, and the traffic congestion state of the adjacent node is stored. Thereby, it is possible to inform the congestion of the traffic with high frequency mutually without interposing a CPU and to follow the congestion in the traffic whose state changes frequently.

Description

[Detailed Description of the Invention] [Summary] Regarding an inter-node traffic congestion status notification method in a packet communication system, the present invention aims to provide an inter-node traffic congestion status notification method that can follow rapidly changing traffic width conditions. On the sending side of each node, there is a state expression means that expresses the traffic congestion state numerically, an adaptive packet assembly means that increases or decreases the length of the packet to be transmitted and packetizes it according to the numerical value, and there is no data to be sent. In this case, a dummy data insertion means is provided to insert dummy data into a packet with a packet length according to the traffic congestion state, and the receiving side counts the packet size and calculates the traffic congestion of the adjacent node directly connected to the link. The configuration includes a traffic comparison state counting storage means for knowing and storing the state.

[Industrial application field]

The present invention provides a packet communication system in which a plurality of distributed nodes each having an arbitrary number of input ports and output ports are connected by links, and each node performs routing and communicates with a partner node using a packet communication method. This invention relates to an inter-node traffic congestion state notification method.

Future communication networks will tend to develop into integrated multimedia networks that handle a mixture of various types of information.

In such an integrated network, communication speed and reliability are important.

Since the required performance, such as real-time performance, changes greatly over time and space, depending on changes in the network status,
Each node needs to know the traffic congestion state and perform routing to communicate with the other node, but each node needs to be able to follow rapid changes in order to notify the traffic congestion state. desired.

[Conventional technology]

In conventional packet communication systems, multiple distributed nodes with an arbitrary number of input ports and output ports are connected by links, and each node performs routing and communicates with the other node. Each node has a routing table corresponding to each destination, and each relay node determines the output link based on this table.

In this case, a routing algorithm is required that adaptively sets routes depending on the traffic congestion state.

To this end, the traffic congestion status of adjacent nodes is sequentially transmitted using control packets, and routing is performed based on this traffic width comparison status information.

[Problem to be solved by the invention]

However, when there are rapid changes in traffic congestion, the notification consumes the bandwidth of the link transmission path.
Furthermore, since it involves processing by the node's processor, it is not possible to notify the traffic congestion status frequently, and there is a problem that the adaptive algorithm for routing does not work well in situations where the status changes rapidly.

An object of the present invention is to provide an inter-node traffic congestion notification method that can follow rapidly changing traffic congestion conditions.

[Means to solve the problem]

FIG. 1 is a diagram showing the principle of the present invention, in which (A) is a block diagram showing the configuration, and (B) shows the traffic congestion state notification system.

In a packet communication system, a plurality of distributed nodes each having an arbitrary number of input ports and output ports are connected by links, and each node performs routing and communicates with the other node using the packet communication method. As shown in A), the transmitting side of each node includes a state expressing means 1 that numerically expresses the traffic congestion state;
Adaptive packet assembling means 2 that increases or decreases the length of the packet to be transmitted and packetizes it according to the numerical value, and dummy data that inserts dummy data into a packet with a packet length that corresponds to the traffic congestion state when there is no data to be sent. Insertion means 3 are provided.

Further, the receiving side is provided with traffic congestion state counting storage means 4 for counting packet sizes and knowing and storing the traffic congestion states of adjacent nodes directly connected to the link.

[For production]

According to the present invention, each node uses the state expression means 1 to express the traffic congestion state numerically, and the adaptive packet assembly means 2 increases or decreases the transmission packet length according to the numerical value. In other words, when the traffic congestion state is small, (B) (
As shown in (1), the packet length is shortened, and when the traffic congestion is high, the packet length is lengthened as shown in (2) of (B), and data a, b, or c is added to these packets. d
.

Add e and send.

When there is no data to be sent, the dummy data insertion means 3 adds dummy data and sends it as shown in (1) and (2) of (B).

On the receiving side, in the traffic congestion state counting storage means 4,
The packet size is counted to know and memorize the traffic congestion state of adjacent nodes directly connected to this link.

This allows the traffic congestion state of adjacent nodes to be determined, so adaptive routing is performed.

In this case, the traffic width comparison status is sent superimposed on the data actually flowing, so the bandwidth of the transmission path is not consumed, and the traffic congestion status is known by counting the packet size before disassembling the packets. , Since no processor processing occurs, it is possible to notify each other frequently,
It becomes possible to follow rapidly changing traffic congestion conditions.

〔Example〕

An embodiment of the present invention will be described below with reference to the accompanying drawings.

FIG. 2 is a block diagram showing the configuration of a node according to an embodiment of the present invention, and FIG. 3 is a block diagram showing the configuration of a packet processing section.

The packets input from links 1 to i in FIG.

The routing processing unit 5 determines the output link by referring to a control table 6 that indicates which link should be used to output data to bring the data closer to the destination node according to the traffic congestion state of the adjacent node, and performs the corresponding packet processing. Outputs operation commands to the section.

The instructed packet processing unit extracts data from the data buffer 7, packetizes it, and sends it to the link.

In the data buffer 7, the traffic congestion status can be determined by comparing the stored data with the allowable data value.The status display unit 29 in FIG. The data of parts 10 to 2 are reported to the length counting part 24.

The operation of the packet processing section will be described below with reference to FIG.

When transmitting data, the data length counting unit 24 divides the data to be transmitted into lengths corresponding to the current traffic and congestion state, and the packet assembling unit 25 packetizes the data and sends it to the transmission control unit 26. .

At this time, if the data to be sent is insufficient, the dummy data from the dummy data sending unit 28 is transferred to the switching control unit 27 so that the length corresponds to the traffic congestion state value.
Insert via.

Furthermore, when there is no data to be sent to the link, under the control of the switching control unit 27, dummy data corresponding to the current traffic congestion state value is periodically sent, and the information on the traffic congestion state is always used to compose the packet. and send it to neighboring nodes.

Note that when there is no data to actually be transmitted, the transmission path is in an empty state, and invalid traffic caused by dummy packets does not pose a problem.

The packet length of the packet received by the receiving unit 1117E unit 20 is first measured by the packet length measuring unit 21, and this result is converted into a traffic congestion status value and written to the register 23, so that the packet is decomposed using a processor. Know the traffic congestion status in advance.

Next, this packet is returned to the original data by removing the dummy data in the packet disassembly unit 22, and is transferred to the data buffer 7.

This traffic congestion status value of the adjacent node is sent to the control table 6, and the control table 6 determines which link should be used to output data when transmitting data from the own node to each communicating node to get closer to the destination node quickly. is rewritten every time the traffic congestion status value is input.

The routing processing unit 5 refers to this control table 6 and performs routing adaptively.

In other words, notifying neighboring nodes of the traffic congestion state does not involve processing by the processor or consuming the bandwidth of the transmission path, so it can be done frequently, and changes in the traffic congestion state can be notified. This makes it possible to perform adaptive routing even in the case of a multimedia integrated network where traffic is intense.

〔Effect of the invention〕

As explained in detail above, according to the present invention, the traffic congestion state is notified to adjacent nodes without going through processor processing and without consuming the bandwidth of the transmission path.
This has the effect of making it possible to perform adaptive routing even in the case of a multimedia integrated network, etc., where the traffic congestion state changes rapidly.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the principle of the present invention, FIG. 2 is a block diagram showing the configuration of a node in an embodiment of the present invention, and FIG. 3 is a block diagram showing the configuration of a packet processing section. In the figure, l is a state expression means, 2 is an adaptive packet assembly means, 3 is a dummy data insertion means, 4 is a traffic congestion state count storage means, 5 is a routing processing unit, 6 is a city 11i wholesale table, and 7 is data. Buffers, 10 to 12 are packet processing units, 20 is a reception control unit, 21 is a packet length measurement unit, 22 is a packet disassembly unit, 23 is a register, 24 is a data length counting unit, 25 is a packet assembly unit, 26 is a transmission control unit 27 is a switching control section; 28 is a dummy data sending section;

Claims (1)

[Claims] A packet communication system in which a plurality of distributed nodes each having an arbitrary number of input ports and output ports are connected by links, and each node performs routing and communicates with a partner node using a packet communication method. In the transmitting side of each node, there is a state expression means (1) that expresses the traffic congestion state numerically, and an adaptive packet assembly means (1) that increases or decreases the length of the packet to be transmitted and packetizes it according to the numerical value. 2) and a dummy data insertion means (3) that inserts dummy data into a packet with a packet length that corresponds to the traffic congestion state when there is no data to be sent. An inter-node traffic congestion status notification system, characterized in that it is provided with traffic congestion status count storage means (4) for knowing and storing the traffic congestion status of adjacent nodes directly connected to a link.