JP3279027B2 - Data transfer method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data transfer method for delivering data to be transferred from a calling side to a called side in a communication network such as a packet communication for transferring data in a frame. .

[0002]

2. Description of the Related Art Conventionally, in a packet type communication network, a plurality of routes are set between two stations for transmitting and receiving data, a plurality of copies of transmission data are contained in an information frame, and a plurality of information including the same data are transmitted. As a data transfer procedure for simultaneously transmitting one frame at a time to a plurality of paths, and implementing a data transfer method for discarding and controlling the order of duplicated information frames on the data receiving side, for example, the method described in ITU-T Recommendation X. As shown in the 75 multi-link procedure, in a plurality of paths connecting two stations, data transfer is performed using a single link procedure (hereinafter, referred to as an SLP) for each path, and a multi-link procedure positioned above the SLP is performed. (Hereinafter referred to as MLP), the transfer frame
There is a procedure for assigning to LP and controlling the order.
FIG. 14 shows the configuration. In this figure, 23a-2
3f is an SLP module, and 24a to 24b are MLP modules.

Next, the operation will be described. First, SLP
However, this transmits and receives data between the facing SLPs according to the HDLC procedure. The transmitting MLP assigns a sequence number to the frame to be transferred, and passes the sequence number to an operable SLP. The transmission confirmation of the frame in the transmitting side MLP is performed by the transfer completion report from the transmitting side SLP.
The receiving-side MLP controls the order of received frames and discards duplicate frames.

[0004]

The conventional data transfer procedure is configured as described above. In order for the receiving side to correctly recognize the sequence number, the copy frame transmitted to each path must have the same contents. If the transfer of the frame between the frames was successful and the acknowledgment was not received, the transmitting side could not transmit a frame larger than the window size. Therefore, even if one of the used routes has a route with a large delay, the frame transfer efficiency on the route is deteriorated, and even if the frame transfer on another route with a small delay is completed, the transmission is not performed. Because the side window does not open,
There is a problem that the transfer efficiency becomes the same as when one of the routes having the largest delay is used.

The present invention has been conceived in order to solve the above problems, and an object of the present invention is to provide a data transfer method which does not lower the frame transfer efficiency by equalizing the line delay. .

[0006]

According to a first aspect of the present invention, there is provided a data transfer method for accommodating terminals for data communication.
Directly or via a relay station between the calling station and the receiving station
A fixed number of connected fixed routes are set in advance, and the calling station
Multiple copies of data from the terminal on the bureau side and multiple information
Create a frame and transfer the created information frame for each fixed path
To the receiving station at the same time,
Controlling the order of information frames and discarding duplicate information frames
A data transfer method for performing, at the originating station, a plurality of
Identify priority / non-priority processing for each of the information frames
A P region for the fixed path is provided in the P region.
Outgoing calls are made directly to the route where the calling and called stations are connected.
When the receiving station is
Relay station between the calling station and the called station on the fixed route.
When transmitting to the connected route, the relay station and the receiving station
Display an instruction to perform priority processing in
You.

[0007] data transfer method according to the second invention, Day
Calling and receiving stations that accommodate terminals for data communication
Connected directly between two stations or via a relay station
A fixed route is set in advance, and the originating station
Multiple data frames to create multiple information frames
And simultaneously create one information frame for each fixed route.
To the destination station, and the receiving station
Data for discarding information frames duplicated with sequence control
In the transfer method, the originating station transmits multiple information frames.
An area for identifying priority / non-priority processing for each
(Hereinafter abbreviated as “P region”), and then, in this P region,
Of multiple routes based on network traffic
The relay station and the destination
A display indicating that priority processing is to be performed at the
For routes other than, the relay station and destination station
That is, a display for instructing the execution of the preprocessing is performed.

[0008] data transfer method according to the third invention, Day
Calling and receiving stations that accommodate terminals for data communication
Connected directly between two stations or via a relay station
A fixed route is set in advance, and the originating station
Multiple data frames to create multiple information frames
And simultaneously create one information frame for each fixed route.
To the destination station, and the receiving station
Data for discarding information frames duplicated with sequence control
In the transfer method, the originating station transmits multiple information frames.
In each case, the initial value is set each time the processing of the relay station is performed.
With an area to be updated (hereinafter abbreviated as HOP area)
, The initial value is set in this HOP area, and then the relay station
Initially, the value of the HOP area of the received information frame is initialized.
The value received from the relay station and the called station
The value of the HOP area of the frame is set by the called station and each relay station.
When the priority processing that you have is performed, the value
And determined that priority processing should be performed based on the comparison result.
Priority processing is performed on the information frame.

A data transfer method according to a fourth aspect of the present invention is a data transfer method , wherein the data transfer method includes connecting to a calling station, a relay station, and a called station.
On the connected console, the relay station and the receiving station have
When priority processing is performed, set a predetermined value, or
Is to change.

[0010] A data transfer method according to a fifth aspect of the present invention is the data transfer method , wherein each of the source station, the relay station, and the destination station includes:
Depending on which, the priority of the calling station, relay station, and receiving station
When processing is performed, a value determined in advance is set, or
To change.

[0011] The data transfer method according to the invention of the sixth, Day
Calling and receiving stations that accommodate terminals for data communication
Connected directly between two stations or via a relay station
A fixed route is set in advance, and the originating station
Multiple data frames to create multiple information frames
And one created information frame for each fixed route
Simultaneously, and the receiving station
Control frame order and discard duplicate information frames
In the data transfer method, the originating station uses multiple information frames.
Area for identifying priority / non-priority processing for each of the
Area (hereinafter abbreviated as P area) and the processing of the relay station are implemented.
Every time the initial value is updated (hereinafter abbreviated as HOP area)
Connected to the calling station, relay station, and called station.
On the console, to the originating station, relay station, and destination station
An instruction to enable either the P area or the HOP area is issued.
From the console at the originating, relay, and terminating stations
Of the P area or HOP area validated by the instruction of
That is, priority processing is performed based on this.

