JP4924285B2 - Communication apparatus, communication system, transfer efficiency improvement method, and transfer efficiency improvement program - Google Patents

Description

  The present invention relates to a communication technique for spreading data by distributing data in a plurality of paths, and a communication apparatus and communication for guaranteeing arrival order in a multipath environment in which a transmitter and a receiver are connected by a plurality of networks. The present invention relates to a system, a transfer efficiency improvement method, and a transfer efficiency improvement program.

  Conventionally, there is a communication method in which data of one communication flow used in communication between a transmission terminal and a reception terminal is branched into a plurality of flows, and then the original flow is restored. As such a communication method, for example, there is a method in which a gateway is installed in each of a first LAN (Local Area Network) to which a transmitting terminal belongs and a second LAN to which a receiving terminal belongs. Specifically, TCP (Transmission Control Protocol) connection data transmitted from the transmission terminal is distributed to each communication path in units of packets in the gateway of the first LAN. In the second LAN gateway, a method has been proposed in which data is restored by correcting the order inversion of packets received from a plurality of communication paths in accordance with the TCP sequence number (see, for example, Patent Document 1).

Conventionally, as a method for efficiently using a plurality of communication lines and improving the line utilization rate, by adding a function to the TCP of the terminal, a conventional communication using a single TCP connection can be changed to a plurality of TCP connections. There is a method of changing to use (see, for example, Patent Document 2). In this method, communication performed in one communication flow in communication between the transmission terminal and the reception terminal is divided into a plurality of communication flows and sent in parallel. When data is transmitted from the transmission terminal to the reception terminal, the communication protocol of the transmission terminal divides the data of one communication flow and distributes the data to a plurality of communication flows. At that time, a new header is added to the TCP / IP packet as restoration information for restoring the plurality of divided communication flows into one original communication flow (that is, using two system sequence numbers) Send data in communication flow. The communication protocol of the receiving terminal refers to the restoration information of data received from a plurality of communication flows, and restores one communication flow.
JP 2000-261478 A JP 2003-110604 A

  In the technique described in Patent Document 1 and the technique described in Patent Document 2 described above, the packet that arrives through the fast path is received by the order guarantee buffer on the receiver side until the packet that passes through the slow path arrives. A head-of-line blocking problem occurs that is awaited. When the head-of-line blocking problem occurs, the transfer efficiency is greatly reduced, and a large amount of order guarantee buffers are required.

  Furthermore, the technique described in Patent Document 1 and the technique described in Patent Document 2 both provide “speed” to the receiving device when there is a path having a different speed from other paths in the paths used for transfer. An order guarantee buffer corresponding to “difference × delay time difference” is required. It is not practical to install this “speed difference × delay time difference order guarantee buffer” for each path because the memory capacity becomes enormous. For this reason, packet loss due to buffer overflow occurs frequently, and transfer efficiency (performance) is greatly reduced.

  Therefore, the present invention provides a communication device and communication for improving transfer efficiency with a small number of order guarantee buffers when performing arrival order guarantee in a multipath environment in which a transmitter and a receiver are connected by a plurality of networks. It is an object to provide a system, a transfer efficiency improvement method, and a transfer efficiency improvement program.

