JPH08186597A - Transfer delay time preferential transfer method in store and forward switching network - Google Patents

Abstract

PURPOSE: To provide a data transfer method hard to depend on traffic fluctuation in a network by transferring the same data to plural routes between outgoing and incoming exchanges and transferring the data arriving at the incoming exchange first to a subscriber. CONSTITUTION: The outgoing exchange 20, when receiving the data from the subscriber 10, sends out the data of same content on which the same sequence number for identification is attached to the routes 40 to 41 to 42, 40 to 46 to 42, and 40 to 44 to 45 simultaneously. The incoming exchange 23 uses the data arriving first based on the the sequence number out of plural pieces of arriving data as an effective one, and sends it out to the subscriber 11. In this way, transfer data of minimum delay time is delivered to the subscriber, and delay time preferential transfer hard to depend on the traffic fluctuation in the network is performed in a store and forward exchange network including plural exchanges 20 to 25 in which delay is changing sequentially by the state of the network.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for minimizing transfer delay time in a store and forward switching network including a plurality of exchanges.

[0002]

2. Description of the Related Art In a conventional store-and-forward network, only one route is established between the originating and terminating terminals, and the delay time varies depending on the traffic state of this route.

[0003]

However, the routing in the storage and switching network as described above has a problem that it cannot be applied to voice communication or the like which attaches importance to real-time property, because the delay time changes sequentially depending on the state in the network. An object of the present invention is to solve the above problems and to provide a data transfer method that is less likely to depend on traffic fluctuations in the network.

[0004]

SUMMARY OF THE INVENTION In order to solve the above problems, the present invention sends data of the same contents with the same sequence number for identification to a plurality of routes at the same time, and the destination exchange uses the sequence number as a basis. Use the data that arrives at the earliest as valid.

[0005]

According to the present invention, of the data transferred through a plurality of routes, the data that arrives at the destination exchange earliest is transferred to the subscriber, thereby making it possible to transfer data that is less dependent on traffic fluctuations in the network. Becomes

[0006]

DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 is an explanatory diagram showing a switching network in which a plurality of routes exist between originating and terminating exchanges. In the figure, 10 to 13
Is a terminal, 20 to 25 are exchanges, 30 to 33 are subscriber lines connecting subscribers to the exchange, and 40 to 46 are relay lines connecting the exchanges.

10 calling subscriber terminals and 11 receiving subscriber terminals
There are three routes connecting both subscribers, and when the route is indicated by the trunk line number, 40-41-42, 40-46-42,
40-44-45. When receiving the data from the subscriber 10, the originating exchange 20 creates three same data and sends them to the above three routes respectively. The destination exchange 23 sends to the subscriber 11 only the data which arrives first among the data having the same sequence number among the many arrival data. As a result, the transfer data with the shortest delay time can be passed to the subscriber.

Since the relay line has a different usage rate depending on the amount of communication at that time, the transfer time differs for each route. For example, the trunk line 44 includes the communication between the subscribers 10 and 11 and the subscriber 12
It is also used for communication with lines 13 and 13, and its line utilization rate is different from line 41 or line 46. Therefore, the transfer times of the three routes from the exchanges 20 to 23 are also different. Therefore, by sending data having the same sequence number to a plurality of routes and having the same content and selecting the data that arrives at the destination exchange earliest for each sequence, the shortest delay communication is always possible.

[0009]

As described above, the same data is transferred to a plurality of routes between the originating and terminating exchanges, and the data arriving at the destination exchange is transferred to the subscriber earliest. According to the method of the present invention, time-priority transfer becomes possible, and excellent effects that cannot be obtained by the conventional method are obtained.

[Brief description of drawings]

FIG. 1 is an explanatory diagram showing a switching network in which a plurality of routes exist between originating and terminating exchanges.

[Explanation of symbols]

 10-13 Terminals 20-25 Exchanges 30-33 Subscriber lines connecting subscribers and exchanges 40-46 Relay lines connecting exchanges

Claims (1)

[Claims] 1. A transfer delay time priority transfer method in a store-and-forward network in which there is a route connecting a plurality of physically independent source and destination exchanges for transferring data from a source exchange to a destination exchange including a plurality of exchanges. When the exchange transfers data to the destination switch, it sends the same data with the same sequence number for identification to multiple routes at the same time, and the destination switch validates the earliest data based on the sequence number. A transfer delay time priority transfer method in a store-and-forward network, which is used as