[0012] A data transfer method according to a seventh aspect of the present invention is the data transfer method , wherein each of the source station, the relay station, and the destination station includes:
Depending on which, the originating station, the relay station, and the receiving station, P area
Command to make either the area or the HOP area valid.
And

[0013] The data transfer method according to the invention of the eighth, Day
Calling and receiving stations that accommodate terminals for data communication
Connected directly between two stations or via a relay station
A fixed route is set in advance, and the originating station
Multiple data frames to create multiple information frames
And simultaneously create one information frame for each fixed route.
To the destination station, and the receiving station
Data for discarding information frames duplicated with sequence control
In the transfer method, the originating station transmits multiple information frames.
An area for identifying priority / non-priority processing for each
Afterwards, abbreviated as P area) or the processing of the relay station is performed.
Area for updating the initial value every time (hereinafter abbreviated as HOP area)
At the relay station or the called station.
Received, and then the received information frame is
Information frame or data transfer phase
Information frame, then the call connection phase
If the received information frame is
Non-priority processing for the data transfer phase.
If the information frame, the P of the received information frame
Information received based on the value of the area or HOP area
Priority processing is performed on a frame.

[0014] The data transfer method according to a ninth aspect of the present invention, data
Calling and receiving stations that accommodate terminals for data communication
Three or more stations connected directly or via a relay station between
The above fixed routes are set in advance, and the originating station
Multiple data from multiple devices to copy multiple information frames.
And create one information frame for each fixed route
And the receiving station transmits multiple information files
Control the frame order and discard duplicate information frames.
In a data transfer method, the originating station must
The fixed route is defined as a first fixed route and a fixed route other than the first fixed route.
It is divided into a set of routes consisting of fixed routes, and
Areas for identifying priority / non-priority processing (hereinafter
P area), or when the processing of the relay station is performed.
And the area for updating the initial value (hereinafter abbreviated as HOP area)
Provided, and then the information frame is transferred from the route group to one fixed route.
At random, and select the information frame as the first fixed route.
Sends to the selected fixed route, relay station, or incoming
The station gives priority processing based on the P area or the HOP area.
Is to implement the process.

The data transfer method according to a tenth aspect of the present invention is de
Originating and receiving stations that each accommodate data communication terminals
Three connected directly or via a relay station between two stations
The above fixed routes are set in advance, and the originating station
Copy multiple data from the terminal on the
And create the information frame for each fixed route.
Calls are sent simultaneously, and the receiving station receives multiple pieces of information
Controls frame order and discards duplicate information frames.
In the data transfer method, the originating station
The fixed route is defined as a first fixed route and a route other than the first fixed route.
Divided into a group of fixed routes ,
An area for identifying priority / non-priority processing for each
Afterwards, abbreviated as P area) or the processing of the relay station is performed.
Area for updating the initial value every time (hereinafter abbreviated as HOP area)
The provided, then one fixed through the information frame from the path group
Select the route sequentially and fix the information frame first
Calls for the route and the fixed route selected , there is a relay station
Or at the receiving station, based on the P area or HOP area
Priority processing.

[0016]

According to the data transfer method of the present invention as described above, priority processing is performed at each relay station and destination station , so that a difference in delay in the network for each fixed path can be reduced. It is expected that the copy frames of the same contents sent to the fixed path will arrive at the receiving station almost at the same time, so that the delivery confirmation is not delayed, the window on the transmitting side is updated quickly, and the frame transfer efficiency is extremely high.

In a network system using a HOP area in a copy frame, the value of the HOP area is compared with a value determined in advance when the priority processing is performed, and the value of the frame determined to perform the priority processing is determined. carries out a priority processing but, than to change the pre-agreed value remotely from one place, it is best tuned to the actual operational state of the network system and also maintainability in a large-scale network high.

Further, the priority processing in network, the selection also either be implemented by either HOP region carried out by the P region, it is possible to remotely change from one location,
Optimization can be easily performed for each network system.

Further, by performing priority processing only in the data transfer phase separately in the call connection phase and the data transfer phase, the window control functions and is used in the data transfer phase which greatly affects the actual transfer efficiency. Even if there is a route with a large delay among the routes, the time from transmission from the originating station is equalized by the priority processing by the time it finally arrives at the destination station, The frame transfer efficiency becomes extremely high.

Also, reducing the number of copy frames reduces the total number of frames in the network, so that the transfer in the network also becomes smooth,
This also eliminates a factor that hinders equalization of transfer times from a plurality of paths, and enables data transfer with extremely high frame transfer efficiency in addition to priority processing.

[0021]

DESCRIPTION OF THE PREFERRED EMBODIMENTS This data transfer method must employ a transmission line that is easily affected by disturbances such as wireless, but is applied to a system that requires very high speed, low delay, and highly reliable network quality. Therefore, a rather redundant method of storing data from a terminal in an information frame and making a plurality of copies is adopted. Hereinafter, an embodiment of the present invention will be described with reference to the drawings.

Embodiment 1 FIG. FIG. 1 shows a frame format when the present embodiment is applied. Reference numeral 1 denotes a priority / information frame copied by an originating station for indicating whether or not to execute a priority process at a relay station and a destination station. This is a P area for displaying instruction information of non-priority processing. This P
The area is a user-specific area, and is not specified in the ITU-T recommendation or the like.