According to the present invention, as a first apparatus, in a communication apparatus connected to a receiver through a plurality of networks, an RTT calculation means for calculating an RTT for each network based on an ACK transmitted from the receiver Then, the deviation of RTT of each network is obtained from the calculation result of the RTT calculation means, and the variation detection in which the RTT is larger than the other networks or the RTT is smaller than the other networks is judged as a failure link. There is provided a communication apparatus comprising: means; and transmission distribution means for distributing transmission data by round robin to a network other than the network determined to be a failed link by the variation detection means.
Further, as a second device, in a communication device connected to the receiver through a plurality of networks, RTT calculation means for calculating RTT and minimum RTT for each network based on ACK transmitted from the receiver; A queuing delay for each network is calculated based on the difference between the latest measured RTT of each network notified from the RTT calculating means and the minimum RTT for each network, and each network is calculated based on the queuing delay. A plurality of rate calculation means installed in each network for determining the transmission rate, and the deviation of the transmission rate of each network is obtained, and the transmission rate is higher than that of other networks or the transmission rate is compared with other networks. Variation detecting means for determining a small network as a failed link, and the variation detecting means provides a communication apparatus characterized in that the transmission rate of the network determined as the failed link is set to zero. It is.
A first method is a method for improving transfer efficiency in a communication apparatus connected to a receiver through a plurality of networks, and calculates an RTT for each network based on an ACK transmitted from the receiver. The RTT deviation of each network is obtained from the calculation step and the calculation result of the RTT calculation step, and the RTT is compared to other networks and the RTT is compared to other networks, and the small network is determined as a faulty link. There is provided a method for improving transfer efficiency, comprising: a variation detection step; and a transmission distribution step of distributing transmission data by round robin to a network other than the network determined as a failed link in the variation detection step.
A second method is a method for improving transfer efficiency in a communication apparatus connected to a receiver through a plurality of networks, and calculates RTT and minimum RTT for each network based on ACK transmitted from the receiver. Calculating the queuing delay for each network based on the difference between the RTT calculating step, the latest measured RTT of each network calculated by the RTT calculating step, and the minimum RTT for each network, and based on the queuing delay A rate calculation step for determining the transmission rate of each network for each network, and obtaining a deviation of the transmission rate of each network, so that the transmission rate is higher than that of other networks A variation detecting step of determining a small network as a failed link compared to other networks, wherein the variation detecting means determines a transmission rate of the network determined as the failed link. Transfer efficiency method characterized by the is provided.
In addition, as a first program, a transfer efficiency improvement program in a communication apparatus connected to a receiver through a plurality of networks, which calculates an RTT for each network based on an ACK transmitted from the receiver. The RTT deviation of each network is obtained from the calculation function and the calculation result of the RTT calculation function, and the RTT is larger than the other networks, or the RTT is compared to the other networks, and the smaller network is determined as the failure link. Provided is a transfer efficiency improvement program that causes a computer to implement a variation detection function and a transmission distribution function that distributes transmission data by round robin to a network other than a network determined as a failed link in the variation detection function. Is done.
Also, as a second program, a transfer efficiency improvement program in a communication apparatus connected to a receiver through a plurality of networks, and calculates RTT and minimum RTT for each network based on ACK transmitted from the receiver. And calculating a queuing delay for each network based on a difference between the RTT calculation function and the latest measured RTT of each network notified from the RTT calculation function and the minimum RTT for each network. The transmission rate of each network is determined based on a plurality of rate calculation functions installed for each network, the deviation of the transmission rate of each network is obtained, and the transmission rate is higher than that of other networks or the transmission rate. And a variation detection function for determining a small network as a failure link compared to other networks, and the variation detection function is determined to be the failure link. Transfer efficiency program, characterized by the transmission rate to zero are provided.

  According to the present invention, in a multipath environment in which a transmitter and a receiver are connected by a plurality of networks, a link in which an ACK never arrives is determined as a failed link and excluded from a distribution destination at the time of transmission. When the arrival order is guaranteed, the transfer efficiency can be improved with a small number of order guarantee buffers.

  Next, embodiments of the present invention will be described with reference to the drawings.

  In the following description, communication between a pair of transmitter and receiver is defined as one flow. Also, a route through which a certain flow flows is defined as a path. For example, when communicating by distributing one flow to four networks (networks), it is said that communication is performed using four paths. When communicating by distributing two flows to four networks (networks), there are eight Communicate using a path. However, in the following description, since description will be made focusing on one flow, as a result, the network and the path are synonymous.

(First embodiment)
(Description of configuration)
With reference to FIG. 1, the structure in this Embodiment is demonstrated. In the first embodiment, a transmitter 1 and a receiver 2 are provided.

  The transmitter 1 includes a data transmission unit 11, a SEQ addition unit 12, a transmission buffer 13, a transmission distribution unit 14, PHYs 151 to 154, non-arrival counters 161 to 164, and a retransmission timer 19.

  The data transmitter 11 generates data to be transmitted to the receiver 2 and passes it to the SEQ adder 12. In addition, a server application etc. can be illustrated as a part which generally corresponds to a data transmission part.

  The SEQ adding unit 12 receives data to be transmitted from the data transmitting unit 11 to the receiver 2 and divides the data into sizes that can be transferred by the networks 31 to 34. Then, a header and an order number (also referred to as a sequence number, hereinafter referred to as “SEQ”) necessary for transfer are set for each divided data (hereinafter referred to as a packet) and transferred to the transmission buffer 13.

