WO2007111331A1 - 通信方法、ノード及び制御プログラム - Google Patents
通信方法、ノード及び制御プログラム Download PDFInfo
- Publication number
- WO2007111331A1 WO2007111331A1 PCT/JP2007/056382 JP2007056382W WO2007111331A1 WO 2007111331 A1 WO2007111331 A1 WO 2007111331A1 JP 2007056382 W JP2007056382 W JP 2007056382W WO 2007111331 A1 WO2007111331 A1 WO 2007111331A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- route
- node
- packets
- congestion
- packet
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/122—Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
Definitions
- the present invention relates to a communication method, a node, and a control program, and more particularly to a communication method, a node, and a control program for multiplexing communication of a plurality of paths.
- Non-Patent Document 1 As a known example of a technique for multiplexing a plurality of communication paths to form one logical broadband link, a method for multiplexing only terrestrial communication paths is described in Non-Patent Document 1.
- PPP and the demultiplexing method in ATM described in Non-Patent Document 2 are known, and the demultiplexing technique described in Non-Patent Document 2 is known as a method for multiplexing a radio link. ing. Both of these provide a wideband forwarding link that exceeds the bandwidth of a single path by distributing the load among the paths.
- Non-Patent Document 3 describes a load distribution technique assuming radio link multiplexing. This technique is a method of selecting a transmission path based on the transmission buffer margin of each link, as in the demultiplexing method. However, this method is also effective only when the sending node is directly connected to the bottleneck link and the load on the bottleneck link can be estimated from the margin of the send buffer. However, there is a problem that cannot be applied to two-way communication.
- Non-Patent Document 1 RFC1990
- Non-Patent Document 3 Manabu Tsujimura, Naoki Imai, Takahito Yoshihara, Hironori Horiuchi, "Performance Evaluation of Demultiplexing Method of Heterogeneous Communication Media for Mobile Routers", FIT2004 (3rd Information Science and Technology Forum), Paper M -070, pp.239-240 (2004)
- Patent Document 4 Cisco systems, Load Balancing with Cisco express Forwarding, and is co Application Note, Jan. 1998
- Non-Patent Document 5 T. Nakata et al., "Efficient bundling of heterogeneous radio resources for broadband Internet access from moving vehicles, in proceedings of Global Mobil e Congress 2004, Oct. 11-13 2004, Shanghi, China.
- the load on each route can be made equal by using load balancing by the weighted round robin method of the prior art. If the delay is different, the overall delay of the multiplexed link is equal to the delay of the path with the longest delay. For this reason, the delay of the multiplexed link becomes larger than the route with a small delay among the routes to be multiplexed. As a result, there is a problem that the performance is improved while the bandwidth is expanded by multiplexing, while the delay is increased.
- the prior art has a problem that, when the paths having different delays are multiplexed, it is impossible to achieve both the optimal distribution of the load between the paths and the prevention of the increase in delay due to the multiplexing.
- the present invention was invented in view of the above problems, and its purpose is to provide a technique that can achieve both optimal distribution of loads between paths and prevention of delay increase due to multiplexing. There is to do.
- a first invention for solving the above-described problem is a communication method between two nodes that can use a plurality of paths including at least a first path and a second path, and is configured to reduce congestion of the second path. If two or more packets arrived at the first node are predicted or detected, the second packet with the later arrival time is transmitted from the first route, and then the first packet with the earlier arrival time is It is characterized by transmitting from a route.
- the transmission of the first packet from the second route is predicted or detected to eliminate congestion of the second route. Then, it is characterized by force.
- a third invention for solving the above-mentioned problems is characterized in that, in the first or second invention, the prediction of congestion or prediction of elimination of congestion is determined based on a transmission history of each route.
- a fourth invention for solving the above-mentioned problems is characterized in that, in the first or second invention, the prediction of congestion or the prediction of elimination of congestion is determined based on an estimated speed of each route.
- a fifth invention for solving the above-mentioned problem is a communication method between two nodes that can use a plurality of routes including a first route and a second route, and arrives at the first node. Multiple packets When transmitting to the second node, the estimated arrival time of the plurality of packets to the second node from the estimated delay and speed of each path is determined by the first node of the plurality of packets. Packets that are predicted to arrive at the second node without causing congestion on each of the plurality of packets, so that the transmission routes of the plurality of packets are determined to be equal to the order of the arrival times Is transmitted to the determined transmission path.
- a sixth invention for solving the above-mentioned problems is characterized in that, in the fifth invention, the predicted arrival time or the congestion is determined based on a transmission history of each route.
- a seventh invention for solving the above-mentioned problems is characterized in that, in the fifth invention, the predicted arrival time or the congestion is determined based on an estimated speed of each route.
- An eighth invention for solving the above-described problem is a node that can use a plurality of paths including at least a first path and a second path, and is based on an estimated value of delay and speed of each path. Then, a predicted arrival time of the received plurality of packets to the other node is obtained, and based on the predicted arrival time, the arrival order of the other nodes of the plurality of packets becomes equal to the arrival order of the plurality of packets. As described above, it has means for determining a transmission path of the plurality of packets.
- a tenth invention for solving the above-mentioned problem is characterized in that, in the above-mentioned eighth or ninth invention, the predicted arrival time or the congestion is determined based on a transmission history of each route.
- An eleventh invention for solving the above-mentioned problems is characterized in that, in the above-mentioned eighth or ninth invention, the predicted arrival time or the congestion is determined based on an estimated speed of each route.
- a twelfth invention for solving the above-described problem is a control program for a node that can use a plurality of paths including at least a first path and a second path, and estimates delay and speed of each path. Based on the value, a predicted arrival time of the received plurality of packets to the other node is obtained, and based on the predicted arrival time, the arrival order of the other nodes of the plurality of packets is The node is caused to execute processing for determining a transmission route of the plurality of packets so that the arrival order of the plurality of packets is equal.
- a fourteenth invention for solving the above-mentioned problems is characterized in that, in the above twelfth or thirteenth invention, the estimated arrival time or the congestion is determined based on a transmission history of each route.
- a fifteenth invention for solving the above-mentioned problems is characterized in that, in the above-mentioned twelfth or thirteenth invention, the predicted arrival time or the congestion is determined based on an estimated speed of each route.
- the estimated transmission route of each packet to be transmitted is estimated from the estimated delay and speed of each route, and the order of the predicted arrival time at the receiving node is determined. It is determined to be equal to the order of the time of arrival at the transmitting node, and only packets that are expected to arrive within the maximum delay allowed for each path are transmitted.
- the prediction delay of the second route with the fastest prediction delay of the slow first route among the routes to be multiplexed If the predicted delay of the second route exceeds the maximum delay, packet 2 is sent to the first route, and the congestion status of the second route (the predicted delay exceeds the maximum delay) ) Is resolved and packet 1 is transmitted from the second route.
- the order of packet transmission from the sending node is different from the order of arrival at the sending node, but the order of arrival at the receiving node is the order of arrival at the sending node, packet 1 first and packet 2 later.
- both packets 1 and 2 arrive with a delay equal to or less than that when only high-speed route 2 is used, and the load is distributed to both routes 1 and 2.
- FIG. 1 is a block diagram of an embodiment.
- FIG. 2 is a block diagram of an embodiment.
- FIG. 3 is an operation flowchart (SDL process graph) of the scheduling unit 202.
- FIG. 4 is an operation flowchart (SDL process graph) followed by the route selection unit 203.
- FIG. 5 is a diagram for explaining the embodiment.
- FIG. 6 is a diagram for explaining the embodiment.
- This embodiment is implemented between two nodes that communicate using a plurality of communication paths.
- the communication node 101 has one packet transmission unit 204 and one packet reception unit 206
- the communication node 102 has two packet transmission units 204 and two packet reception units 206.
- the route from node 101 to node 102 starts from packet transmission unit 204 of node 101, passes through network 400, and ends at packet reception unit 206-1 of node 102, and packet transmission of node 101
- the route to the node 102 and the node 101 includes a route starting from the packet transmission unit 204-1 of the node 102, the route starting from the packet reception unit 206 of the node 101 via the network 400, and a packet transmission of the node 102.
- the packet transmission / reception unit of the node 101 is a pair, if the opposite node 102 has a plurality of packet transmission / reception units, a plurality of paths can be formed.
- the configuration shown in Fig. 2 with the same packet transmitter / receiver can also be implemented.
- the packet analysis units 207 of both nodes analyze the state of each route, the arrival time of the packet and the arrival interval force, and transmit the route state notification to the partner node.
- the latest route state based on the notification content is stored in the storage unit 205.
- the scheduling unit 202 determines a packet transmission order, a packet transmission time, and a route used for transmission of each packet based on the route information recorded in the storage unit 205 and notifies the route selection unit.
- the route selection unit 203 takes out the input packet from the input queue 201 based on the notification from the scheduling unit 202, and transmits it from the specified route at the time designated by the scheduling unit.
- the scheduling unit 202 of the node 101 operates according to the operation flow chart (SDL process graph) of FIG. In other words, the following operations are started by a scheduling request with the power of the route selection unit.
- the predicted reception time when transmitted from the route is obtained (Step 102).
- the predicted reception delay is a time at which the end of the packet is expected to arrive at the partner node 102.
- the route with the smallest predicted reception time is set as the transmission route of the packet (Step 103).
- Figure 5 shows an example of arrival time prediction for the first packet 300-1.
- the reception time is predicted on the assumption that the transmission path force determined by the above procedure is transmitted for all packets having a lower arrival order.
- FIG. 6 shows an example of prediction of the reception time of the second packet 300-2.
- the delay of route 2 is increased by the transmission of 300-1!]
- So the predicted reception time of route 1 is earlier, so route 1 becomes the transmission route of packet 300-2.
- the congestion state of each route is confirmed and predicted, and the transmission possible time is obtained (Step 104).
- the congestion state refers to a state in which packets cannot be sent immediately because the predicted delay of the route exceeds the allowable value.
- the allowable delay value is set in advance or determined by the scheduling unit 202 according to the line state.
- Route 2 is in a congested state because the predicted reception time of 300-1 that Route 2 should transmit is more than the allowable delay of Route 2 from now.
- the transmission time needs to be after tl. This tl is the time when packet 300-1 can be transmitted.
- the transmission available time is immediate.
- the transmission process of each packet in the input queue 201 is performed.
- the route and the transmittable time are notified to the route selection unit 203 (Step 106).
- the route selection unit 203 that has received the notification from the scheduling unit 202 transmits each packet from the packet transmission unit 204 corresponding to the notified transmission route at the notified transmission possible time.
- An operation flowchart (SDL process graph) followed by the route selection unit 203 at this time is shown in FIG.
- the route selection unit 203 for which scheduling has been requested to the scheduling unit 202 is in an active state.
- a l is set as an initial value (Step 201), and a packet having the earliest possible transmission time is taken out from the input queue 201 (Step 202).
- it waits until the transmission possible time of the packet with the earliest possible transmission time (Step 203), and transmits the packet with the earliest possible transmission time to the packet transmission unit 204 corresponding to the transmission path specified by the scheduling unit. (Step 204).
- Step 205 If there is no packet in the input queue 201 (Step 207), the state becomes the idle state and waits for the arrival of the next packet (Step 208).
- Step 207 When there is a packet in the input queue 201 (Step 207) or when a new packet reception notification is received from the input queue 201 (Step 209), a scheduling request is transmitted to the scheduling unit 202 (Step 210).
- the number of packets for which scheduling is requested is an arbitrary number less than the number of packets in the input queue 201.
- the total number of packets in the input queue 201 may be set, or an arbitrary upper limit may be set.
- the packet 300-1 that has arrived at the input queue 201 first is transmitted after the packet 300-2.
- the expected order of reception is the same as the order of arrival at the input queue 201. That is, when the packet is output from the packet transmission unit 204 of the node 101, the packet order is reversed again in the 1S network 400, which is the reverse order of arrival at the node 101, and the arrival order at the node 102 is the arrival order at the node 101. We expect it to be similar to the order. At this time, the delay of any packet is equal to or less than that when only route 1 or only route 2 is used, and the load is distributed to both routes.
- the operation of the present invention has been described by taking an example of a configuration in which two paths can be used.
- the algorithm shown in FIGS. 3 and 4 can also be applied when there are three or more usable paths. is there.
- the configuration of the apparatus is, for example, as shown in FIG. 2, and the delay of the packet transferred between the node 101 and the node 102 in FIG.
- the bandwidth can be expanded by distributing the load to each path.
- each unit is configured with one piece of software.
- it may be configured with an information processing apparatus that operates according to a control program that causes each unit to operate.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2008507508A JP4488256B2 (ja) | 2006-03-29 | 2007-03-27 | 通信方法、ノード及び制御プログラム |
US12/294,846 US8139491B2 (en) | 2006-03-29 | 2007-03-27 | Communication method, node, and control program |
CN200780012051.4A CN101416456B (zh) | 2006-03-29 | 2007-03-27 | 通信方法、节点及控制程序 |
EP20070739820 EP2001174A4 (en) | 2006-03-29 | 2007-03-27 | COMMUNICATION PROCEDURES, NODES AND CONTROL PROGRAM |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2006-091271 | 2006-03-29 | ||
JP2006091271 | 2006-03-29 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2007111331A1 true WO2007111331A1 (ja) | 2007-10-04 |
Family
ID=38541248
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2007/056382 WO2007111331A1 (ja) | 2006-03-29 | 2007-03-27 | 通信方法、ノード及び制御プログラム |
Country Status (6)
Country | Link |
---|---|
US (1) | US8139491B2 (ja) |
EP (1) | EP2001174A4 (ja) |
JP (1) | JP4488256B2 (ja) |
KR (1) | KR20080109786A (ja) |
CN (1) | CN101416456B (ja) |
WO (1) | WO2007111331A1 (ja) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8055819B2 (en) | 2007-06-13 | 2011-11-08 | Nec Corporation | Information processor |
US20220191147A1 (en) * | 2019-03-25 | 2022-06-16 | Siemens Aktiengesellschaft | Computer Program and Method for Data Communication |
WO2023181565A1 (ja) * | 2022-03-22 | 2023-09-28 | 株式会社デンソー | 送信装置、方法、及びプログラム |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ES2355671B1 (es) | 2009-04-23 | 2012-02-02 | Vodafone España, S.A.U. | Encaminamiento de tráfico en una red de comunicación celular. |
US8639809B2 (en) * | 2010-08-20 | 2014-01-28 | International Business Machines Corporation | Predictive removal of runtime data using attribute characterizing |
JP5932242B2 (ja) * | 2011-05-20 | 2016-06-08 | キヤノン株式会社 | 情報処理装置、通信方法、及びプログラム |
EP2945416B1 (en) * | 2014-05-13 | 2018-04-11 | Cellxion Limited | Method and apparatus for transmission of data over a plurality of networks |
CN110719598B (zh) * | 2019-10-15 | 2021-10-22 | 北京达佳互联信息技术有限公司 | 一种数据传输方法、装置、电子设备及存储介质 |
US11909628B1 (en) * | 2022-09-01 | 2024-02-20 | Mellanox Technologies, Ltd. | Remote direct memory access (RDMA) multipath |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002152258A (ja) * | 2000-11-10 | 2002-05-24 | Nec Corp | データ取得システム及びデータ取得方法 |
WO2005067227A1 (ja) * | 2004-01-09 | 2005-07-21 | Nec Corporation | 負荷分散方法、ノード及び制御プログラム |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3665460B2 (ja) * | 1997-12-05 | 2005-06-29 | 富士通株式会社 | 分散自律協調型の応答時間チューニングによる経路選択システム、方法、及び記録媒体 |
US6865160B1 (en) * | 1998-05-04 | 2005-03-08 | Hewlett-Packard Development Company, L.P. | Broadcast tree determination in load balancing switch protocols |
US6594238B1 (en) * | 1998-06-19 | 2003-07-15 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for dynamically adapting a connection state in a mobile communications system |
US6684247B1 (en) * | 2000-04-04 | 2004-01-27 | Telcordia Technologies, Inc. | Method and system for identifying congestion and anomalies in a network |
JP3596609B2 (ja) | 2001-04-09 | 2004-12-02 | 日本電気株式会社 | パケット中継方式 |
DE60136230D1 (de) * | 2001-10-19 | 2008-11-27 | Ericsson Telefon Ab L M | Verfahren und anordnung zur kanaltypumschaltung |
EP1313274A3 (en) * | 2001-11-19 | 2003-09-03 | Matsushita Electric Industrial Co., Ltd. | Packet transmission apparatus and packet transmission processing method |
US6704645B1 (en) * | 2001-12-11 | 2004-03-09 | Garmin Ltd. | System and method for estimating impedance time through a road network |
GB0406095D0 (en) | 2004-03-17 | 2004-04-21 | Koninkl Philips Electronics Nv | Method for providing secure data transfer in a mesh network |
US7729335B2 (en) * | 2005-05-18 | 2010-06-01 | Lg Electronics Inc. | Providing traffic information relating to a prediction of congestion status and using the same |
KR20060119741A (ko) * | 2005-05-18 | 2006-11-24 | 엘지전자 주식회사 | 소통상태의 추이정보를 제공하고 이를 이용하는 방법 및장치 |
-
2007
- 2007-03-27 WO PCT/JP2007/056382 patent/WO2007111331A1/ja active Search and Examination
- 2007-03-27 KR KR20087023794A patent/KR20080109786A/ko not_active Application Discontinuation
- 2007-03-27 JP JP2008507508A patent/JP4488256B2/ja not_active Expired - Fee Related
- 2007-03-27 CN CN200780012051.4A patent/CN101416456B/zh not_active Expired - Fee Related
- 2007-03-27 EP EP20070739820 patent/EP2001174A4/en not_active Withdrawn
- 2007-03-27 US US12/294,846 patent/US8139491B2/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002152258A (ja) * | 2000-11-10 | 2002-05-24 | Nec Corp | データ取得システム及びデータ取得方法 |
WO2005067227A1 (ja) * | 2004-01-09 | 2005-07-21 | Nec Corporation | 負荷分散方法、ノード及び制御プログラム |
Non-Patent Citations (2)
Title |
---|
NAKATA T. ET AL.: "Idotai Internet (2)", 2004 NEN THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS SOGO TAIKAI YOKOSHU TSUSHIN B, B-5-164, THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS, 8 March 2004 (2004-03-08), pages 651 * |
See also references of EP2001174A4 * |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8055819B2 (en) | 2007-06-13 | 2011-11-08 | Nec Corporation | Information processor |
US20220191147A1 (en) * | 2019-03-25 | 2022-06-16 | Siemens Aktiengesellschaft | Computer Program and Method for Data Communication |
US12047299B2 (en) * | 2019-03-25 | 2024-07-23 | Siemens Aktiengesellschaft | Computer program and method for data communication |
WO2023181565A1 (ja) * | 2022-03-22 | 2023-09-28 | 株式会社デンソー | 送信装置、方法、及びプログラム |
Also Published As
Publication number | Publication date |
---|---|
KR20080109786A (ko) | 2008-12-17 |
US20100172243A1 (en) | 2010-07-08 |
EP2001174A4 (en) | 2010-04-21 |
EP2001174A1 (en) | 2008-12-10 |
CN101416456B (zh) | 2014-10-22 |
US8139491B2 (en) | 2012-03-20 |
CN101416456A (zh) | 2009-04-22 |
JPWO2007111331A1 (ja) | 2009-08-13 |
JP4488256B2 (ja) | 2010-06-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4488256B2 (ja) | 通信方法、ノード及び制御プログラム | |
JP5071165B2 (ja) | 経路多重化通信システム、通信ノード及び通信方法 | |
JP4394541B2 (ja) | 通信装置、データ通信方法およびプログラム | |
JP4430597B2 (ja) | ネットワークシステム、送信側振分装置、パケット通信方法、および、パケット通信プログラム | |
US20210176177A1 (en) | Network control apparatus and network control method | |
WO2007083687A1 (ja) | 通信方法、通信システム、ノードおよびプログラム | |
CN102185771B (zh) | Mptcp中发送方数据包调度方法及*** | |
KR20070011315A (ko) | 병렬 통신을 위한 시스템 및 방법 | |
CN103841041A (zh) | 一种多流业务并发传输控制方法及装置 | |
JP5205819B2 (ja) | 通信システムおよびそのパケットスケジューリング方法ならびに送信ノード | |
CN104092625B (zh) | 一种用于dcn中的自适应请求分批调度方法 | |
US8838782B2 (en) | Network protocol processing system and network protocol processing method | |
KR101983088B1 (ko) | 다중 경로 환경에서의 udp 패킷 처리 방법 | |
US20090003329A1 (en) | Repeater, Communication System, Control Circuit, Connector, and Computer Program | |
Liao et al. | Sender-based multipath out-of-order scheduling for high-definition videophone in multi-homed devices | |
CN109347738A (zh) | 一种车载异构网络的多径传输调度优化方法 | |
JP2009105662A (ja) | マルチホップ通信システム、マルチホップ通信方法、端末装置および中継装置 | |
Ou et al. | Out-of-order transmission enabled congestion and scheduling control for multipath TCP | |
JP6633500B2 (ja) | 通信装置 | |
JP3814204B2 (ja) | パケット通信システム | |
Jacquet et al. | Striping over wireless links: effects on transmission delays | |
Santhi et al. | A new approach to Active Queue Management for TCP with ECN | |
JP2002344508A (ja) | データ中継装置およびその方法 | |
CN115733755A (zh) | 一种可填充网络带宽的数据中心传输控制***及方法 | |
Shi et al. | Packet queueing delay in resilient packet ring network nodes |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 07739820 Country of ref document: EP Kind code of ref document: A1 |
|
DPE1 | Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 12294846 Country of ref document: US Ref document number: 2008507508 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020087023794 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: 2007739820 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200780012051.4 Country of ref document: CN |
|
DPE1 | Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101) |