FIG. 2 is a diagram of an example of a network to which the frame format of FIG. 1 is applied. In the figure, 2a to 2
d is an exchange, in this example 2a is the originating station, 2b is the terminating station, and 2c and 2d are relay stations. Reference numerals 3a to 3e denote trunk lines connecting the exchanges 2a and 2c, exchanges 2c and 2b, exchanges 2a and 2b, exchanges 2a and 2d, and exchanges 2d and 2b, respectively. is there. The data in this network is transmitted from the calling station 2a to the called station 2b.
And the fixed routes set between these two stations are 4a to 4c. The fixed path 4a is a path from the transmitting station 2a to the relay line 3a, the relay station 2c, the relay line 3b, and the receiving station 2b, and the fixed path 4b is the transmitting station 2a.
The fixed route 4c is a route from the originating station 2a to the relay line 3d, the relay station 2d, the relay line 3e, and the destination station 2b.

FIG. 3 shows the actual frame format when the frame format of FIG. 1 is applied to the example of the network of FIG. The fixed route 4a is a direct receiving station 2b.
Is not connected, the P area of the copy frame 5a transmitted to the trunk line 3a is displayed with priority. Similarly, since the fixed route 4c is not directly connected to the receiving station 2b, the P area of the copy frame 5c transmitted to the trunk line 3d is displayed with priority. On the other hand, since the fixed path 4b is directly connected to the receiving station 2b, the P area of the copy frame 5b transmitted to the trunk line 3c is not displayed with priority.

Next, the operation will be described with reference to FIG.
Three information frames are copied for the route at the transmitting station 2a. At this time, since the information frame to be copied is included in the copy frame, substantially two copies are made in this example. The priority display of the information frame 5a transmitted to the route 4a, that is, the trunk line 3a, is displayed in the P area. Similarly, the priority display of the information frame 5c transmitted to the route 4c, that is, the trunk line 3d is displayed in the P area. On the other hand, the information frame 5b transmitted to the route 4b, that is, the trunk line 3c, is displayed in the P area as non-priority. In the relay station 2c,
When the frame 5a is received from the relay line 3a, the P area is displayed preferentially. For example, even if the processing of a different frame is being executed, the processing of the different frame is immediately interrupted, the relay processing of the received frame 5a is performed, and the relay processing is performed. It is transmitted to the line 3b as an information frame 5d. In the relay station 2c, the display in the P area of the frame is transmitted without change. Similarly to the relay station 2c, the receiving station 2b receiving the frame 5d from the relay line 3b also performs the receiving process of the frame 5d received with priority. Similarly, the relay station 2
d, when the frame 5c is received from the trunk line 3d,
Since the P area is displayed with priority, the frame 5 received with priority
c, and relays the information frame 5 to the trunk line 3e.
e. In the relay station 2d, the display in the P area of the frame is transmitted without change. The receiving station 2b that receives the frame 5e from the trunk line 3e also performs the receiving process of the frame 5e that has been received with priority. On the other hand, the frame 5b reaches the receiving station 2b directly from the trunk line 3c. Therefore, in the receiving station 2b, these three routes 4a-4
c, the time difference between the information frames passing through, in particular, 4a, 4c
The time difference between the relay stations 2b and 4b is smaller than when the priority processing in the P region is not performed in the relay stations 2c and 2d.

Embodiment 2 FIG. FIG. 4 shows the actual frame format when the frame format of FIG. 1 is applied to the network example of FIG. In application, Example 1
In the above, the display of the P area in the originating station was divided depending on whether or not to originate a route directly connecting the originating station and the terminating station. Here, the delay time for a plurality of routes is determined based on network traffic. As a result of calculating in advance, the relay station and the destination station display an instruction to execute the priority processing for a route having a long delay time, and for the other routes, the relay station and the destination station do not give priority. A display for instructing execution of the processing is performed. The delay time obtained by the network traffic is not always small for the route directly connected to the destination station. In FIG. 4, the route 4a and 4c are the transfer time, which is completely opposite to that of the first embodiment. Is small, and the path 4b shows a state where the transfer time is long. That is, since the transfer time of the fixed path 4a is short, the P area of the copy frame 5a transmitted to the relay line 3a is displayed in a non-priority manner. Similarly, fixed route 4c
Also, since the transfer time is short, the P area of the copy frame 5c transmitted to the trunk line 3d is displayed in a non-priority manner.
On the other hand, since the transfer time of the fixed path 4b is longer than that of the other, the P area is displayed with priority.

Next, the operation will be described with reference to FIG.
Three information frames are copied for the route at the transmitting station 2a. At this time, since the information frame to be copied is included in the copy frame, substantially two copies are made in this example. In the information frame 5a transmitted to the route 4a, that is, the trunk line 3a, a non-priority display is displayed in the P area.
Similarly, for the information frame 5c transmitted to the route 4c, that is, the trunk line 3d, the non-priority display is displayed in the P area. On the other hand, the priority of the information frame 5b transmitted to the route 4b, that is, the trunk line 3c, is displayed in the P area. In the relay station 2c, when the frame 5a is received from the relay line 3a, since the P area is not displayed with priority, the relay station 2c performs the relay process of the received frame 5a in the same manner as the normal frame, and
As an information frame 5d. In the relay station 2c,
The display in the P area of the frame is transmitted without change. The receiving station 2b that has received the frame 5d from the relay line 3b also performs the incoming call processing of the received frame 5d in the same manner as the relay station 2c. Similarly, even when the relay station 2d receives the frame 5c from the relay line 3d, the P area is displayed in a non-priority manner, so that the relay processing of the received frame 5c is performed in the same manner as usual, and the information is transmitted to the relay line 3e as the information frame 5e. Send out. In the relay station 2d, the display in the P area of the frame is transmitted without change. The receiving station 2b that has received the frame 5e from the trunk line 3e also performs the receiving process of the received frame 5e in the same manner as usual. On the other hand, the frame 5b arrives at the terminating station 2b from the trunk line 3c, but the priority display is displayed in the P area, so that the incoming call processing is preferentially performed. Accordingly, in the receiving station 2b, the time difference between the information frames passing through the three routes 4a to 4c, particularly, the time difference between 4a, 4c and 4b becomes smaller.