The transmission buffer 13 is a first-in first-out (FIFO) buffer, and performs the following operations.
(1) Receive and store a packet with a SEQ from the SEQ grant unit 12.
(2) Send a copy of the packet to the transmission distribution unit 14 according to a predetermined speed and number. At this time, the retransmission timer 19 is set.
(3) A delivery confirmation (ACK) is received from the non-arrival counters 161 to 164, and a stored packet having a value equal to or smaller than the received sequence number described in the ACK is deleted. At this time, the retransmission timer 19 is reset.
(4) In (3), if the sequence number described in the ACK is the same as the sequence number described in the previously received ACK, it is regarded as a retransmission request (duplicate ACK) and is described in the ACK. The packets after the sequence number are retransmitted to the transmission distribution unit 14 according to a predetermined speed and number as in (2). In addition, the non-arrival counters 161 to 164 are notified of retransmission.
(5) When the retransmission timer 19 expires, the packets after the sequence number described in the ACK received last time are copied at a predetermined rate and number in the same manner as in (2), and a copy of the packet is transmitted to the transmission distribution unit 14. Resubmit to. In addition, the non-arrival counters 161 to 164 are notified of retransmission.

  The transmission distribution unit 14 sequentially distributes the packets arriving from the transmission buffer 13 to the networks 31 to 34 through the PHY 151 to PHY 154 by round robin.

  The PHY 151 receives a packet from the transmission distribution unit 14, converts the packet into a format (electric signal, optical signal) that can be transmitted by the network 31, and sends the packet to the network 31. Conversely, a packet is received from the network 31 and transferred to the non-arrival counter 161.

  The PHYs 152 to 154 perform the same operation as the PHY 151 for the networks 32 to 34.

The non-arrival counter 161 performs the following operation.
(1) The counter is incremented every time a retransmission execution notification is received from the transmission buffer 13. When the counter exceeds a certain threshold (for example, 3), the transmission distribution unit 14 is instructed to stop the distribution to the network 31 (PHY 151).
(2) When an ACK packet is received from the PHY 151, the counter is reset to 0 and the ACK is transferred to the transmission buffer 13. At this time, if the transmission distribution unit 14 is instructed to stop distribution to the network 31 (PHY 151), the instruction is canceled.

  The non-arrival counters 162 to 164 perform the same operation as the non-arrival counter 161 for the networks 32 to 34.

  When receiving a set request from the retransmission buffer 13, the retransmission timer 19 notifies the retransmission buffer 13 of expiration of the timer when a preset time has elapsed.

  The receiver 2 includes PHYs 211 to 214, an extraction control unit 22, order buffers 231 to 234, an ACK transmission unit 24, an output buffer 25, a SEQ deletion unit 26, and a data reception unit 27.

  The PHY 211 receives the packet from the ACK transmission unit 24, converts the packet into a format (electric signal, optical signal) that can be transmitted by the network 31, and sends the packet to the network 31. Conversely, a packet is received from the network 31 and transferred to the order buffer 231.

  The PHYs 212 to 214 perform the same operation as the PHY 211 for the networks 32 to 34.

  Upon receiving the storage completion notification from the order buffers 231 to 234, the take-out control unit 22 executes the order confirmation unit 221. The detailed contents of the order confirmation unit 221 will be described later. Next, the take-out control unit 22 instructs the order buffers 231 to 234 to perform packet output to the output buffer 25 according to the sequence of SEQ. At this time, the ACK transmission unit 24 is notified of the SEQ of the packet transferred to the output buffer 25 and the order buffer number. Furthermore, if the packet transmission time is included in the packet header, the packet transmission time is also notified.

  The order buffer 231 is a FIFO buffer, receives a packet from the network 31, temporarily stores it, and notifies the extraction control unit 22 of storage completion. Further, the packet stored in the output buffer 25 is transferred according to the instruction from the take-out control unit 22.

  The order buffer 231 compares the sequence number of the packet arriving from the network 31 with the sequence number of the packet arriving from the network 31 last time, and the sequence number of the packet arriving this time is smaller than the sequence number of the packet arriving last time. If they are the same, it is assumed that retransmission has occurred, and all stored packets are discarded.

  Further, the order buffers 232 to 234 perform the same operation as the order buffer 231 with respect to the networks 32 to 34.

  The ACK transmission unit 24 performs the following operation. In the present application, a description will be given of a case where the 1ACK method is employed in which an ACK of one packet is transmitted every time one packet transfer to the output buffer 25 is completed. N (N is 1 or more) packet arrival reports You may use the N_ACK system performed collectively by ACK.

  Upon receiving the SEQ of the packet transferred from the take-out control unit 22 to the output buffer 25, the order buffer number (that is, the network identifier) in which the packet is stored, and the packet transmission time (if there is information), the SEQ and A delivery confirmation packet (hereinafter referred to as ACK) including the packet transmission time (if notified) is generated. And it notifies to any of the non-arrival counters 161 to 164 by using the network (any one of the networks 31 to 34) corresponding to the notified network identifier. That is, when a packet is transferred from the order buffer 232 to the output buffer 25, an ACK is notified to the non-arrival counter 162 through the network 32.

  The output buffer 25 is a FIFO buffer, and receives and stores packets from the order buffers 231 to 234. When there is a request from the SEQ deletion unit 26, the data is output to the SEQ deletion unit 26 in the order in which they are stored.

  The SEQ deletion unit 26 receives the packet from the output buffer 25, deletes the SEQ and the header, and transfers the data after the SEQ deletion to the data reception unit 27.

  The data receiving unit 27 receives data from the SEQ deleting unit 26. The data receiving unit 27 is also generally called a client application.

  The network 31 is a network such as Ethernet (registered trademark) that connects the transmitter 1 and the receiver 2. In FIG. 1, the network 31 is represented by a single line, but actually, a switch or the like may exist in addition to the link. The networks 31, 32, 33, and 34 are physically or logically blocked by a VLAN or the like, and do not cross each other.

  The networks 32 to 34 are the same networks as the network 31.

