WO2005067261A1 - 通信方法 - Google Patents
通信方法 Download PDFInfo
- Publication number
- WO2005067261A1 WO2005067261A1 PCT/JP2005/000124 JP2005000124W WO2005067261A1 WO 2005067261 A1 WO2005067261 A1 WO 2005067261A1 JP 2005000124 W JP2005000124 W JP 2005000124W WO 2005067261 A1 WO2005067261 A1 WO 2005067261A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- packet
- node
- flow
- path
- transmission
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1642—Formats specially adapted for sequence numbers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1887—Scheduling and prioritising arrangements
Definitions
- the present invention relates to packet communication between two nodes where a flow exists, and particularly to retransmission control.
- Patent Document 1 When two nodes perform packet communication via the Internet, packet loss and packet order errors occur.
- Patent Document 1 a technique of a packet retransmission method has been proposed (for example, Patent Document 1).
- the technique of Patent Document 1 performs flow control and sequence control of a transmission packet between a transmission node and a reception node. However, if the reception node has to wait for a sequence due to packet loss, a packet to be sequenced within a certain time period If the packet is not received, it notifies the transmitting node of a request for retransmission of the packet whose order is waiting.
- FIG. 19 shows detection of packet loss when packets from three flows 1, 2, and 3 are transmitted through one path.
- packet 1-1, packet 1-2 and packet 1-3 are received from flow 1, and packet 2-1, packet 2-2 and packet 2-3 are received from flow 2.
- Packet 3-1, packet 3-2, and packet 3-3 are received from flow 3.
- Each packet is provided with identification information indicating the flow and the order (sequence number) of the packet of each flow. For example, packet 2-1 indicates that it is the second order in flow 2.
- one packet When transmitting a received packet to one path 4, one packet is selected in order from each flow and transmitted to the path 4. That is, packet 1-1, packet 2-1 , Packets 3-1,..., Packets 1-3, packets 2-3, and packets 3-3 in that order.
- the receiving side controls the order of reordering the packets received from the route 4 for each flow based on the identification information of the packets, and detects lost packets to request retransmission (reproduction control). I was
- Patent Document 1 Japanese Patent Application Laid-Open No. 9-46375
- the present invention has been made in view of the above problems, and an object of the present invention is to solve the above problems, and to detect packet loss earlier than in the conventional retransmission control for each flow. To provide effective technologies.
- An object of the present invention is to provide identification information for packet loss detection and reproduction control, separately from identification information for order control, to a packet so that order control and packet loss detection and detection can be performed. Performing replay control independently enables early detection of packets and retransmission control To provide technology.
- a first invention for solving the above problems is a communication method between a transmitting node and a receiving node
- the packet includes the first identifier, a first sequence number unique within the first flow identified by the first identifier, the second identifier, and the second identifier. With a unique second sequence number within the flow And send,
- All received packets are classified based on the first identifier, and for each first flow, the packets are arranged in order based on the first sequence number, and the receiving process is performed from the packets in order. It is characterized by performing.
- the transmitting node and the receiving node are connected by one communication path, and the second flow group of the transmitting node is a single flow. In And transmitting the packet using a single communication path.
- the transmitting node when there are a plurality of communication paths for transmitting a packet, the transmitting node is based on a third criterion relating to a packet transmission schedule. A communication path for transmitting a packet is selected.
- the transmission node and the reception node are connected by a plurality of communication paths, and the transmission node performs transmission as a second reference. It is classified into unique flows according to the communication path through which the bucket passes, and the third criterion is to select a communication path at the time of retransmission independently of the first transmission.
- the transmission node and the reception node are connected by a plurality of communication paths, and the transmission node performs transmission as a second reference.
- the flow is classified into a smaller number of flows than the communication path through which the bucket passes, and the third criterion is to select a communication path at the time of retransmission independently of the first transmission.
- a sixth invention for solving the above-mentioned problem is the invention according to any one of the first to third inventions, wherein the transmission node is a transmission-side transmission node for transmitting a packet transmitted by another communication node, Is a receiving-side transfer node that transfers a packet received by another communication node.
- a seventh invention for solving the above problems is the sixth invention, wherein the transmission node and the reception node are connected by one communication path, and the second flow group of the transmission node is a single flow group. It is composed of flows and transmits packets using a single communication path.
- the transmission node and the reception node are connected by a plurality of communication paths, and the transmission node transmits the data as a second reference. It is classified into unique flows according to the communication path through which the bucket passes, and the third criterion is to select a communication path at the time of retransmission independently of the first transmission.
- the transmission node and the reception node are connected by a plurality of communication paths, and the transmission node performs transmission as a second reference.
- the flow is classified into a smaller number of flows than the communication path through which the bucket passes, and the third criterion is to select a communication path at the time of retransmission independently of the first transmission.
- a tenth invention for solving the above-mentioned problem is the third invention according to the third invention, wherein For each packet input at the transmitting node, the path status information of each selectable path, the time when the path state information becomes valid or the identification information of the transmitted packet, and the path state information are valid The route selection or the selection priority is performed on the basis of the transmission history after the time or the transmission history after the transmission of the packet specified by the identification information of the transmitted packet.
- An eleventh invention for solving the above-mentioned problems is characterized in that, in the above-mentioned tenth invention, said route status information includes a delay of a route.
- a twelfth invention for solving the above-mentioned problems is characterized in that in the above-mentioned tenth or eleventh invention, said route state information includes a communication speed of a route.
- a thirteenth invention for solving the above-mentioned problems is characterized in that, in any one of the tenth to twelfth inventions, the route state information includes a load on the route.
- the route state information of each route is updated when the route is selected or the selection priority is updated. And modifying the transmission cost calculation result for the packet transmitted before the update.
- the latest path state information is effective when correcting the transmission cost calculation result of each path.
- the history before the first transmitted packet is discarded.
- a sixteenth invention for solving the above-mentioned problems is characterized in that, in any one of the tenth to fifteenth inventions, the estimated value of the reception completion time at the reception-side node is set as the path for transmitting the packet. It is characterized by selecting an early-relay route.
- a seventeenth invention for solving the above-mentioned problems is characterized in that, in any one of the above-mentioned tenth to sixteenth inventions, as a path for transmitting a packet, a data amount that can be completely received by a receiving node by a specific time. Is characterized in that a route having the maximum estimated value is selected.
- transmission of data is interrupted in accordance with an estimated current path state for each path. It is characterized.
- a nineteenth invention for solving the above-mentioned problems is characterized in that, in the eighteenth invention, the data transmission
- the interruption criterion is characterized in that the estimated reception completion time is equal to or greater than a specific value.
- the determination of route selection or transmission interruption is performed by a different policy for each attribute of transmission data. It is characterized.
- a twenty-first invention for solving the above-mentioned problems is a node comprising a transmitting unit for transmitting a packet and a receiving unit for receiving a packet, and independently performing retransmission control and order control of the packet,
- the transmitting unit includes:
- the receiving unit receives
- All received packets are classified based on the second identifier, and for each second flow, a packet of a second sequence number that has not been received is checked, and the second identifier and the second identifier are checked.
- All received packets are classified based on the first identifier, and for each first flow, packets are arranged in order based on the first sequence number.
- the nodes are connected by one communication path, the second flow group is constituted by a single flow, and Communication path The transmission of the packet is performed by using the packet.
- a twenty-third invention for solving the above-mentioned problems is characterized in that, in the above-mentioned twenty-first invention, when there are a plurality of communication routes for transmitting a packet, a packet is transmitted based on a third criterion relating to a packet transmission schedule. Characterized in that it has means for selecting a communication path for transmitting the.
- the nodes are connected by a plurality of communication paths, and correspond to a communication path through which a packet to be transmitted passes as a second criterion.
- the third feature is that, as a third criterion, a communication route is selected at the time of retransmission independently of the first transmission.
- the nodes are connected by a plurality of communication paths, and as a second criterion, the number is smaller than the number of communication paths through which a packet to be transmitted passes.
- the third criterion is that the third criterion is to select a communication path at the time of retransmission independently of the time of the first transmission.
- a twenty-sixth invention for solving the above-mentioned problems is characterized in that, in any one of the above-mentioned twenty-first to twenty-third inventions, the transmission unit of the node transmits a transmission side transmission node transmitting a packet transmitted by another communication node. And the receiving unit of the node is a receiving-side transfer node that transfers a packet received by another communication node.
- the nodes are connected by one communication path, and the second flow group is composed of a single flow. It is characterized by transmitting packets using the communication path of (1).
- the nodes are connected by a plurality of communication paths, and correspond to a communication path through which a packet to be transmitted passes as a second criterion.
- the third feature is that, as a third criterion, a communication route is selected at the time of retransmission independently of the first transmission.
- the nodes are connected by a plurality of communication paths, and as a second criterion, the number is smaller than the number of communication paths through which a packet to be transmitted passes.
- the third criterion is that the third criterion is to select a communication path at the time of retransmission independently of the time of the first transmission.
- the communication path is provided.
- the selecting means includes, as a third criterion, for each packet input at the node, path state information of each selectable path, time when the path state information becomes valid, or identification information of a transmitted packet, Based on the transmission history after the time when the path state information becomes valid or the transmission history after transmission of the packet specified by the identification information of the transmitted packet, the selection of the path or the selection priority is performed.
- a thirty-first invention for solving the above-mentioned problems is characterized in that, in the above-mentioned thirtieth invention, said route state information includes a delay of a route.
- a thirty-second invention for solving the above-mentioned problems is characterized in that, in the thirty-first invention, said route status information includes a communication speed of the route.
- a thirty-third invention for solving the above-mentioned problems is characterized in that, in any one of the thirty-third to thirty-second inventions, said path state information includes a path load.
- a thirty-fourth invention for solving the above-mentioned problems is characterized in that, in any one of the thirty-third to thirty-third inventions, the means for selecting the communication path includes: When the route state information of the route is updated, the transmission cost calculation result of the packet transmitted before the update is modified.
- a thirty-fifth invention for solving the above-mentioned problems is characterized in that, in any one of the above-mentioned thirtieth to thirty-fourth inventions, the means for selecting the communication path includes the latest transmission cost calculation result for each path.
- the feature is to discard the history before the first transmitted packet for which the path status information becomes valid.
- a thirty-sixth invention for solving the above-mentioned problems is characterized in that, in any one of the thirty-seventh to thirty-fifth inventions, the means for selecting the communication path includes a receiving node as a path for transmitting a packet. Is characterized in that a route having the earliest estimated value of the reception completion time is selected.
- a thirty-seventh invention for solving the above-mentioned problems is characterized in that, in any one of the thirty-sixth to thirty-sixth inventions, the means for selecting a communication path includes a receiving node as a path for transmitting a packet. It is characterized by selecting the route with the largest estimated data amount that can be received by a specific time.
- a thirty-eighth invention for solving the above-mentioned problems is characterized in that, in any one of the thirty-seventh to thirty-seventh inventions, the means for selecting the communication path comprises: The transmission of data is interrupted according to
- a thirty-ninth aspect of the present invention for solving the above-mentioned problems is characterized in that, in the thirty-eighth aspect of the present invention, a criterion of the data transmission interruption is that an estimated reception completion time is a specific value or more.
- a fortieth invention for solving the above-mentioned problems is characterized in that in any one of the above-mentioned thirtieth to thirty-ninth inventions, the means for selecting a communication path is configured to determine whether to select a path or to suspend transmission by transmitting data. It is performed by a different policy for each data attribute.
- a forty-first invention for solving the above-mentioned problems is a control program for a node which independently performs retransmission control and order control of packets,
- the control program controls the node
- All received packets are classified based on the second identifier, and for each second flow, a packet of a second sequence number that has not been received is checked, and the second identifier and the second identifier are checked.
- All received packets are classified based on the first identifier, and for each first flow, packets are arranged in order based on the first sequence number.
- a forty-second invention for solving the above-mentioned problems
- the nodes are connected by one communication path
- the second flow group is constituted by a single flow
- the It is characterized by transmitting packets using a communication path.
- a forty-third invention for solving the above-mentioned problems is characterized in that, in the forty-first invention, when there are a plurality of communication paths for transmitting a packet, said control program is a third one relating to a packet transmission schedule. It is further characterized by further functioning as a means for selecting a communication path for transmitting a packet based on a criterion.
- the nodes are connected by a plurality of communication paths, and correspond to a communication path through which a packet to be transmitted passes as a second criterion.
- the third feature is that, as a third criterion, a communication route is selected at the time of retransmission independently of the first transmission.
- a forty-fifth invention for solving the above-mentioned problems is characterized in that, in the forty-third invention, the nodes are connected by a plurality of communication paths, and as a second criterion, the number is smaller than the number of communication paths through which packets to be transmitted pass.
- the third criterion is that the third criterion is to select a communication path at the time of retransmission independently of the time of the first transmission.
- a forty-sixth invention for solving the above-mentioned problems is characterized in that in any one of the forty-first to forty-third inventions, the transmitting side of the node transmits a packet transmitted by another communication node. And the receiving side of the node is a receiving side transfer node for transferring a packet received by another communication node.
- the nodes are connected by one communication path, and the second flow group is composed of a single flow. It is characterized by transmitting packets using the communication path of (1).
- the nodes are connected by a plurality of communication paths, and correspond to a communication path through which a packet to be transmitted passes as a second criterion.
- the third feature is that, as a third criterion, a communication route is selected at the time of retransmission independently of the first transmission.
- a forty-ninth invention for solving the above-mentioned problems is characterized in that, in the above-mentioned forty-sixth invention, nodes are connected by a plurality of communication paths, and as a second criterion, the number is smaller than the number of communication paths through which packets to be transmitted pass.
- the third criterion is that the third criterion is to select a communication path at the time of retransmission independently of the time of the first transmission.
- a fiftieth invention for solving the above-mentioned problems is the control program according to the forty-third invention, wherein
- the means for selecting the communication path includes, for each packet input at the node, path state information of each selectable path, a time at which the path state information becomes valid, or identification information of a transmitted packet, Based on the transmission history after the time when the path status information becomes valid or the transmission history after transmission of the packet specified by the identification information of the transmitted packet, a function is performed so as to select a path or a selection priority. It is characterized by the following.
- a fifty-first invention for solving the above-mentioned problems is characterized in that, in the above-mentioned fifty-second invention, said route status information includes a delay of a route.
- a fifty-second invention for solving the above-mentioned problems is characterized in that, in the above-mentioned fifty-first invention or the fifty-first invention, said route state information includes a communication speed of the route.
- a fifty-third invention for solving the above-mentioned problems is characterized in that, in any of the above-mentioned fifty-second invention to the fifty-second invention, said route state information includes a load of a route.
- control program further comprises means for selecting the communication path, the path selection or the selection priority.
- control program further comprises means for selecting the communication path by updating the latest path state information when correcting the transmission cost calculation result of each path. It is characterized in that it functions so as to discard the history before the first transmitted packet for which is valid.
- control program according to any of the fifty-fifth to fifty-fifth inventions, wherein the control program selects the communication path as a path for transmitting a packet. It is characterized by a function to select the route with the earliest estimated value of the reception completion time at the side node.
- a fifty-seventh invention for solving the above problems is the control program according to any one of the fifty-sixth to fifty-sixth inventions, wherein the control program selects the communication path as a path for transmitting a packet.
- the receiving node has a function of selecting a route having the maximum estimated value of the amount of data that can be received by a specific time.
- the control program is configured such that the means for selecting the communication path is estimated for each path. It is characterized in that it functions to interrupt data transmission according to the current route status.
- a fifty-ninth invention for solving the above-mentioned problems is characterized in that, in any one of the above-mentioned fifty-eighth inventions, the criterion of data transmission interruption is that an estimated reception completion time is a specific value or more.
- control program includes means for selecting the communication path, which determines whether to select a path or to suspend transmission. This is characterized in that it is made to function according to a different policy for each attribute of transmission data.
- a sixty-first invention for solving the above-mentioned problems is a communication method, wherein a transmission packet includes an identifier for identifying a transmission flow, separately from information for order control, and a transmission packet within the transmission flow. A sequence number is assigned, and retransmission control is performed for each transmission flow on the receiving side based on the identifier and the sequence number.
- a 62nd invention for solving the above-mentioned problem is a communication method, wherein a transmission packet includes an identifier for identifying a transmission flow, separately from information for order control, and A sequence number is provided, and a packet loss is detected for each transmission flow on the receiving side based on the identifier and the sequence number.
- a sixty-third invention for solving the above problems is a node
- a first identifier uniquely assigned to each flow of the first flow group based on a first criterion for order control, and a first sequence unique within each flow belonging to the first flow group number and a second identifier that is uniquely assigned to each flow of a second flow group based upon a second criteria for retransmission control, the second unique in each of the the flow belonging to the second flow group Means for adding a sequence number to the packet and transmitting the packet, and means for retransmitting a lost packet detected for each transmission flow based on the second identifier and the second sequence number. It is characterized by the following.
- a sixty-fourth invention for solving the above problems is a control program for a node, The control program controls the node,
- a means for adding a sequence number to the packet and transmitting the packet and a means for retransmitting a lost packet detected for each transmission flow based on the second identifier and the second sequence number. It is characterized by the following.
- a retransmission control identifier is added to a packet to be transmitted separately from the sequence control identifier, the sequence control is performed based on the sequence control identifier, and the packet loss detection and the reproduction control are performed by the retransmission control. Is performed based on the identifier of An identifier for retransmission control is provided for each retransmission flow, and furthermore, identification information such as a sequence number for uniquely identifying a packet in the flow is added. Normally, there is a one-to-one relationship between the retransmission flow and the transmitted / received route.
- FIG. 15 shows an example in which packets are transmitted and received between the transmitting side and the receiving side via one path a.
- a packet of each flow on the transmitting side is provided with a first identifier for identifying a flow of order control, and a first sequence number unique within each flow. For example, for the second packet of flow 1, it is "1-2".
- a second identifier for identifying a flow of retransmission control and a second sequence number unique within each flow are provided apart from this identifier for order control.
- the identifier for identifying the retransmission flow is “a”, and a packet is uniquely identified within the flow (route a) identified by this “a”.
- a sequence number is assigned so that it can be identified. Therefore, the identifier of the retransmission control of the first packet in the flow (path a) identified by "a" is "I".
- the transmitting side attaches the above-described identifier to the packet, selects one packet from each flow in order, and transmits the packet to the path a. That is, packet (1-1, al), packet (2-1, al) a-2),..., and packets (3-3, a-9) (sequence control identifier, retransmission control identifier) are transmitted in this order. On the other hand, the transmitted packet is held as a retransmission queue.
- packets are received in the order in which they were transmitted, so that packets (1-1, a-1), packets (2-1, a_2), The packet is received in the order of a-4), packet (3-2, a_6), ⁇ , and packet (3_3, a-9).
- the present invention performs detection of packet loss and retransmission control based on a retransmission control identifier.
- the retransmission control identifier of the packet received from the route a is checked, it is ⁇ ⁇ ⁇ , “a_4”, “a_6”, ⁇ ⁇ ⁇ , “a_9”. It can be seen that "a-5" is missing when (2, a_6) is received. Therefore, it is understood that the packet (2-2, a-5) having the retransmission control identifier of "a-5" is lost, and the retransmission request of this packet (2-2, a_5) is sent to the transmitting side. Do.
- the transmitting side Upon receiving the retransmission request for the packet having the retransmission control identifier "a-5", the transmitting side retransmits the packet having the retransmission control identifier "a-5" held in the retransmission queue.
- order control is performed based on the order control identifier independently of the above-described packet loss detection and retransmission control, and there is no request for retransmission for packet loss.
- the loss of the packet (2-2, a_5) can be detected. Since packet loss can be detected at the same time, and retransmission control is also performed independently, it is possible to prevent delay in order control due to packet loss.
- the detection of packet loss in retransmission control is not limited to the case where packet loss detection is performed on the receiving side as described above.
- the receiving side transmits information on an already arrived packet to the transmitting side.
- the packet loss may be detected on the transmitting side based on this information.
- the present invention is associated with the conventional sequence control by independently performing sequence control and retransmission control in packet communication and assigning a retransmission ID to a unit capable of detecting packet loss at the earliest time. Detection of packet loss earlier than retransmission control performed for each flow It works.
- FIG. 1 is a diagram showing a communication network configuration in the case of S1 path forces between transmitting and receiving nodes.
- FIG. 2 is a diagram showing a configuration of a transmitting node or a receiving node.
- FIG. 3 is a diagram showing a configuration of a packet.
- FIG. 4 is a diagram showing information stored in a storage unit in the first embodiment.
- FIG. 5 is a diagram showing a communication network configuration when there are M routes between transmitting and receiving nodes.
- FIG. 6 is a diagram showing a configuration of a transmitting node or a receiving node.
- FIG. 7 is a diagram showing information stored in a storage unit in the second embodiment.
- FIG. 8 is a flowchart of a retransmission ID identical communication interface. Group determination algorithm.
- FIG. 9 is a diagram showing information stored in a storage unit in the third embodiment.
- FIG. 10 is a diagram showing a communication network configuration when the number of transmission / reception-side transfer nodes is M.
- FIG. 11 is a diagram showing packet processing timings at the transmitting node and the receiving node in the first operation example of the scheduler.
- FIG. 12 is an operation flowchart of the scheduling unit in Operation Example 1 of the scheduler.
- FIG. 13 is a diagram showing packet processing timings at the transmitting node and the receiving node in the second operation example of the scheduler.
- FIG. 14 is an operation flowchart of the scheduling unit in the operation example 2 of the scheduler. It is.
- FIG. 15 is a view for explaining the present invention.
- FIG. 16 is a diagram for explaining a specific operation of the first embodiment of the present invention.
- FIG. 17 is a diagram for explaining a specific operation of the first embodiment of the present invention.
- FIG. 18 is a diagram showing a specific example of the packet processing timing of the transmitting node and the receiving node in the first operation example of the scheduler.
- FIG. 19 is a diagram for explaining a conventional technique.
- the present invention is characterized in that in packet communication, order control and retransmission control are performed independently.
- the transmitting node includes a first flow group having one or more flows based on a first criterion for order control and a second flow group having one or more flows based on a second criterion for retransmission control. And a second flow group, a unique first identifier is assigned to each flow belonging to the first flow group, and a unique second identifier is assigned to each flow belonging to the second flow group. I have. Then, the packet to be transmitted is classified into one or more flows belonging to the first flow group based on the first criterion, and is classified into one or more flows belonging to the second flow group based on the second criterion.
- a first identifier a first sequence number unique within each flow belonging to the first flow group, the second identifier, and a respective sequence belonging to the second flow group.
- a unique second sequence number is added to the packet to be transmitted, and the packet is transmitted.
- the receiving node classifies all the received packets based on the second identifier and classifies each packet. For the flow of (2), check the packet of the second sequence number that has not been received, and request retransmission of the packet corresponding to the second sequence number that has not been received. Then, the transmitting node controls retransmission by retransmitting a packet corresponding to the second sequence number of the second flow requested by the receiving node.
- a receiving node classifies all received packets based on a first identifier, and classifies packets based on a first sequence number for each first flow. This is performed by arranging the packets in order and performing reception processing from the packets in order.
- Example 1 of the present invention will be described.
- the first embodiment of the present invention includes a transmitting node 101, a receiving node 102, and a path 110 connecting the nodes.
- the route 110 is a packet communication network such as the Internet. It should be noted that the communication may be from the transmitting node 101 to the receiving node 102 or from the receiving node 102 to the transmitting node 101.
- the nodes are named transmit-receive, but they are functionally identical.
- FIG. 2 is a diagram showing a configuration of the transmitting node 101.
- a flow is identified by identifying a socket 201 which is an API (Application Process Interface) for an application, an input / output unit 202, a port number to be used and a destination address and a port number.
- a flow identification unit 211 for distributing a flow to a queue; a flow identification unit 222 for distributing a flow to a queue of each identifier; a per-flow queue 212, 224 for holding a packet for each identified flow;
- Scheduler 213 for selecting and transmitting packets to be transmitted, retransmission ID attached to packets at the time of packet transmission, retransmission control unit 214 for storing in retransmission queue 215 for each retransmission ID to prepare for retransmission, and retransmission ID for each retransmission ID Retransmission queue 215 that holds packets in
- a storage unit 216 that records information such as delay dispersion, sequence number information for each flow and each retransmission ID, and a retransmission that checks the retransmission
- the configuration of the receiving node 102 is the same as that of the transmitting node 101.
- the transmitting node causes an arbitrary number of applications to generate an arbitrary number of communications using TCP or UDP.
- the first criterion is a criterion related to packet order control, and each communication of TCP and UDP corresponds to the first flow.
- the socket 201 When the socket 201 receives a packet from the application, the packet is passed to the flow identification unit 211, and the flow identification unit 211 identifies the flow from the port number of the own node and the port number of the destination address of the packet. The identified packet is stored in the per-flow queue 212 for each flow.
- Fig. 2 shows an example in which there are 70 queues for each flow.
- the force is not limited to this number, and may be larger or smaller.
- the packets stored in the per-flow queue 212 are processed by the scheduler 213 and the retransmission control unit 214 for processing necessary for retransmission in the event of packet loss, and then transmitted to the receiving node 102 via the input / output terminal 202. At the same time, it is held in the retransmission queue 215 for dealing with packet loss.
- the scheduler 213 determines the transmission timing of the packet to be transmitted, determines the queue for transmitting the packet to the receiving node 102 from the per-flow queue 212 at the transmission timing, and extracts the packet from the corresponding queue.
- the extracted packet is passed to retransmission control section 214 in order to perform necessary processing for retransmission.
- Retransmission control section 214 performs retransmission control based on a second criterion that is different from the first criterion that is a criterion regarding packet transmission described above.
- the second criterion is a criterion for packet retransmission.
- retransmission control section 214 refers to storage section 216 to add The retransmission ID and the retransmission sequence number to be transmitted are determined, and the packet is stored in a predetermined queue of the retransmission queue 215.
- the second flow corresponds to a packet group in units of the retransmission ID.
- the second flow and the route correspond one-to-one.
- the retransmission control unit 214 notifies the scheduler 213 of the determined retransmission ID and retransmission sequence number. Sequence number), a flow ID uniquely assigned to each flow obtained from the storage unit 216, a flow sequence number unique to the flow (first identifier for sequence control, first sequence number), and Is attached as a unique header, and the packet is transmitted to the receiving node 101 using the input / output unit 202.
- the storage unit 216 holds and stores information as shown in FIG. 4, for example.
- the maximum flow sequence number of the transferred packet is “25”.
- the retransmission ID "1" indicates that the retransmitted packet retransmission sequence numbers are "1 to 200 and 203". Note that, among the resent sequence numbers of the arrived packets, the numbers “201, 202” that are not described are the sequence numbers of the packets whose arrival has been confirmed.
- the receiving node 102 will be described.
- the receiving node 102 receives a packet transmitted from the input / output unit 202 of the transmission node 101 via the input / output unit 202.
- the node that determines that a packet loss has occurred can be applied to both the data receiving side and the transmitting side.
- the data receiving side sends only the ACK for notifying the arrival confirmation to the transmitting side.
- the following shows a case where the transmitting side determines that packet loss has occurred on an arbitrary basis.
- the transmitting node 101 and the receiving node 102 have the same configuration, an operation example of the receiving node 102 will be described with reference to FIG. [0118]
- the packet received from input / output section 202 is input to retransmission ID order check section 221.
- retransmission ID order checking section 221 obtains a retransmission ID and a retransmission sequence number from the packet, and obtains the retransmission ID of the received packet and the retransmission sequence number of the received packet. Is passed to the scheduler 213.
- the scheduler 213 having received the ACK information transmits the ACK packet including the passed ACK information via the input / output unit 202 to notify the transmitting node 101 that the packet has been received. If another transmission data packet exists at the timing of transmitting the ACK packet, it is better to add information to the header of the data packet without generating an independent ACK packet.
- retransmission ID order check section 221 notifies storage section 216 of the retransmission sequence number information of the retransmission ID of the received packet, and updates retransmission sequence number information stored in storage section 216 to perform retransmission control. The process is completed. After the retransmission control processing is completed, the retransmission ID order check unit 221 supplies the received packet to the flow identification unit 222, and the order control processing is performed.
- the flow identification unit 222 acquires the flow ID from the packet supplied from the retransmission ID order check unit 221 and sends the packet to the corresponding queue of the per-flow queue 224 according to the flow ID.
- Figure 2 shows a configuration example with queues for 100 different flows.
- the flow order check unit reports that a new packet has been received together with the flow ID.
- the flow order check unit 223 obtains the transmitted maximum flow sequence number from the storage unit 216 by using the corresponding flow ID.
- the flow order check unit 223 checks a queue corresponding to the input flow ID. As a result of the check, if there is a continuous packet with the transferred maximum flow sequence number, the continuous packet is extracted, and the flow ID, the flow sequence number, the retransmission ID, and the retransmission sequence in the frame format shown in Fig. 3 are extracted. Remove the number and pass it to the application via socket section 201. On the other hand, if there is no packet having a flow sequence number that is continuous with the transferred maximum flow sequence number, the flow order check unit 223 ends the operation. [0125] The subsequent operation is the same as the operation of the transmitting node described above.
- retransmission ID order checking unit 221 extracts the ACK information. Next, the retransmission ID and the retransmission sequence number received by the receiving node 102 are obtained from the ACK information, the retransmission ID and the retransmission sequence number are stored in the storage unit 216 as a packet whose arrival has been confirmed, and the retransmission ID and The packet corresponding to the retransmission sequence number is deleted from the queue 215 for each retransmission ID.
- transmitting node 101 periodically checks the stored retransmission ID and retransmission sequence number that have been stored, and detects a missing retransmission sequence number. Then, the packet corresponding to the missing retransmission ID and retransmission sequence number is regarded as lost, and the packet corresponding to the missing retransmission ID and retransmission sequence number is taken out from the retransmission ID queue 215, and the packet is sent to the scheduler 213. Give it and notify that retransmission is necessary.
- the scheduler 213 retransmits the received packet. At this time, the retransmitted packet is retransmitted with the same retransmission ID and retransmission sequence number as those of the previously transmitted packet.
- FIG. 16 is a diagram for explaining a specific operation between the transmitting node 101 and the receiving node 102.
- the configuration shown in FIG. 2 and the transmission information shown in FIG. 4 will be described as an example.
- the scheduler 213 of the transmitting node 101 extracts packets one by one from the 70 flows of the per-flow queue 212, and the retransmission control unit 214 refers to the storage unit 216 and adds the packet to the transmission packet.
- the retransmission ID and the retransmission sequence number are assigned. For example, if the retransmission ID is "1" and the sequence number is "200", "1-200" is added.
- the packet with the retransmission ID and retransmission sequence number is transmitted to the receiving node 102 via the input / output terminal 202, and is also stored in the retransmission queue 215 for coping with packet loss. Is done.
- packets (11-54, 1-200), packets (14-24, 1-203) ... are input / output units.
- the retransmission ID sequence check unit 221 obtains a retransmission ID and a retransmission sequence number from the packet, such as “1-200” and “1-203”, and retransmits the retransmission ID of the received packet.
- the ACK information including the retransmission sequence number and the ACK information is passed to the scheduler 213.
- the scheduler 213 having received the ACK information transmits the ACK packet including the passed ACK information via the input / output unit 202 to notify the transmitting node 101 that the packet has been received.
- retransmission ID order check section 221 notifies storage section 216 of the retransmission sequence number of the retransmission ID of the received packet, and updates the received packet retransmission sequence number stored in storage section 216. Thus, the retransmission control processing is completed. Retransmission after completion of retransmission control processing
- the ID order check unit 221 supplies the received packet to the flow identification unit 222, and performs an order control process.
- the flow identification unit 222 determines from the packet supplied from the retransmission ID order check unit 221 the flow ID "11", ⁇ ⁇ ⁇ , the flow ID “14”, ⁇ ⁇ ⁇ , the flow ID “1”. And sends the packet to the corresponding queue of the per-flow queue 224 according to the flow ID.
- FIG. 16 shows that the received packet (14-24) is transmitted to flow 14, the packet (11-54) is transmitted to flow 11, and the packet (1-23) is transmitted to flow 1.
- retransmission ID order checking section 221 extracts the ACK information.
- the retransmission ID and the retransmission sequence number received by the receiving node 102 are acquired from the ACK information, and the retransmission ID and the retransmission sequence number are stored in the storage unit 216 as a packet whose arrival has been confirmed.
- the packet corresponding to the retransmission ID and the retransmission sequence number is deleted from the queue 215 for each retransmission ID.
- retransmission control section 214 checks the retransmission ID and retransmission sequence number that have arrived at regular intervals, and detects the missing retransmission sequence number.
- the retransmission sequence numbers “201” and “202” are missing. Therefore, the packets corresponding to the missing retransmission sequence numbers "201” and “202” are regarded as being lost, and the packets corresponding to the retransmission sequence numbers "201” and "202” are taken out from the retransmission ID queue 215 and the scheduler 213 Give the packet to and notify that retransmission is required.
- the scheduler 213 retransmits the received bucket. At this time, the packet to be retransmitted is retransmitted with the retransmission ID and retransmission sequence number attached to the previously transmitted packet, ie, “1-201” and “1-202”.
- FIG. 17 is a diagram for explaining a case where packet loss is detected at the receiving node 102.
- reception information shown in FIG. 4 is used as information used for detecting packet loss at the receiving node 102. Further, the operation from the transmission side node to the reception node is the same as the above-described operation, and therefore a specific description is omitted.
- retransmission ID order check section 221 obtains a retransmission ID and a retransmission sequence number from the packet, such as "1-100" and "1-102", and obtains the retransmission ID and the retransmission sequence number. By comparing the retransmission ID stored in the reception information of storage section 216 with the received packet retransmission sequence number, it is determined whether a packet expected to be received has been received.
- ACK information including the retransmission ID of the received packet and the retransmission sequence number of the received packet is passed to the scheduler 213.
- the ACK information including the retransmission ID of the received packet and the highest retransmission sequence number among the packets received continuously from the beginning with the retransmission ID of the received packet is passed to the scheduler 213.
- the received packet (11-54, 1-100) is an expected packet
- the ACK information including the retransmission ID of the received packet and the retransmission sequence number of the received packet, that is, "1-100” is passed to the scheduler 213.
- the retransmission ID and the retransmission sequence number information “1-100” of the received packet are notified to storage section 216, and the retransmission sequence number information stored in storage section 216 is updated, and the retransmission control processing is performed. Complete.
- the received packet (13-7, 1-102) is originally a packet (12-87, 1-101) having a retransmission sequence number of 101. Therefore, the largest retransmission sequence number among the packets received continuously from the beginning, that is, “1-100” is passed to scheduler 213 with the retransmission ID of the received packet. Then, the retransmission ID and retransmission sequence number information “1-102” of the received packet are notified to storage section 216, and the retransmission sequence number information stored in storage section 216 is updated to complete the retransmission control processing. I do.
- the scheduler 213 having received the ACK information transmits an ACK packet including the passed ACK information via the input / output unit 202 to notify the transmitting node 101 that the packet has been received. I believe.
- retransmitting ID order checking section 221 extracts the ACK information.
- the retransmission ID and the retransmission sequence number received by the receiving node 102 are obtained from the ACK information, the retransmission ID and the retransmission sequence number are stored in the storage unit 216 as a packet whose arrival has been confirmed, and the retransmission ID and The packet corresponding to the retransmission sequence number is deleted from the queue 215 for each retransmission ID.
- the packet is stored in the storage unit 216 as a packet whose arrival has been confirmed, and the packet corresponding to the retransmission ID and retransmission sequence number is deleted from the queue 215 for each retransmission ID. Subsequently, when the same content "1-100" is received, the packet corresponding to "1-101", which is the number following the retransmission sequence number, is regarded as lost and retransmitted. That is, when the same retransmission sequence number comes twice consecutively, retransmission is performed on the assumption that the packet corresponding to the number following the retransmission sequence number has been lost. The packet to be retransmitted is retransmitted with the same retransmission ID and retransmission sequence number as the retransmission ID and retransmission sequence number attached to the previously transmitted packet.
- the present invention is not limited to this example.
- the receiving node does not receive a packet with a continuous retransmission sequence number, only the missing retransmission sequence number is transmitted to the transmitting node as retransmission request information, and the missing retransmission
- a method in which the transmitting node transmits a packet corresponding to the sequence number is also conceivable.
- Example 2 of the present invention will be described.
- Embodiment 2 describes a case where there are a plurality of routes connecting a transmitting node and a receiving node.
- FIG. 5 is a configuration diagram in a case where there are a plurality of routes connecting the transmitting node and the receiving node.
- a transmitting node 301 a transmitting node 301, a receiving node 302, and M paths connecting the nodes.
- 312—1— 312—M Route 312-1-312-M is a packet communication network such as the Internet.
- the case where there are a plurality of M routes is a case where both the transmission node 301 and the reception node 302 or one of the nodes has a plurality of communication interfaces.
- M s Xt.
- a flow is identified by identifying a socket 401, which is an API for an application, an input / output unit 402-1-1402-M, a port number to be used, and a destination address'port number.
- a flow identification unit 411 for assigning a flow to a queue a flow identification unit 422 for assigning a flow to each identifier queue from a flow ID, queues 412, 424 for holding a bucket for each identified flow, and queues for each flow.
- a scheduler 413 that selects and transmits packets to be transmitted from among them, a retransmission control unit 414 that attaches a retransmission ID at the time of packet transmission, holds each retransmission ID in a retransmission queue, and prepares for retransmission, and a retransmission that holds a packet for each retransmission ID
- a queue 415 a storage unit 416 for storing information such as delay and delay dispersion for each route, and sequence number information for each flow and each retransmission ID;
- a retransmission ID order check unit 421 that checks the retransmission ID of the packet to check the power of arrival of the packets in order, and a packet for which the order of the packets in the per-flow queue is uniform is transferred. It comprises a flow order check unit 423 for checking a queue for each flow.
- the input / output units 402-1-402-M are logical ones corresponding to the routes 312-1-1312-M, and the number of physical communication interfaces of the transmission node 301 is M. Is limited Les ,.
- the receiving node 302 is the same as the transmitting node 301.
- the operation of the second embodiment is almost the same as the operation of the first embodiment, but the processes of the scheduler and the retransmission control unit are different because there are a plurality of routes.
- the operation of the different parts is described below.
- the scheduler 413 determines the transmission timing of the packet to be transmitted, determines the queue for transmitting the packet to the receiving node 302 from the per-flow queue 412 at the transmission timing, and extracts the packet from the corresponding queue. Further, the scheduler 413 determines which of the routes 312-1-312-M is to be used based on the third criterion regarding the route selection.
- the scheduler 413 passes the extracted packet to the retransmission control unit 414 together with the information on the path to be used, in order to perform processing necessary for retransmission.
- Retransmission control section 414 determines retransmission ID and retransmission sequence number to be added to the transmission packet with reference to storage section 416, and stores the packet in a predetermined queue of retransmission queue 415.
- the information of the storage unit 416 that determines the retransmission ID for the transmission packet is, for example, the information shown in the route and retransmission ID table portion of FIG.
- the number of retransmission IDs has a one-to-one correspondence with the number of input / output units equal to the number of input / output units, M.
- the second flow indicates a packet group in units of the retransmission ID.
- the retransmission control unit 414 notifies the scheduler 413 of the determined retransmission ID and retransmission sequence number.
- the flow ID and the flow sequence number unique to the flow are added as unique headers, and the packet is sent to the receiving node 302 using one of the input / output units 402-1-1402-M according to the selection made earlier. Send.
- the format of the transmission packet at this time is, for example, as shown in FIG.
- Scheduler 413 transmits ACK information including the retransmission ID and the retransmission sequence number to transmitting node 301. If a transmission data packet exists at the timing of transmitting the ACK packet, information is added to the header of the data packet without generating an independent ACK packet. You can also burn calories.
- a packet is transmitted to the transmission node 301 at an appropriate timing using one of the input / output units 402-1-402-M. As a third criterion, for example, there is a method of selecting a route with the least load based on the load status of each route.
- the scheduler 413 retransmits the passed packet at any timing from any of the input / output units 402-1 402-M. At this time, the scheduler 413 can select a transmission path based on the third criterion independently of the path that previously transmitted the same packet.
- a plurality of packets belonging to one flow are generally distributed to different routes by the scheduler 413 of the transmission node. If the delay and rate of each path fluctuate independently, there is a limit to the cancellation of the delay difference between paths by the scheduler, and it is difficult to completely cancel the jitter between paths especially when a wireless link with low stability is included. ,.
- the packet arrival order at the reception node reflects the transmission order at the transmission node. For example, suppose that packet A belonging to a certain flow is transmitted from path 312-1 and then packet B belonging to the same flow and having a sequence number higher than packet A is transmitted from path 312-2. At this time, it is assumed that B is received before A at the receiving node where the delay of path A is larger than expected by the scheduler.
- Example 3 of the present invention will be described.
- the arrangement of the nodes and the functional configuration of the nodes are all the same as those in the second embodiment. However, only the process of determining the retransmission ID for the transmission packet in the transmission node is different. explain.
- the route and the retransmission ID do not correspond one-to-one, and can be changed freely.
- the order of arrival of packets when the receiving node receives packets may be significantly disrupted, depending on the delay of each route belonging to that retransmission ID.
- an algorithm is described that determines a plurality of routes belonging to one retransmission ID so that the probability that the arrival order of packets belonging to one retransmission ID is incorrect is below a certain value.
- Each path between the transmission node 301 and the reception node 302, 312-1-1-312-M, is always measured for one-way or round-trip delay time and delay dispersion. Map the route and retransmission ID. The timing is, for example, at regular time intervals or when the route information is updated. As a mapping method, for example, the retransmission ID is mapped to the route 312-1-312-M by an algorithm as shown in FIG.
- the delay and delay dispersion of the route (i + j) and the delay dispersion of the route i are obtained (step A004).
- the route (i + j) is optional until the packet of the route i to arrive first arrives. Check that the probability that a certain number of packets arrive first can be suppressed to a certain level. (Step A005).
- an arbitrary number of transmitting nodes 501-1 501-L, a transmitting-side transfer node 502, a receiving Tsukuda J-transfer node 503, and an arbitrary number of receiving nodes 504-1-504- N force, ranaru are linked as follows.
- Each transmitting node is connected to a transmitting-side forwarding node by a path 511-1-1511-L.
- the transmitting side forwarding node and the receiving side forwarding node are connected by one or more arbitrary number of paths 512-1 to 512-M.
- Each receiving node is connected to the receiving-side forwarding node via route 513-1-513-N.
- route 513-1-513-N For example, when the number of routes M between the transmitting-side forwarding node and the receiving-side forwarding node is 1, this is the same as in the first embodiment.
- the process is the same as in the second embodiment and the third embodiment.
- the transmitting node in the first, second, and third embodiments is a transmitting-side transfer node
- the receiving node is a receiving-side transfer node.
- the socket in the configuration on the transmitting side transfer node is an input unit for packets received from the transmitting node
- the socket in the configuration on the receiving side transfer node is an output unit for packets transmitted to the receiving node.
- the first flow performs communication between the transmitting node 501-1-501-L and the receiving node 504-1-504-N of the receiving node as a source, destination address, and port. Refers to a packet group uniquely determined by a number.
- Example 5 of the present invention will be described.
- the fifth embodiment is a case where the schedulers 213 and 413 shown in the second, third, and fourth embodiments perform a route selection operation according to the following third criterion.
- the schedulers 213 and 413 shown in the second, third, and fourth embodiments perform a route selection operation according to the following third criterion.
- the receiving node has a high probability of receiving the packets in the order expected by the sending node, so that the retransmission frequency due to the incorrect order is increased.
- the degree can be reduced.
- the present invention is applied to a configuration in which nodes are connected by a plurality of paths as in the third embodiment and the fourth embodiment which is an application thereof, more communication paths are used as one retransmission unit. Communication performance can be improved because retransmission control can be applied.
- the third criterion is to select the most appropriate route, for example, the route predicted to be the earliest arrival time, based on the predicted arrival time or reception completion time of the data. .
- the transmission history of the transmission data (packets) is recorded.
- the transmission history describes an identifier for identifying transmission data (packet), a transmission start time, and the like.
- the state information for example, speed and packet delay
- the path state information includes information for identifying the latest data (packet) to which the path state information is applied, such as the data (packet) identifier described above.
- the transmitting side receives the status information of the route, and, based on information (for example, an identifier) for identifying the data (packet) included in the route status, the transmitted data (packet) for which the route status is valid. ) Is obtained from the transmission history. Then, for the data after the obtained data (packet), the reception completion time and the like are predicted by applying the status of the received route, and further based on the prediction and the received route status information, Predict the arrival time or reception completion time of the data to be transmitted.
- information for example, an identifier
- the reception completion time and the like are predicted by applying the status of the received route, and further based on the prediction and the received route status information, Predict the arrival time or reception completion time of the data to be transmitted.
- the most appropriate route for example, the route predicted to have the earliest arrival time is selected based on the predicted arrival time or reception completion time of the data.
- the path state information indicates general information that is an index of communication performance.
- the speed of the route and the packet delay are used.
- the path state information is valid, it means when the path state information is updated on the transmitting node side.
- Various methods have been proposed for the receiving node to measure the speed and delay in order to obtain the path state information. The methods assumed are described below.
- the transmitting node inserts an identifier and a transmission time into each of the packets to the receiving node and transfers them.
- the receiving node measures the packet delay by comparing the transmission time inserted by the transmitting node with the time it received.
- the transmitting node periodically transmits a packet sequence for measurement, and the receiving node can estimate the speed from the variation in the arrival time.
- the transmitting node transmits two packets simultaneously, and the transmitting side estimates the link speed from the arrival time difference between the two packets. It is the transmission delay that widens the packet arrival interval. Since the transmission delay is related to the link speed, the speed can be estimated from the arrival interval.
- the receiving node periodically transmits these measured values or estimated values to the transmitting node as path state information. Also, the identifier of the latest packet received up to that time is simultaneously transmitted as the identification information of the packet for which the status information to be transmitted is valid. This information is received at the sending node as a report.
- the above method is an example, and the practicability of the present invention does not depend on the path state information and the method of determining and transmitting a packet in which the path state information is valid.
- the scheduler 213 or 413 refers to the report of the route information and the like received up to the present for each transmission route for the packet to be transferred next and the transmission history after transmission of the packet for which the information is valid.
- the transmission history for estimating the arrival delay at the receiving node is stored in the storage unit 216 or 416.
- the scheduler 213 or 413 selects the route having the smallest predicted arrival delay as the transmission route of the packet to be transferred next, and after transferring the packet to the selected route, stores the transfer time in the storage unit 216 or 416. Add to transmission history.
- FIG. 11 shows a scheduler operation example as an example of an arrival delay estimating method for each route operated by the scheduler 213 or 413.
- 600-1, 600-2, and 600-3 are data packets.
- the transmission history and prediction at the transmitting node and the reception history and prediction at the receiving node are shown on the time axis. It is shown.
- the transmission of the data packet 600-1 is started at the transmission node at time T1, and the transmission is completed at time T2.
- the reception of the same packet 600-1 is started at the receiving node at time T3 and completed at time T4.
- the difference II between T1 and T3 is the transmission delay.
- the difference 12 between T4 and T2 is the total delay obtained by adding the packet dispersion caused by the transmission interface II and the speed difference between the transmission path and the transmission delay II.
- packet 600-3 is to be transmitted at the current time of the TP on the time axis. Then, for this route, upon receipt of the report result notification between T5 and TP, the route status information held by the transmitting node is updated, and the packets for which this route status information is valid are from 600-1. I do. Therefore, based on the transmission history of the packets 600-1 and 600-2 for which the path state information is valid, the reception completion time of the packet 600-3 is estimated in consideration of the packets 600-1 and 600-2.
- the reception start time and the completion time at the receiving node of the packet 600-2 transmitted after the packet 600-beam are estimated from the speed and the transmission delay included in the currently received path state information.
- the estimated reception start time is T5 in Fig. 11, and the reception completion time is $ 7.
- the reception of the packet 600-3 started to be transmitted to the TP should start at time # 6.
- the estimated reception start time of packet 600-3 is estimated to be the completion of reception of packet 600-2.
- the estimated reception completion time of packet 600-3 is T8, which is the sum of the packet dispersion estimated from the path speed included in the currently received path state information. Similarly, the reception completion time of the packet 600-3 is estimated for each route, and the packet 600-3 is sent out on the route having the earliest time.
- the path state information used for estimating the arrival time of the receiving side at the time of the TP in Fig. 11 has been updated between T5 and the TP by receiving the report result notification. Then, the arrival time estimation when transmitting the packet 600-2 is performed based on the older route state information in the TP. Assuming that the old state information is information A and the new information updated between T5 and TP is information B, if the delays and path speeds included in information A and information B differ due to link state fluctuations, information A The arrival time prediction based on the information must have been different from the arrival time prediction based on the information B shown in FIG. Therefore, in order to make a more accurate prediction, the arrival time predictions of the packets 600-1 and 600-2 shown in FIG. Once the route status information is updated, the transmission history before the packet for which the update is valid becomes unnecessary, and is discarded.
- 500-1, 500-2, and 500-3 are data packets to be transmitted.
- the packet transmission history (solid line) at the transmitting node and the actual packet reception at the receiving node are shown.
- the histories (solid lines) are shown on the time axis.
- the prediction of the arrival and reception completion times of the packet (dotted line) is also shown on the time axis.
- the curve shown at the top of FIG. 18 shows the speed change of the transmission path.
- FIG. 18 shows that the transmission speed decreases as time passes.
- the transmission of the data packet 500-3 is started from the transmitting node at time T9, and the transmission is completed at time T10. Then, on the receiving node side, the reception of the data packet 500-3 is started from the time IJT14, and the reception is completed at the time T16.
- the transmission of the data packet 500-1 is started at the transmission side node at time T1, together with the information on the transmission time and the packet identifier of the data packet 500-1, and the transmission is completed at time T2. .
- the transmitting node stores the transmission time and packet identifier of the data packet 500-1 as the transmission history.
- the transmitting node starts transmission of the data packet 500-2 at time T4 together with the transmission time of the data packet 500-2 and the information of the packet identifier, and completes the transmission at time T8. I have. At this time, the transmitting node stores the transmission time and the packet identifier of the data packet 500-2 as the transmission history, as described above. [0218] On the receiving node side, reception of data packet 500-1 starts at time T3, and has been completed at time T5. At this time, the receiving node transmits information such as the identifier of the data packet 500-1, the reception completion time and the communication speed to the transmitting node as a report.
- the transmitting node predicts the arrival time and the reception completion time of data packet 500-3 based on the transmission history after time T1.
- the target data packets are data packet 500-1 and data packet 500-2.
- the reception completion time of the data bucket 500-1 is known from the report as time T5.
- the communication speed and reception completion time of the data packet 500-1 in the report are used. You can see the delay time.
- the transmission delay is the difference II between T1 and T3.
- the total packet delay is the time obtained by adding the packet dispersion caused by the transmission delay II and the speed difference between the transmission interface and the transfer path, and is the difference 12 between T5 and T2.
- the arrival time of the data packet 500-2 is obtained from the transmission delay II, and is predicted to be the time T6 obtained by adding the transmission delay II to the transmission time T4 of the data packet 500-2.
- the reception completion time of the data packet 500-2 can be calculated based on the communication speed of the report, so that the reception completion time of the data packet 500-2 can be predicted to be time T12. Therefore, in this route, the arrival time of the receiving node of the data bucket 500-3 can be predicted to be after time T12.
- the reception completion time when reception is started from time T12 can be predicted to be time T15 by the above-described packet dispersion prediction. According to the result of such prediction, the difference between the predicted arrival time T12 of the data packet 500-3 and the actual arrival time T14 of the data packet 500-3 is the time ID1.
- the route state indicated by the report is valid at the arrival time of the report obtained from the reception node, and the data packet 500 For the forecast of -3, the route condition shown in the report is applied as it is. That is, in estimating the arrival time of the data packet 500-3, It is predicted to be the time Ti l at which the transmission delay II is added to the transmission time T9 of the data packet 500-3. According to such a prediction result, the difference between the predicted arrival time T11 of the data packet 500-3 and the actual arrival time T14 of the data packet 500-3 is the time ID2.
- FIG. 12 shows a procedure of the route selection of the scheduler including the arrival time estimation as described above.
- the packet is received by the queuing unit 312 (Step 100).
- Step 101 it is determined whether the route status information has been updated since the last packet was transmitted from that route. If the route status information is updated, the transmission history before the route status information becomes valid is deleted for all the updated routes (Step 102).
- the arrival time of the packet is predicted (estimated) based on the route state information and the transmission history (Step 103). Then, the packet is transmitted to the route with the earliest predicted (estimated) arrival time (Step 104).
- the state of the route may be already changed by the time when the transmitting node acquires certain state information, so the information is trusted. It's enough. Therefore, it is impossible to optimally select the route and set the timing at the time of transmitting the packet, and the packet is generally transmitted on a non-optimal route and timing. Correcting the arrival time prediction at the time of updating the status information means that the impact of the already performed non-optimal transmission will take a time equal to the interval of the status information update. It is equivalent to estimating from the beginning. For example, if the previous transmission was performed at a too high rate, the estimated arrival time of the transmitted packet is extended by updating the status information, and the transmission cost of the route is increased.
- the correction of the prediction of the arrival time of the past transmission packet by updating the state information has the effect of optimizing the route selection.
- the correction of the prediction of the arrival time is fed back to the transmission timing control as well as the route selection. Then, the congestion control of each route is also optimized in a long term.
- the reception completion time of a transmission packet is estimated for each route and the route with the highest evaluation value is selected, as in the above-described embodiment. It is also possible to introduce a simple timing control in which the transmitting node controls the transmission timing so that the estimated delay does not exceed that value. The operation of this embodiment will be described with reference to FIG.
- the permissible estimated delay is denoted by TM.
- TM the permissible estimated delay
- the packet must be estimated to have been received by TM + TP.
- T8 which is later than TM + TP. Therefore, the transmitting node 100 cannot transmit the packet 400-3 from this route until the estimated reception completion time STM + TP is reached. In this case, the transmitting node 100 holds the packet 400-3 until the estimated reception completion time of any of the routes is equal to or less than TM + TP, and transmits this packet from the route that can release the hold first.
- FIG. 14 shows the scheduling operation in the above embodiment.
- a packet is received by queuing section 312 (Step 200).
- Step 201 it is determined whether the route status information has been updated since the last packet was transmitted from that route.
- the route status information is updated, the transmission history before the route status information becomes valid is deleted in all the updated routes (Step 202).
- the arrival time of the packet is predicted (estimated) based on the route state information and the transmission history (Step 203). Then, using the predicted (estimated) arrival time, then, for all routes, it is determined whether (predicted (estimated) arrival time)> (current time + allowable estimated delay) (Step 204), and (predicted (estimated) arrival time) ⁇ ( If it is the current time (IJ + allowable estimated delay), the predicted (estimated) arrival time of those routes is the earliest, and the packet is transmitted to the route (Step 205).
- Step 206 If (predicted (estimated) arrival time)> (current time + allowable estimated delay) for all routes, the current time of one of the routes is (predicted arrival time-allowable estimated delay). ), And if any one of the routes satisfies the condition, the process proceeds to Step 205 (Step 206).
- the value of the allowable delay TM may be set independently for each path. For example, when the delay of each route or the buffer size of the server to pass through greatly differs, it is considered that the bandwidth of each route can be effectively used by setting the TM setting differently for each route, especially under high load.
- the route selection may be evaluated with priority given thereto.
- the method of judgment may differ depending on the attribute of the data to be sent. For example, for voice data, delay is selected, for urgent data, and for file transfer data, selection is made with emphasis on the line usage fee.
- the feature of the present embodiment is that, in any case, when the transmitting node updates the route state information, the transmitting node simultaneously acquires the transmission packet or time at which the update is valid, and acquires the valid packet or the transmission history after the valid time. It is to estimate the impact on transmission cost more and transmit the next packet on the route with the lowest cost.
- the flow identification units 211 and 222 of the nodes, the scheduler 213, the retransmission control unit 214, and the retransmission ID are configured as separate units. All or a part of these units may be configured by a CPU or the like operated by a control program.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/526,959 US20060256803A1 (en) | 2004-01-09 | 2005-01-07 | Communication method |
EP20050703389 EP1705870B1 (en) | 2004-01-09 | 2005-01-07 | Communication method |
JP2005516898A JP4497322B2 (ja) | 2004-01-09 | 2005-01-07 | 通信方法 |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004-004795 | 2004-01-09 | ||
JP2004004795 | 2004-01-09 | ||
JP2004-260332 | 2004-09-07 | ||
JP2004260332 | 2004-09-07 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005067261A1 true WO2005067261A1 (ja) | 2005-07-21 |
Family
ID=34752104
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/000124 WO2005067261A1 (ja) | 2004-01-09 | 2005-01-07 | 通信方法 |
Country Status (5)
Country | Link |
---|---|
US (1) | US20060256803A1 (ja) |
EP (1) | EP1705870B1 (ja) |
JP (1) | JP4497322B2 (ja) |
KR (1) | KR100863539B1 (ja) |
WO (1) | WO2005067261A1 (ja) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007083687A1 (ja) * | 2006-01-23 | 2007-07-26 | Nec Corporation | 通信方法、通信システム、ノードおよびプログラム |
WO2008088145A1 (en) * | 2007-01-15 | 2008-07-24 | Kangnung National University Industrial Academy Corporation Group | Data transmitting and receiving method and communication system thereof |
JPWO2008029793A1 (ja) * | 2006-09-05 | 2010-01-21 | 日本電気株式会社 | パケット回復方法、通信システム、情報処理装置およびプログラム |
WO2011046056A1 (ja) * | 2009-10-14 | 2011-04-21 | 日本電気株式会社 | パケット通信の伝送制御方法及びパケット通信システム |
JP2011517384A (ja) * | 2008-02-26 | 2011-06-02 | クゥアルコム・インコーポレイテッド | 無線通信システムにおけるリンク制御のための方法および装置 |
WO2011108480A1 (ja) * | 2010-03-03 | 2011-09-09 | 日本電気株式会社 | パケット再送制御システム、方法、及びプログラム |
JP2011182234A (ja) * | 2010-03-02 | 2011-09-15 | Oki Electric Industry Co Ltd | 通信装置及び通信制御方法 |
Families Citing this family (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070070895A1 (en) * | 2005-09-26 | 2007-03-29 | Paolo Narvaez | Scaleable channel scheduler system and method |
US7551579B2 (en) | 2006-05-08 | 2009-06-23 | Skyhook Wireless, Inc. | Calculation of quality of wlan access point characterization for use in a wlan positioning system |
US8014788B2 (en) * | 2006-05-08 | 2011-09-06 | Skyhook Wireless, Inc. | Estimation of speed of travel using the dynamic signal strength variation of multiple WLAN access points |
US7835754B2 (en) | 2006-05-08 | 2010-11-16 | Skyhook Wireless, Inc. | Estimation of speed and direction of travel in a WLAN positioning system |
US7551929B2 (en) * | 2006-05-08 | 2009-06-23 | Skyhook Wireless, Inc. | Estimation of speed and direction of travel in a WLAN positioning system using multiple position estimations |
US8144673B2 (en) | 2006-07-07 | 2012-03-27 | Skyhook Wireless, Inc. | Method and system for employing a dedicated device for position estimation by a WLAN positioning system |
JP2008098798A (ja) * | 2006-10-10 | 2008-04-24 | Nec Corp | 通信システムにおけるデータ伝送状況判定方法および通信装置 |
US8923141B2 (en) * | 2007-03-16 | 2014-12-30 | Cisco Technology, Inc. | Providing clock synchronization in a network |
US9686045B2 (en) * | 2007-04-04 | 2017-06-20 | Lantiq Beteiligungs-GmbH & Co. KG | Data transmission and retransmission |
US20080248741A1 (en) * | 2007-04-05 | 2008-10-09 | Farshid Alizadeh-Shabdiz | Time difference of arrival based estimation of direction of travel in a wlan positioning system |
US20080248808A1 (en) * | 2007-04-05 | 2008-10-09 | Farshid Alizadeh-Shabdiz | Estimation of position, speed and bearing using time difference of arrival and received signal strength in a wlan positioning system |
JP5205819B2 (ja) * | 2007-06-06 | 2013-06-05 | 日本電気株式会社 | 通信システムおよびそのパケットスケジューリング方法ならびに送信ノード |
EP2066101B1 (en) * | 2007-11-28 | 2012-10-17 | Alcatel Lucent | System and method for an improved high availability component implementation |
KR101039550B1 (ko) | 2008-06-10 | 2011-06-09 | (주)씨디네트웍스 | 데이터 전송률 계산 방법 및 이를 이용한 대역폭 설정 방법 |
JP2010033188A (ja) * | 2008-07-25 | 2010-02-12 | Fujitsu Ltd | 送信経路選択装置、データ送信システム、コンピュータ装置および送信経路選択方法 |
JP5308802B2 (ja) * | 2008-12-16 | 2013-10-09 | ルネサスエレクトロニクス株式会社 | Canノード |
ES2359522B1 (es) * | 2008-12-18 | 2012-04-02 | Vodafone España, S.A.U. | Procedimiento y estación base de radio para planificar tr�?fico en redes telefónicas celulares de �?rea amplia. |
US20100306442A1 (en) * | 2009-06-02 | 2010-12-02 | International Business Machines Corporation | Detecting lost and out of order posted write packets in a peripheral component interconnect (pci) express network |
US9276870B2 (en) * | 2010-07-09 | 2016-03-01 | Telefonaktiebolaget L M Ericsson (Publ) | Switching node with load balancing of bursts of packets |
CN102404166B (zh) * | 2011-10-27 | 2015-04-08 | 华为技术有限公司 | 丢包检测方法和系统、发送设备及接收设备 |
US9614646B2 (en) * | 2015-03-20 | 2017-04-04 | Vmware, Inc. | Method and system for robust message retransmission |
EP3703336A4 (en) * | 2017-11-17 | 2020-10-21 | Ntt Docomo, Inc. | COMMUNICATION DEVICE AND PROCESS |
US10785271B1 (en) * | 2019-06-04 | 2020-09-22 | Microsoft Technology Licensing, Llc | Multipoint conferencing sessions multiplexed through port |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH08288949A (ja) * | 1995-04-12 | 1996-11-01 | Nippon Telegr & Teleph Corp <Ntt> | 情報転送システム |
JPH10243050A (ja) * | 1997-02-28 | 1998-09-11 | Mitsubishi Electric Corp | データ通信システム |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5594490A (en) * | 1994-05-23 | 1997-01-14 | Cable Services Technologies, Inc. | System for distributing video/audio files from central location to a plurality of cable headends |
US6512761B1 (en) * | 1999-02-02 | 2003-01-28 | 3Com Corporation | System for adjusting billing for real-time media transmissions based on delay |
US7024222B2 (en) * | 1999-09-21 | 2006-04-04 | Ipr Licensing, Inc. | Dual mode unit for short range, high rate and long range, lower rate data communications |
US7327683B2 (en) * | 2000-03-16 | 2008-02-05 | Sri International | Method and apparatus for disseminating topology information and for discovering new neighboring nodes |
JP4475835B2 (ja) * | 2001-03-05 | 2010-06-09 | 富士通株式会社 | 入力回線インタフェース装置及びパケット通信装置 |
US20030103459A1 (en) * | 2001-11-16 | 2003-06-05 | Connors Dennis P. | Method and implementation for a flow specific modified selective-repeat ARQ communication system |
US7239608B2 (en) * | 2002-04-26 | 2007-07-03 | Samsung Electronics Co., Ltd. | Router using measurement-based adaptable load traffic balancing system and method of operation |
DE60230436D1 (de) * | 2002-12-23 | 2009-01-29 | Alcatel Lucent | Überlastkontrolle in einem optischen Netzwerk mit Burstschaltung |
DE60311155T2 (de) * | 2003-08-19 | 2007-10-18 | Ntt Docomo Inc. | Genaue steuerung von informationsübertragungen in ad-hoc netzwerken |
US6826123B1 (en) * | 2003-10-14 | 2004-11-30 | International Business Machines Corporation | Global recovery for time of day synchronization |
-
2005
- 2005-01-07 KR KR20067013548A patent/KR100863539B1/ko not_active IP Right Cessation
- 2005-01-07 JP JP2005516898A patent/JP4497322B2/ja not_active Expired - Fee Related
- 2005-01-07 EP EP20050703389 patent/EP1705870B1/en not_active Not-in-force
- 2005-01-07 WO PCT/JP2005/000124 patent/WO2005067261A1/ja not_active Application Discontinuation
- 2005-01-07 US US10/526,959 patent/US20060256803A1/en not_active Abandoned
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH08288949A (ja) * | 1995-04-12 | 1996-11-01 | Nippon Telegr & Teleph Corp <Ntt> | 情報転送システム |
JPH10243050A (ja) * | 1997-02-28 | 1998-09-11 | Mitsubishi Electric Corp | データ通信システム |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4780343B2 (ja) * | 2006-01-23 | 2011-09-28 | 日本電気株式会社 | 通信方法、通信システム、ノードおよびプログラム |
WO2007083687A1 (ja) * | 2006-01-23 | 2007-07-26 | Nec Corporation | 通信方法、通信システム、ノードおよびプログラム |
JPWO2007083687A1 (ja) * | 2006-01-23 | 2009-06-11 | 日本電気株式会社 | 通信方法、通信システム、ノードおよびプログラム |
JP5131194B2 (ja) * | 2006-09-05 | 2013-01-30 | 日本電気株式会社 | パケット回復方法、通信システム、情報処理装置およびプログラム |
JPWO2008029793A1 (ja) * | 2006-09-05 | 2010-01-21 | 日本電気株式会社 | パケット回復方法、通信システム、情報処理装置およびプログラム |
US9379852B2 (en) | 2006-09-05 | 2016-06-28 | Nec Corporation | Packet recovery method, communication system, information processing device, and program |
WO2008088145A1 (en) * | 2007-01-15 | 2008-07-24 | Kangnung National University Industrial Academy Corporation Group | Data transmitting and receiving method and communication system thereof |
JP2011517384A (ja) * | 2008-02-26 | 2011-06-02 | クゥアルコム・インコーポレイテッド | 無線通信システムにおけるリンク制御のための方法および装置 |
WO2011046056A1 (ja) * | 2009-10-14 | 2011-04-21 | 日本電気株式会社 | パケット通信の伝送制御方法及びパケット通信システム |
JP2011182234A (ja) * | 2010-03-02 | 2011-09-15 | Oki Electric Industry Co Ltd | 通信装置及び通信制御方法 |
WO2011108480A1 (ja) * | 2010-03-03 | 2011-09-09 | 日本電気株式会社 | パケット再送制御システム、方法、及びプログラム |
US8717871B2 (en) | 2010-03-03 | 2014-05-06 | Nec Corporation | Packet retransmission control system, method and program |
JP5682618B2 (ja) * | 2010-03-03 | 2015-03-11 | 日本電気株式会社 | パケット再送制御システム、方法、及びプログラム |
Also Published As
Publication number | Publication date |
---|---|
JP4497322B2 (ja) | 2010-07-07 |
US20060256803A1 (en) | 2006-11-16 |
JPWO2005067261A1 (ja) | 2007-12-27 |
EP1705870B1 (en) | 2012-08-29 |
KR20060116217A (ko) | 2006-11-14 |
KR100863539B1 (ko) | 2008-10-15 |
EP1705870A1 (en) | 2006-09-27 |
EP1705870A4 (en) | 2010-10-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4497322B2 (ja) | 通信方法 | |
US8098648B2 (en) | Load distributing method | |
JP6275751B2 (ja) | 改善された確認応答および再送機構 | |
WO2018210117A1 (zh) | 一种拥塞控制方法、网络设备及其网络接口控制器 | |
CN107113204B (zh) | 用于在网络中路由数据包的节点、网络控制器和相关方法 | |
JP4632874B2 (ja) | 通信端末 | |
US8717871B2 (en) | Packet retransmission control system, method and program | |
JPWO2005067227A6 (ja) | 負荷分散方法、ノード及び制御プログラム | |
US20130194923A1 (en) | Converged enhanced ethernet network | |
EP2978171B1 (en) | Communication method, communication device, and communication program | |
CN102859950A (zh) | 估计拥塞的方法 | |
WO2008029793A1 (fr) | Procédé de récupération de paquets, système de communication, dispositif de traitement d'informations et programme | |
JP4924285B2 (ja) | 通信装置、通信システム、転送効率向上方法及び転送効率向上プログラム | |
US20100008350A1 (en) | Method and device of transmitting and parsing data in wireless communication network | |
CN101009649A (zh) | 网络处理器中的队列管理 | |
CN102801606A (zh) | 一种sctp主路径自动切换方法 | |
JPWO2011046056A1 (ja) | パケット通信の伝送制御方法及びパケット通信システム | |
WO2005086436A1 (ja) | パケット転送装置、パケット転送ネットワークシステム、および、端末装置 | |
JP5738324B2 (ja) | 送信装置、通信装置、通信システムおよび送信方法 | |
US20120106344A1 (en) | Data communication acknowledgement in a network | |
JP2017092692A (ja) | データ伝送制御システム及び方法、並びに、データ伝送制御プログラム | |
CN109450606A (zh) | 数据传输管控方法及装置 | |
JP4930275B2 (ja) | 通信システム、通信方法、送信機、受信機、レート計算方法およびプログラム | |
JP2010206608A (ja) | 送信装置、送信レート算出方法及び送信レート算出プログラム | |
Santhi et al. | Active Queue Management Algorithm for TCP Networks Congestion Control |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
ENP | Entry into the national phase |
Ref document number: 2005526959 Country of ref document: US Kind code of ref document: A |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2006256803 Country of ref document: US Ref document number: 10526959 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2005516898 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200580001934.6 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020067013548 Country of ref document: KR |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2005703389 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: DE |
|
WWP | Wipo information: published in national office |
Ref document number: 2005703389 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020067013548 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 10526959 Country of ref document: US |