Embodiment 3 FIG. FIG. 5 shows a frame format when the present embodiment is applied, and reference numeral 6 denotes a HOP area for updating an initial value every time the processing of the relay station is performed. This HOP area is in the user-specific area, and
-Not stipulated in the T Recommendation.

FIG. 6 shows the actual frame format when the frame format of FIG. 5 is applied to the network example of FIG. The same initial value is stored in the HOP area of the copy frames 7a to 7c transmitted from the transmission station 2a.
The OP area is updated to the frame 7d, and after passing through the relay station 2d, the HOP area of the frame 7c is updated to the frame 7e.

Next, the operation will be described with reference to FIG.
Three information frames are copied for the route at the transmitting station 2a. At this time, since the information frame to be copied is included in the copy frame, substantially two copies are made in this example. An initial value is set in the HOP area of the information frame 7a transmitted to the route 4a, that is, the trunk line 3a.
Similarly, the same initial value is set in the HOP area of the information frame 7b transmitted to the route 4b, ie, the trunk line 3c, and the information frame 7c transmitted to the route 4c, ie, the trunk line 3d. When receiving the frame 7a from the relay line 3a, the relay station 2c first compares the value of the HOP area with a value indicating whether or not to execute a predetermined priority process. Next, the HOP area is updated. In this example, as a result of the comparison, if it is determined that priority processing is to be performed, frame 7
a is immediately relayed preferentially, and after updating the HOP area, is transmitted to the relay line 3b as an information frame 7d.
For example, when the initial value of the HOP area is N and the value of the HOP area is N + 1
It is assumed that the process is performed in the above case, and the process is not performed in the other cases. Under the condition that the value of the HOP area is incremented, the relay station 2c determines that the priority process is not necessary, and the relay process is preferentially performed. Not implemented, HOP
The value N of the area is incremented to N + 1 and the trunk line 3b
Sent to In the receiving station 2b that has received the information frame 7d from the relay line 3b, unlike the relay station 2c, it is determined that priority processing is necessary, and the receiving processing of the frame 7d that has been received with priority is performed. In summary, the relay station 2c does not perform the relay processing preferentially, but the receiving station 2b performs the receiving processing preferentially. Similarly, for the information frames 7c and 7e that use the fixed route 4c, the relay station 2d does not perform the relay processing preferentially, but the receiving station 2b performs the receiving processing preferentially. On the other hand, the information processing of the information frame 7b using the fixed route 4b is not preferentially performed at the receiving station 2b. Therefore, in the receiving station 2b, the time difference between the information frames passing through the three routes 4a to 4c, especially the time difference between 4a, 4c and 4b, is determined by the HOP in the relay station 2b.
It is smaller than when priority processing by region is not performed.

Embodiment 4 FIG. FIG. 7 is a diagram of a network to which the present embodiment is applied. In the figure, reference numeral 8 denotes a console having a function capable of setting a predetermined value when executing the priority processing possessed by each exchange, and reference numerals 9a to 9d denote to each exchange a value predetermined when performing the priority processing. It is a relay line for transmitting.

Next, the operation will be described with reference to FIG.
The operation of each station using the HOP area is the same as in the third embodiment, and a description thereof will be omitted. The console can change a predetermined value by executing the priority processing of each exchange at an arbitrary time. This situation will be specifically described in the same manner as in the third embodiment. For example, if the initial value of the HOP area is N and the priority processing is to be performed, the determination is performed when the value of the HOP area is N + 1 or more. Otherwise, if the value of the HOP area is applied to a network that is incremented, the console determines whether or not to perform priority processing if the value of the HOP area is N + 2 or more. If not, change it. If such a change is made, priority processing in the receiving station 2b for the information frame that has been performed up to now through the routes 4a and 4c is not performed, and the time difference from the route 4b is not shortened.

Next, a case where the difference between the routes is reduced will be described with reference to FIG. 8 using a network configuration in which the number of relay stations is increased. 8, 10a to 10i are exchange stations, 10a is a transmitting station, 10b is a receiving station, and 10c to 10c.
i is a relay station. Reference numerals 11a to 11j denote relay lines connecting the exchanges. Reference numerals 12a to 12c denote fixed routes set between the transmitting station 10a and the receiving station 10b. 13a-
13j is an information frame. 14 is a console. 15a to 15c are relay lines connecting the console and the exchange. Although the consoles are connected to all exchanges in FIG. 7, the same effect can be expected by connecting to a specific exchange as shown in FIG. Currently, this network includes, for example, HO
If the initial value of the P area is N and the priority processing is to be performed, the determination is made if the value of the HOP area is equal to or more than N + 2, and otherwise the processing is not performed, and the value of the HOP area is incremented. As a result, the information frame passing through the path 12a is transmitted between the relay station 10e and the receiving station 1
0b, the information frame passing through the path 12c is subjected to priority processing in the relay station 10i and the receiving station 10b, and the information frame passing through the path 12b is not subjected to priority processing. On the other hand, if the determination as to whether or not to perform the priority processing is performed when the value of the HOP area is equal to or greater than N + 1, and otherwise the processing is not performed, the information frame passing through the path 12a is processed by the relay station 10d. Is started. Similarly, priority processing of the information frame passing through the path 12c is started at the relay station 10h. As a result, in the receiving station 10b, the time required for the route 12a and the route 12c is reduced as compared with before the change, and finally, the time difference between the information frames passing through the three routes 12a to 12c, particularly the time difference between the information frames 12a and 12c, The time difference from the receiving station 12b is smaller than that before the change.