(Description of operation of order confirmation means 221)
With reference to the flowchart of FIG. 2, the order confirmation unit 221 in the take-out control unit 22 will be described.

When one packet is stored in any of the order buffers 231 to 234, a storage completion notification is sent to the takeout control unit 22, and the order confirmation unit 221 is activated. (Step 22101)
The SEQ of the packet stored at the head of the order buffer 231 (on the output buffer 25 side) is confirmed. (Step 22102)
The SEQ (head SEQ) of the head packet of the order buffer 231 confirmed in step 22102 is compared with the SEQ that the fetch control unit 22 is going to transmit to the output buffer 25 (reception expected SEQ, hereinafter referred to as expected SEQ). (Step 22103)
If the leading SEQ and the expected SEQ match at step 22103, the packet is taken out of the order buffer 231 and sent to the output buffer 25. (Step 22104)
Next, the ACK transmission unit 24 is requested to transmit an acknowledgment packet (ACK). This ACK stores the SEQ of the expected SEQ, and notifies the transmitter 1 that reception and ordering up to the expected SEQ have been completed. (Step 22105)
Increment expected SEQ. That is, expected SEQ = expected SEQ + 1. (Step 22106)
Steps 22107 to 22111 perform the same operations as steps 22102 to 22106 with respect to the order buffer 232.

  Steps 22112 to 22116 perform the same operation as steps 22102 to 22106 with respect to the order buffer 233.

  Steps 22117 to 22121 perform the same operations as steps 22102 to 22106 with respect to the order buffer 234.

During the execution of step 22102 to step 22121, the number of packets taken out from the order buffer and sent to the output buffer is counted. If the number is 1 or more, step 22102 and the subsequent steps are executed again. If the number of packets taken out from the order buffer and sent to the output buffer is 0, that is, there are no packets that can be transferred to the output buffer 23 (that is, can be ordered) in any of the order buffers 231 to 234. End the operation. (Step 22122)
(Operation example)
(Overview of operation)
Hereinafter, with reference to FIG. 1, the operation | movement outline | summary of the transmitter 1 and the receiver 2 in this Embodiment is demonstrated.

  In the transmitter 1, the data transmission unit 11 generates data to be transmitted to the data reception unit 27 and sends the data to the SEQ addition unit 12.

  The SEQ assigning unit 12 divides the data from the data transmitting unit 11 into a size that can be transferred by the networks 31 to 34 and attaches a header to generate a packet. Further, a sequence number (SEQ) is assigned to the packet for ordering so that the receiver 2 can restore the data, and the packet is transferred to the transmission buffer 13.

  The transmission buffer 13 receives the packet from the SEQ adding unit 12 and temporarily stores it. Then, a copy of the stored packet is sent to the transmission distribution unit 14 according to a preset transmission rate, window size, and the like.

  The transmission distribution unit 14 distributes and transmits the packet received from the transmission buffer 13 to each of the networks 31 to 34 through the PHYs 151 to 154 using round robin or the like. For example, a packet with a sequence of SEQ is distributed to the networks 31 to 34 such that the packet of SEQ15 is the network 31, the packet of SEQ16 is the network 32, the packet of SEQ17 is the network 33, and the packet of SEQ18 is the network 34. Hereinafter, a case where the packet of SEQ17 is distributed to the network 33 will be described as an example.

  The network 33 sends the packet sent from the transmitter 1 to the receiver 2.

  The order buffer 233 stores packets arriving from the network 33 and notifies the takeout control unit 22 of the completion of storage. Upon receiving the storage completion notification from the order buffer 233, the take-out control unit 22 activates the order confirmation unit 221.

  The order confirmation unit 221 examines the SEQ of the packet stored at the head of the order buffers 231 to 234, and if it matches the SEQ to be sent to the output buffer 25 next, extracts this packet and sends it to the output buffer 25. Request the ACK transmission unit to transmit ACK.

  Here, assuming that transfer to the output buffer 25 has been completed up to SEQ = 16 before, if a packet of SEQ = 17 is stored at any head of the order buffer 233, it is extracted and stored in the output buffer 25. Forward and request ACK transmission with SEQ = 17. At this time, the packet of SEQ = 17 is also notified that it has been transferred through the network 33 (PHY 213, order buffer 233).

  The ACK transmission unit 24 receives a request from the extraction control unit 22 to transmit ACK with SEQ = 17 to the network 33, generates an ACK packet, and transmits the ACK packet to the PHY 213.

  The non-arrival counter 163 receives the ACK packet from the PHY 153 and resets the non-arrival counter to 0. Further, the received ACK packet is transferred to the transmission buffer 13.

  The transmission buffer 13 receives an ACK packet with SEQ = 17 from the non-arrival counter 163. If the SEQ of this ACK is larger than the SEQ of the previously received ACK, the packets up to the SEQ (SEQ = 17) are deleted from the transmission buffer 13.