Embodiment 5 FIG. The console has a fourth embodiment.
A function that can change a predetermined value when the priority processing possessed by each exchange is implemented is provided in any exchange in the network, and can be changed using a trunk line. The operation after the change is exactly the same as in the fourth embodiment.

Embodiment 6 FIG. FIG. 9 shows a frame format when the present embodiment is applied. Reference numeral 1 denotes a priority / information frame copied by the transmitting station for indicating whether or not to perform the priority processing at the relay station and the receiving station. A P area for displaying instruction information of non-priority processing, and a HOP area 6 for updating an initial value every time the processing of the relay station is performed. The P area and the HOP area are in the user-specific area, and are not specified in the ITU-T recommendation or the like.

The operation of applying this frame format in FIG. 7 will be described. P area of information frame, HO
The timing of determining which area in the P area to use unifiedly in the network may be, for example, when a network is constructed. When instructing each exchange to use the P area from the console, each exchange validates the P area of the frame format, and the priority processing based on the P area is performed. The actual frame format and the operation of each exchange at this time are exactly the same as in FIG. On the other hand, when each exchange is instructed to use the HOP area from the console, each exchange validates the HOP area of the frame format, and
Priority processing based on the OP area is performed. The actual frame format and the operation of each exchange at this time are exactly the same as in FIG.

Embodiment 7 FIG. In the sixth embodiment, the console has
A function is provided at any of the exchanges in the network for instructing each exchange whether to perform the priority processing in the network using the P area or the priority processing in the network using the HOP area. The operation after the change in the network is exactly the same as that of the sixth embodiment.

Embodiment 8 FIG. FIG. 10 shows a frame format when the present embodiment is applied. In the case where priority processing is performed using the P area, reference numeral 16 denotes an information frame in the call connection phase or an information frame in the data transfer phase. Is an information frame identifier. This information frame identifier is in a user-specific area, and is not specified in the ITU-T recommendation or the like. To realize data communication, there are a call connection phase for connecting a logical communication path with a communication partner and a data transfer phase for exchanging actual data thereafter. The priority processing in the relay station and the receiving station is performed only in the case of the information frame in the data transfer phase, looking at the information frame identifier 16. The priority processing operation to be performed is exactly the same as in the first embodiment. In the case where the priority processing is performed using the HOP area, the priority processing in the relay station and the receiving station is performed only in the case of the information frame in the data transfer phase by looking at the information frame identifier 16. The priority processing operation to be performed is exactly the same as in the first embodiment.

Embodiment 9 FIG. In describing Example 9,
The effect of reducing the network load by reducing the number of copy frames will be described with reference to FIG. FIG. 11 is a simulation result in which the horizontal axis represents the frame discard rate and the vertical axis represents the load coefficient. The frame discard rate is, for example, 0.1 means that one out of every 10 frames is discarded, and 0 means no discard. In addition, the load coefficient is used to send one frame from the transmitting station to the receiving station.
The total number of frames required in the network, for example, 1 means that the total number of frames required in the network is always one in order to deliver one frame from the source station to the destination station. In the figure, reference numeral 17 denotes a polygonal line that transmits a copy frame to three routes. When the discard rate is 0, the total number of frames required in the network to deliver one frame from the source station to the destination station is three copies. I'm starting from 3. Similarly, 18 is 2
Line that transmitted a copy frame to one route,
Reference numeral 9 denotes a polygonal line that transmits a copy frame to one path. Here, in particular, the polygonal line 17 and the polygonal line 18 are compared. The two broken lines tend to approach each other when the frame discard rate increases, but it has been found that even if the discard rate is further increased, they do not intersect. Therefore, it is better that the number of copy frames is small, and the load of the network in the actual discard rate of 0.1 to 0.25 can be dealt with by about 70% load by two copies rather than three copies. This effect is one factor that makes it possible to smoothly perform frame transfer in the network.

Next, the operation will be described with reference to FIG. The numbers in the figure are exactly the same as those in FIG. In this example, it is assumed that the P area is used, and that three paths 4a to 4c are used, and one path that always transmits an information frame every time.
(First fixed route) 4b, other routes 4a, 4c
And The information frame 20 that has entered the originating station 2a from the terminal
Is copied to two of 20a and 20b, and the transmitting station 2a transmits an information frame 20b to the path 4b. On the other hand, since it is random which of the other routes 4a and 4c is to be selected, the information frame 20a is transmitted assuming that the route 4a is selected in this figure. Subsequently, the information frame 21 entering the transmitting station 2a from the terminal is copied to two of the information frames 21a and 21b.
Is sent. On the other hand, since it is random to select any of the other routes 4a and 4c, the information frame 21a is transmitted assuming that the route 4a is selected again. Finally, the information frame 22 entered from the terminal into the transmitting station 2a is 2
2b and 22c, and the originating station 2a
The information frame 22b is sent to b. On the other hand, since it is random to select any of the other routes 4a and 4c, the information frame 22c is transmitted assuming that the route 4c is selected. When there is more data from the device,
The above operation is repeated. As described above, while the originating station distributes the copy frame in the network and further performs the priority processing by the P area, the receiving station 2b
, The time difference between the copy frames arriving at the destination can be reduced.

Embodiment 10 FIG. The operation will be described with reference to FIG. The numbers in the figure are exactly the same as those in FIG. In this example, it is assumed that the P area is used, and that three paths 4a to 4c are used, and one path (first fixed path) that always transmits an information frame every time.
The route) is 4b, and the other routes are 4a and 4c. The information frames 20 entering the transmitting station 2a from the terminal are 20a and 2
0b, and the transmitting station 2a sends out the information frame 20b to the path 4b. On the other hand, other route 4
Since it is sequential which of a and 4c is to be selected, in this figure, the information frame 20a is transmitted on the assumption that the path 4a has been selected. Subsequently, the information frame 21 entering the transmitting station 2a from the terminal is copied to two of 21b and 21c, and the transmitting station 2a transmits the information frame 21b to the route 4b. On the other hand, since it is sequential which of the other routes 4a and 4c is to be selected, since the route 4a is selected first, the route 4c is selected and the information frame 21 is selected.
Send c. Finally, the information frame 22 that has entered the transmitting station 2a from the terminal is copied to two, 22a and 22b, and the transmitting station 2a transmits the information frame 22b to the route 4b. On the other hand, since it is sequential whether to select the other route 4a or 4c, since the route 4c is selected, the route 4a is selected and the information frame 22a is transmitted. When there is more data from the device,
The above operation is repeated. As described above, while the originating station distributes the copy frame in the network and further performs the priority processing by the P area, the receiving station 2b
, The time difference between the copy frames arriving at the destination can be reduced. The same operation is performed when the HOP area is used.

[0042]

As described above, according to the first aspect of the present invention,
In the originating station, it provided the P region in the information frame, then implement priority / non-priority display based on the physical connection information, conducted a priority processing at the relay station and the destination station, for each path Since the difference in delay time in the network can be reduced, copy frames of the same contents transmitted to each route are expected to reach the receiving station almost at the same time, so that delivery confirmation is not delayed and the window on the transmission side is also reduced. It is updated quickly, and the frame transfer efficiency can be increased.

According to the second aspect of the present invention, at the transmitting station,
Provided P region in the information frame, then implement priority / non-priority display based on the results of calculating the delay time of the path based on the network traffic in advance, performing the priority processing at the relay station and the receiving station Since the difference in the delay time in the network for each path is based on the network traffic, the difference can be reduced more than the invention of claim 1, so that the copy frames of the same contents transmitted to each path can be transmitted to the receiving station almost simultaneously. It is expected to arrive, the delivery confirmation is not delayed, the window on the transmitting side is updated quickly, and the frame transfer efficiency can be extremely increased.

[0044] According to the invention of claim 3, provided HOP area in the information frame, with updates the value of HOP region at each relay station, the priority processing and the value of HOP region at each relay station or destination station The difference between the delay time in the network for each path can be reduced by comparing the value of whether to execute or not to execute the priority processing, so the copy of the same contents transmitted to each path can be reduced. The frame is expected to reach the receiving station almost at the same time, the delivery confirmation is not delayed, the window on the transmitting side is updated quickly, and the frame transfer efficiency can be increased.

[0045] According to the invention of claim 4, than the console to be connected to the network, than to change whether a value remote execution of priority processing, optimal practice the state from when the operation Tuning is possible, and maintainability in a large-scale network system can be improved.

[0046] According to the invention of claim 5, the originating station in the network, or a relay station, or to change whether the value is to prioritize the incoming station <br/> remotely <br Thus, reduction of network resources can be expected while maintaining high maintainability.

[0047] According to the invention of claim 6, from the console to be connected to the network, than to change remotely whether to use the P region and the HOP region, actually the state from when the operation Optimal tuning is possible, and maintainability in a large-scale network system can be improved.

According to the seventh aspect of the present invention, the switching center in the network has a console function according to the sixth aspect of the present invention,
That than to change whether to use the P region and the HOP region remotely while maintaining high maintainability, network resources savings can be expected.

According to the eighth aspect of the present invention, the information frame is provided with an information frame identifier, and divided into the information frame of the call connection phase and the information frame of the data transfer phase. In the data transfer phase, which greatly affects the actual transfer efficiency, the difference in the delay time in the network for each path can be reduced, so that copy frames of the same content transmitted to each path can be transmitted almost simultaneously. The transmission is expected to reach the receiving station, the delivery confirmation is not delayed, the window on the transmitting side is updated quickly, and the frame transfer efficiency can be extremely increased.

According to the ninth aspect of the present invention, a route (first fixed route) that is always transmitted and a route group that is not always transmitted are divided, and one is randomly selected from the latter route group and transmitted. As a result, the number of copy frames can be reduced, the total number of information frames in the network can be reduced, and the traffic can be dispersed. Therefore, the transfer in the network can be smoothly performed. Since the priority process using the HOP area is also performed, the difference in the delay time in the network for each route can be reduced. Therefore, it is expected that copy frames of the same content transmitted to each route will arrive at the receiving station almost simultaneously, without delay in acknowledgment of transmission, the window on the transmission side is updated quickly, and the frame transfer efficiency is extremely increased. Can be.

According to the tenth aspect of the present invention, a route (first fixed route) that is always transmitted and a route group that is not necessarily transmitted are divided, and one of the latter route groups is sequentially turned to select one. Transmission, the number of copy frames can be reduced, the total number of information frames in the network can be reduced, and traffic can be distributed systematically. In addition, priority processing using the P area and the HOP area is also performed, so that a difference in delay time in the network for each path can be reduced. Therefore,
It is expected that the copy frames of the same content transmitted to each route will reach the receiving station almost simultaneously, without delay of delivery confirmation, the window on the transmission side is updated quickly, and the frame transfer efficiency can be extremely increased. .