(Non-arrival counter operation)
As shown in the operation outline, the ACK transmission unit 24 in the receiver 2 transmits the ACK packet only to the network that has received the packet to be transmitted. That is, an ACK packet is not transmitted to a network where some abnormality has occurred and data does not flow.

  Here, the non-arrival counters 161 to 164 in the transmitter 1 increment the counter every time a notification of retransmission occurrence is received from the transmission buffer 13, and reset the counter to 0 when ACK is received. For this reason, if no ACK has been received during a certain number of retransmissions (for example, 3 times), the non-arrival counter sends the transmission distribution so that the link is excluded from the distribution target at the time of packet transmission. Notification to the unit 14.

  By the above operation, the failure link, that is, the link where the ACK does not arrive is disconnected, so that the occurrence of the Head Of Line Blocking problem can be avoided and the transfer efficiency can be improved.

(Effect of this embodiment)
Next, the effect of this embodiment will be described.

  When the invention described in this embodiment is used, in a multipath environment in which a transmitter and a receiver are connected by a plurality of networks, the transfer efficiency is improved with a small number of order guarantee buffers when guaranteeing the arrival order. be able to.

  This is because the receiver sends a corresponding ACK packet to the PHY (network) where the data packet has arrived, increments the counter every time a retransmission occurs in the transmitter, and resets the counter when the ACK arrives. This is because a plurality of non-arrival counters are provided for each network, and a link in which ACK never arrives is determined as a failed link while a certain number of retransmissions occur, and is excluded from a distribution destination at the time of transmission.

(Second Embodiment)
The outline of the second embodiment of the present invention is that a round trip time (RTT) is measured for each network, and networks that greatly deviate from the standard deviation of the RTT of each network are excluded from distribution destinations at the time of transmission. The head of line blocking problem is avoided, and high transfer efficiency is realized with a small order guarantee buffer capacity.

(Description of configuration)
Next, the configuration in the present embodiment will be described with reference to FIG.

  The transmitter 1 in the second embodiment is different from the transmitter 1 in the first embodiment in that the non-arrival counters 161 to 164 are changed to RTT calculators 161A to 164A, and a rate calculator 17 and the variation detector 18 are different.

  On the other hand, the receiver 2 is the same as the receiver 2 in the first embodiment.

  The RTT calculator 161A receives the ACK packet from the PHY 151, calculates the round-trip delay time (RTT) of the network 31 from the difference between the transmission time included in the ACK packet and the current time obtained from the built-in clock 19A. The calculation unit 17 and the variation detector 18 are notified. At this time, the maximum value (maximum RTT) and minimum value (minimum RTT) of the RTT of the network 31 are also held.

  The RTT calculators 162A to 164A perform the same operation as the RTT calculator 161A with respect to the networks 32 to 34.

  The rate calculation unit 17 receives the RTT notification from the RTT calculation units 161A to 164A, and the queuing delay of the networks 31 to 34 (from the difference between the RTT that has received this notification and the lowest RTT of the network that has received this notification) That is, congestion is calculated, the packet transmission rate (bandwidth) from the transmission buffer 13 is determined based on this, and the transmission buffer 13 is notified.

  The new rate R ′ in the rate calculation unit 17 is the minimum rate R is the current rate, α is an increase constant, β is a decrease constant, RTT is notified by the RTT calculation unit, and RTTmin is notified by the RTT calculation unit. If RTT and Tc are rate calculation intervals, they can be expressed by the following equations.