[Brief description of the drawings]

FIG. 1 is a diagram showing a frame format in Embodiment 1 of the present invention.

FIG. 2 is a network configuration diagram for realizing a data transfer method according to the first embodiment of the present invention.

FIG. 3 is a diagram illustrating a frame format and an intra-network transfer for realizing the data transfer method according to the first embodiment of the present invention.

FIG. 4 is a diagram showing a frame format and an intra-network transfer for realizing a data transfer method according to a second embodiment of the present invention.

FIG. 5 is a diagram showing a frame format in Embodiment 3 of the present invention.

FIG. 6 is a diagram illustrating a frame format and an intra-network transfer for realizing a data transfer method according to a third embodiment of the present invention.

FIG. 7 is a network configuration diagram for realizing a data transfer method according to a fourth embodiment of the present invention.

FIG. 8 is a diagram showing a frame format and an intra-network transfer for realizing a data transfer method according to a fourth embodiment of the present invention.

FIG. 9 is a diagram showing a frame format in Embodiment 6 of the present invention.

FIG. 10 is a diagram showing a frame format in Embodiment 8 of the present invention.

FIG. 11 is a simulation result for explaining the effect of reducing the network load by reducing the number of copy frames according to the ninth embodiment of the present invention, in which the horizontal axis represents the frame discard rate and the vertical axis represents the load coefficient.

FIG. 12 is a diagram showing a frame format and an intra-network transfer for realizing a data transfer method according to a ninth embodiment of the present invention.

FIG. 13 is a data transfer method according to a tenth embodiment of the present invention.
FIG. 3 is a diagram showing a frame format for realizing the method and intra-network transfer.

FIG. 14 is a diagram showing a data transfer method according to a conventional data transfer procedure.

[Explanation of symbols]

1 P area in frame format 2a, 2b, 2c, 2d Exchanges 3a, 3b, 3c, 3d, 3e Inter-exchange trunk 4a, 4b, 4c Fixed path 5a, 5b, 5c, 5d, 5e P area utilization information frame 6 HOP area in frame format 7a, 7b, 7c, 7d, 7e HOP area use information frame 8 Consoles 9a, 9b, 9c, 9d, relay line between console exchanges 10a, 10b, 10c, 10d, 10e, 10f, 1
0g, 10h, 10i exchanges 11a, 11b, 11c, 11d, 11e, 11f, 1
1g, 11h, 11i, 11j Inter-exchange trunk line 12a, 12b, 12c Fixed route 13a, 13b, 13c, 13d, 13e, 13f, 1
3g, 13h, 13i, 13j HOP area use information frame 14 Console 15a, 15b, 15c Relay line between console exchanges 16 Information frame identifier in frame format 17 Broken line that transmitted copy frame on three routes 18 Copy frame on two routes 20 A first information frame 20a, 20b A first information copy frame 21 A second information frame 21a, 21b, 21c A second information copy frame 22 A third information frame 22a, 22b, 22c Third information copy frame

────────────────────────────────────────────────── ─── Continuation of the front page (56) References JP-A-1-231542 (JP, A) JP-A-3-16448 (JP, A) JP-A-6-334566 (JP, A) JP-A-6-334566 303257 (JP, A) (58) Fields investigated (Int. Cl. ⁷ , DB name) H04L 29/00 H04L 12/56 G06F 13/00

Claims (10)