R ′ = R + (α / RTT−β × (RTT−RTTmin) × R / RTT) × Tc
The variation detector 18 receives the RTT notifications of the networks 31 to 34 from the RTT calculators 161A to 164A, and when there is a network with a variation (deviation) of a certain value or more, the transmission distribution unit 14 is instructed.

  For example, when the RTT of the network 31 is 300 ms, the RTT of the network 32 is 310 ms, the RTT of the network 33 is 560 ms, and the RTT of the network 34 is 305 ms, the packet is sent to the network 33 which is a larger network than other networks. The transmission distribution unit 14 is instructed not to distribute.

  For example, conversely, when the RTT of the network 31 is 300 ms, the RTT of the network 32 is 310 ms, the RTT of the network 33 is 100 ms, and the RTT of the network 34 is 305 ms, the RTT is smaller than the other networks. The transmission distribution unit 14 is instructed not to distribute packets to the network 33.

  The built-in clock 19A notifies the current time to the transmission distribution unit 14 and the RTT calculation units 161A to 164A.

(The invention's effect)
Next, the effect of this embodiment will be described.

  When the invention described in this embodiment is used, in a multipath environment in which a transmitter and a receiver are connected by a plurality of networks, the transfer efficiency is improved with a small number of order guarantee buffers when guaranteeing the arrival order. be able to.

  This is because the receiver sends out a corresponding ACK packet to the PHY (network) where the data packet has arrived, and an RTT calculator for calculating the RTT, minimum RTT, and maximum RTT is provided in the transmitter. This is because a plurality of variation detectors are provided for each, and the variation detector excludes a link having a large RTT deviation from a distribution destination at the time of transmission in the transmission distribution unit.

(Third embodiment)
The outline of the third embodiment of the present invention is that the transmission rate is calculated for each network based on the round trip time (RTT) for each network, and the network rate that greatly deviates from the deviation of the transmission rate of each network is calculated. By forcibly setting it to 0, it is excluded from the distribution destination at the time of transmission, the problem of Head Of Line Blocking is avoided, and high transfer efficiency is realized with a small order guarantee buffer capacity.

(Description of configuration)
With reference to FIG. 4, the structure in this Embodiment is demonstrated.

  The transmitter 1 in the third embodiment is provided with a rate calculation unit 17 for each flow as compared with the transmitter 1 in the second embodiment, and is provided as rate calculation units 171 to 174. Different. Further, the transmission distribution unit 14 is changed to the transmission distribution unit 14A, the transmission buffer 13 is changed to the transmission buffer 13A, and the transmission distribution unit 14A is different in that the packet is transferred from the transmission buffer 13A to the designated network.

  The rate calculation unit 171 receives the RTT notification from the RTT calculation unit 161A, and calculates the queuing delay (that is, congestion) of the network 31 from the difference between the RTT that has received this notification and the lowest RTT of the network that has received this notification. Based on this calculation, the packet transmission rate (bandwidth) from the transmission buffer 13 to the network 31 is determined and notified to the transmission buffer 13A and the variation detector 18.

  The new rate R ′ in the rate calculation unit 171 is the minimum rate that R is the current rate, α is an increase constant, β is a decrease constant, RTT is received from the RTT calculation unit, and RTTmin is received from the RTT calculation unit. If RTT and Tc are rate calculation intervals, they can be expressed by the following equations.

R ′ = R + (α / RTT−β × (RTT−RTTmin) × R / RTT) × Tc
When the rate calculation unit 171 receives a transfer exclusion instruction from the variation detector 18, the rate calculation unit 171 forcibly sets the rate to 0 regardless of the above formula and notifies the transmission buffer 13A of the rate.

  The rate calculation units 172 to 174 perform the same operation as the rate calculation unit 171 with respect to the networks 32 to 34.

  The transmission buffer 13A is different from the transmission buffer 13 in the second embodiment in that packets are transmitted according to the transmission rate of each network notified from the rate calculation units 171 to 174. At this time, the network to which the packet is to be transferred is also determined and notified to the transmission distribution unit 14A.

  The transmission distribution unit 14A transfers the received packet to the network that has received the notification from the transmission buffer 13A.

  The variation detector 18A receives notification of the transmission rate to the networks 31 to 34 from the rate calculators 171 to 174, and when there is a network whose transmission rate variation (deviation) exceeds a certain value, the transmission rate to this network The rate calculation units 171 to 174 are instructed to set 0 to 0.

  For example, when the transmission rate of the network 31 is 300 kbit / sec, the transmission rate of the network 32 is 310 kbit / sec, the transmission rate of the network 33 is 560 kbit / sec, and the transmission rate of the network 34 is 305 kbit / sec, The rate calculation unit 173 is instructed to set the transmission rate of the network 33 as 0.

  For example, if the transmission rate of the network 31 is 300 kbit / sec, the transmission rate of the network 32 is 310 kbit / sec, the transmission rate of the network 33 is 100 kbit / sec, and the transmission rate of the network 34 is 305 kbit / sec, The rate calculator 173 is instructed to set the transmission rate of the network 33, which is a low rate network, to zero.

(The invention's effect)
Next, the effect of this embodiment will be described.

  When the invention described in this embodiment is used, in a multipath environment in which a transmitter and a receiver are connected by a plurality of networks, the transfer efficiency is improved with a small number of order guarantee buffers when guaranteeing the arrival order. be able to.

  This is because the receiver sends out a corresponding ACK packet to the PHY (network) where the data packet has arrived, and calculates an RTT, a minimum RTT, and a maximum RTT in the transmitter, A plurality of rate calculators for determining the transmission rate for each network are provided for each network, and the variation detector sets a transmission rate to 0 for a link with a large transmission rate deviation, thereby allowing a network with a large transmission rate variation to be obtained. Because it separates.

  In the above embodiments and examples, the description has been made using the term “packet”, but the present invention can be similarly applied to a frame (such as an Ethernet frame). The divided data described using the term “packet” corresponds to “transmission data” in the present invention.

  Although the present invention has been described with reference to the preferred embodiments and examples, the present invention is not necessarily limited to the above-described embodiments and examples, and various modifications can be made within the scope of the technical idea. Can be implemented. Needless to say, the embodiments and examples described above can also be implemented in combination with each other. Note that the communication system according to the embodiment of the present invention can be realized by hardware, software, or a combination thereof.

  The present invention can be applied to uses such as an Ethernet switch and a router that transfer a large amount of data at high speed using a plurality of networks. The present invention can also be applied to uses such as a network interface card (NIC) that connects servers at high speed.

It is a block diagram which shows the structure of the 1st Embodiment of this invention. 5 is a flowchart showing details of order confirmation means 221. It is a block diagram which shows the structure of the 2nd Embodiment of this invention. It is a block diagram which shows the structure of the 3rd Embodiment of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Transmitter 2 Receiver 11 Data transmission part 12 SEQ provision part 13 Transmission buffer 13A Transmission buffer 14 Transmission distribution part 14A Transmission distribution part 17 Rate calculation part 18 Variation detector 18A Variation detector 19 Retransmission timer 19A Built-in clock 22 Extraction Control unit 24 ACK transmission unit 25 Output buffer 26 SEQ deletion unit 27 Data reception unit 151 PHY
152 PHY
153 PHY
154 PHY
161 Not arrived counter 162 Not arrived counter 163 Not arrived counter 164 Not arrived counter 161A RTT calculator 162A RTT calculator 163A RTT calculator 164A RTT calculator 171 Rate calculator 172 Rate calculator 173 Rate calculator 174 Rate calculator 211 PHY
212 PHY
213 PHY
214 PHY
221 Order confirmation operation 231 Order buffer 232 Order buffer 233 Order buffer 234 Order buffer

Claims (13)

In a communication device connected to the receiver via multiple networks,
RTT calculating means for calculating RTT for each network based on ACK transmitted from the receiver;
A variation detecting means for obtaining an RTT deviation of each network from a calculation result of the RTT calculating means, wherein the RTT has a larger network compared to other networks or an RTT compared to the other networks and determined a smaller network as a faulty link; ,
Transmission distribution means for distributing transmission data by round robin to a network other than the network determined as a failure link in the variation detection means;
A communication apparatus comprising:   The communication device according to claim 1,
  The RTT calculation means further calculates a minimum RTT for each network based on the ACK transmitted from the receiver,
  The queuing delay for each network is calculated based on the difference between the latest measured RTT of each network notified from the RTT calculation means and the minimum RTT for each network, and each network is calculated based on the queuing delay. A communication apparatus further comprising rate calculation means for determining a transmission rate. In a communication device connected to the receiver via multiple networks,
RTT calculation means for calculating RTT and minimum RTT for each network based on ACK transmitted from the receiver;
Based on a difference amount of the latest measured RTT and the minimum RTT for each of the networks of the network notified from the RTT calculation means calculates the queuing delay for each of the network, each network based on the queuing delay A plurality of rate calculation means installed in each network for determining each transmission rate;
Variation detecting means for obtaining a transmission rate deviation of each network, and determining a network having a transmission rate larger than that of another network or a network having a transmission rate smaller than that of another network as a failure link;
With
The communication apparatus according to claim 1, wherein the variation detecting means sets a transmission rate of a network determined as the failed link to zero .   The communication device according to claim 2 or 3,
  The rate calculating means determines a new transmission rate R ′ based on the following equation,
  R ′ = R + (α / RTT−β × (RTT−RTTmin) × R / RTT) × Tc
However,
R is a current transmission rate, α is an increase constant, β is a decrease constant, RTT is the latest measurement RTT of each network, RTTmin is the minimum RTT, and Tc is a rate calculation interval.
  A communication apparatus characterized by being. In a communication system in which a transmitter and a receiver are connected by a plurality of networks,
The transmitter is the communication device according to any one of claims 1 to 4,
The receiver is
Means for receiving transmission data from the transmitter;
ACK transmission means for transmitting a return ACK to the transmitter, using the network that has received the transmission data that triggered the transmission of ACK;
A communication system comprising: A method for improving transfer efficiency in a communication device connected to a receiver through a plurality of networks,
RTT calculation step for calculating RTT for each network based on ACK transmitted from the receiver;
A variation detection step of obtaining an RTT deviation of each network from the calculation result of the RTT calculation step, wherein the RTT has a larger network compared to the other network, or the RTT has a smaller network compared to the other network to determine a faulty link. ,
A transmission distribution step of distributing transmission data by round robin to a network other than the network determined to be a faulty link in the variation detection step;
A method for improving transfer efficiency, comprising:   In the transfer efficiency improvement method of Claim 6,
  In the RTT calculation step, a minimum RTT for each network is further calculated based on the ACK transmitted from the receiver,
  A queuing delay for each network is calculated based on the difference between the latest measured RTT of each network calculated by the RTT calculating step and the minimum RTT for each network, and the transmission of each network based on the queuing delay is calculated. A method for improving transfer efficiency, further comprising a rate calculation step of determining a rate. A method for improving transfer efficiency in a communication device connected to a receiver through a plurality of networks,
RTT calculation step for calculating RTT and minimum RTT for each network based on ACK transmitted from the receiver;
Based on said RTT calculated latest measured RTT and the minimum RTT for each of the network portion of the halftone calculated in step calculates the queuing delay for each of the network, wherein each respective network based on the queuing delay A rate calculation step that performs an operation for each network to determine the transmission rate of
A variation detecting step for obtaining a transmission rate deviation of each network, and determining a network having a transmission rate larger than that of another network or a network having a transmission rate smaller than that of another network as a faulty link;
With
The method for improving transfer efficiency , wherein the variation detecting means sets a transmission rate of a network determined as the failed link to zero .   In the transfer efficiency improvement method according to claim 7 or 8,
  In the rate calculation step, R ′, which is a new transmission rate, is determined based on the following formula:
  R ′ = R + (α / RTT−β × (RTT−RTTmin) × R / RTT) × Tc
However,
R is a current transmission rate, α is an increase constant, β is a decrease constant, RTT is the latest measurement RTT of each network, RTTmin is the minimum RTT, and Tc is a rate calculation interval.
  A method for improving transfer efficiency, characterized in that: A method for improving transfer efficiency in a communication system in which a transmitter and a receiver are connected by a plurality of networks,
The transmitter performs the transfer efficiency improvement method according to any one of claims 6 to 9,
The receiver receives transmission data from the transmitter;
An ACK transmission step in which the receiver uses the network that has received the transmission data that triggered the transmission of ACK to transmit a return ACK to the transmitter;
A method for improving transfer efficiency, comprising: A transfer efficiency improvement program in a communication device connected to a receiver through a plurality of networks,
An RTT calculation function for calculating an RTT for each network based on an ACK transmitted from a receiver;
A variation detection function for obtaining an RTT deviation of each network from the calculation result of the RTT calculation function, and determining that a network having a larger RTT compared to other networks or a network having a smaller RTT compared to other networks is a failed link. ,
A transmission distribution function for distributing transmission data by round robin to a network other than the network determined to be a failure link in the variation detection function;
A transfer efficiency improvement program characterized by causing a computer to realize the above. The transfer efficiency improvement program according to claim 11,
  The RTT calculation function further calculates a minimum RTT for each network based on the ACK transmitted from the receiver,
  The computer calculates a queuing delay for each network based on the difference between the latest measured RTT of each network notified from the RTT calculation function and the minimum RTT for each network, and based on the queuing delay, A transfer efficiency improvement program characterized by further realizing a rate calculation function for determining a transmission rate of each network. A transfer efficiency improvement program in a communication device connected to a receiver through a plurality of networks,
RTT calculation function for calculating RTT and minimum RTT for each network based on ACK transmitted from the receiver;
On the basis of the difference amount of the latest measured RTT and the minimum RTT for each of the networks of the network notified from RTT calculation function calculates the queuing delay for each of the network, each network based on the queuing delay Multiple rate calculation functions installed in each network to determine each transmission rate,
A variation detection function for obtaining a transmission rate deviation of each network, and determining a network having a transmission rate larger than that of another network or a network having a transmission rate smaller than that of another network as a failure link,
Is realized on a computer ,
The program for improving transfer efficiency , wherein the variation detection function sets a transmission rate of a network determined as the failed link to zero .

Images