(57) [Claims] 1. A directly or via a relay station to a terminal for performing data communication between an originating station to accommodate each incoming station two stations
Previously setting a plurality of fixed paths connected Te, and multiple copies of data from the originating station side terminal in the originating station to create a plurality of information frames, one of the information frame that was created for each of the fixed path by then simultaneously transmitted, the order of a plurality of said information frame received at the receiving station
A data transfer method for performing disposal of the information frame that overlaps with the control at the originating station, a region (hereinafter referred to as the P region) for identifying the priority / non-priority processes to each of a plurality of said information frame provided , then this P region, when transmitting a path directly out of the fixed path the originating station and the receiving station is connected,
And a display for instructing the implementation of the non-priority processing at the receiving station, between said originating station and the receiving station of the fixed route
When sending to route the relay station is connected, a data transfer method, characterized by a display for instructing the implementation of the priority processing at the relay station and the receiving station. 2. A method according to claim 1, further comprising the step of directly or via a relay station between the transmitting station and the receiving station each accommodating a terminal performing data communication.
Previously setting a plurality of fixed paths connected Te, and multiple copies of data from the originating station side terminal in the originating station to create a plurality of information frames, one of the information frame that was created for each of the fixed path by then simultaneously transmitted, the order of a plurality of said information frame received at the receiving station
A data transfer method for performing disposal of the information frame that overlaps with the control at the originating station, a region (hereinafter referred to as the P region) for identifying the priority / non-priority processes to each of a plurality of said information frame provided , then this P region, the display delay time for a plurality route based on the network traffic of the fixed path for large path, to instruct the implementation of priority processing at the relay station and the receiving station and, for the other path, the data transfer method which comprises carrying out a display for instructing the implementation of the non-priority processing at the relay station and the receiving station. 3. Each terminal for data communication is accommodated.
DoOriginating and receiving stationsBetween two stationsDirectly or through a relay station
ConnectedSet multiple fixed routes in advance,In the above transmitting station Multiple copies of data from the terminal at the originating station
ーpluralCreate an information frame and create the above information
Framethe aboveSend one at a time for each fixed route,the above At the receiving stationOrder of multiple received information frames
Control andDuplicatethe aboveData for discarding information frames
transferMethodAtAt the originating station, Information frameEach of
Tothe aboveThe initial value is updated each time the relay station performs processing
Area (hereinafter abbreviated as HOP area)Along with
thisSet initial value in HOP areaI,next, In the above relay station,Recievedthe aboveInformation frame
ofthe aboveUpdate the value of HOP area from initial valueI,the above With relay stationsthe aboveAt the receiving station,Recievedthe aboveInformation
Laem'sthe aboveThe value of the HOP area isWith the above called stationeachVariousUp
RecordrelayDecide beforehand to implement the priority processing of the station
Compared to the valueBased on the comparison resultPerform priority processing
Performs priority processing on information frames determined to beThis
Characterized bydata transferMethod. 4. The transmitting station, the relay station, and the incoming call.
On the console connected to the station, the above relay station and the incoming call
4. The data transfer method according to claim 3 , wherein a predetermined value is set or changed when the priority processing of the station is performed. 5. The transmitting station, the relay station, and the incoming call.
At any of the stations, the originating station, the relay station, the incoming call
4. The method according to claim 3 , wherein a value determined in advance to execute the priority processing possessed by the station is set or changed.
Data transfer method described. 6. A method according to claim 1, further comprising the step of directly or via a relay station between the transmitting station and the receiving station accommodating terminals for data communication.
A plurality of fixed paths connected in advance are set in advance, the transmitting station copies a plurality of data from the terminal on the transmitting station side to create a plurality of information frames, and the created information frame is provided for each of the plurality of fixed paths. and transmitting one by one at the same time, the order of a plurality of said information frame received at the receiving station
A data transfer method for performing disposal of the information frame that overlaps with the control at the originating station, to each of a plurality of said information frame
Area for identifying priority / non-priority processing (hereinafter referred to as P area
Abbreviated) , and each time the above relay station process is performed,
An area for updating a value (hereinafter abbreviated as a HOP area) is provided , and is connected to the transmitting station, the relay station, and the receiving station.
At the console, the originating station, the relay station, and the destination
Either the P area or the HOP area for the transmitting station
Is issued by the transmitting station, the relay station, and the receiving station.
The above P area or the area that was validated by the instruction from the console
Must perform priority processing based on any of the above HOP areas
A data transfer method characterized by the following . 7. The transmitting station, the relay station, and the incoming call.
At any of the stations, the originating station, the relay station, and the
Either the P area or the HOP area for the called station
7. The data transfer method according to claim 6 , wherein an instruction to make the data valid is issued . 8. A method for directly or via a relay station between a transmitting station and a receiving station each accommodating a terminal performing data communication.
Previously setting a plurality of fixed paths connected Te, and multiple copies of data from the originating station side terminal in the originating station to create a plurality of information frames, one of the information frame that was created for each of the fixed path by then simultaneously transmitted, the order of a plurality of said information frame received at the receiving station
A data transfer method for performing disposal of the information frame that overlaps with the control at the originating station, to each of a plurality of said information frame
Area for identifying priority / non-priority processing (hereinafter referred to as P area
Abbreviated) or every time the above relay station process is performed
An area for updating the initial value (hereinafter abbreviated as HOP area) is set.
At the relay station or the called station.
Received, and then the received information frame is transmitted to the call connection phase.
Information frame or information in data transfer phase
Judgment as to whether the frame is an information frame in the call connection phase
Performs non-priority processing on the received information frame.
The information frame in the data transfer phase.
The P area of the received information frame,
Or, based on the value of the HOP area, the received information frame
A data transfer method, wherein priority processing is performed on a game . 9. Directly or via a relay station between two stations, a transmitting station and a receiving station, each accommodating a terminal performing data communication.
Preset the connected three or more of the plurality of fixed paths Te, and with multiple copies of data from the originating station side terminal in the originating station to create a plurality of information frames, the said information frames created fixed and transmitting one by one simultaneously in each path, the order of a plurality of said information frame received at the receiving station
A data transfer method for performing disposal of the information frame that overlaps with the control at the originating station, the previously said plurality of fixed paths, the first fixed
A route including a route and a fixed route other than the first fixed route
Divided into groups, the priority / non-priority processes to each of a plurality of said information frame
(Hereinafter abbreviated as P area), or
Update the initial value each time the above relay station process is performed
An area (hereinafter abbreviated as HOP area) is provided, and then the information frame is transferred from the path group to one fixed path.
Path is randomly selected and the information frame is stored in the first fixed
A call is transmitted to a fixed route selected as a fixed route, and priority processing is performed at the relay station or the receiving station based on the P area or the HOP area .
And a data transfer method . 10. A terminal for data communication.
Directly or via a relay station between the transmitting and receiving stations
Preset three or more fixed routes connected
And, a plurality copies the data from the originating station side terminal in the originating station
To create multiple information frames and create the above information
A frame is simultaneously transmitted one by one for each of the fixed paths, and the receiving station transmits the plurality of information frames in order.
Data for discarding the above information frame overlapping control
In the transfer method, the plurality of fixed routes are previously stored in the transmitting station by a first fixed route.
A route including a route and a fixed route other than the first fixed route
Divided into groups, giving priority to each of the information frames /
The area for identifying the non-priority processing (hereinafter abbreviated as P area) or the processing of the above relay station is performed.
An area in which the initial value is updated each time the operation is performed (hereinafter, a HOP area)
), And the information frame is transferred from the path group to one fixed path.
Path is selected sequentially, and the information frame is
A call is transmitted to the fixed route selected as the first fixed route, and the P area and the
Alternatively, priority processing should be performed based on the HOP area.
And a data transfer method .