WO2012075813A1 - Method for detecting path maximum transmission unit and router - Google Patents
Method for detecting path maximum transmission unit and router Download PDFInfo
- Publication number
- WO2012075813A1 WO2012075813A1 PCT/CN2011/077429 CN2011077429W WO2012075813A1 WO 2012075813 A1 WO2012075813 A1 WO 2012075813A1 CN 2011077429 W CN2011077429 W CN 2011077429W WO 2012075813 A1 WO2012075813 A1 WO 2012075813A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- value
- empirical
- pmtu
- sent
- packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Ceased
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
Definitions
- the present invention relates to computer technology, and more particularly to a method and router for implementing path maximum transmission unit detection. Background technique
- PMTU Path MTU
- PMTUD Path MTU Discovery
- the present invention provides a method and a router for implementing path maximum transmission unit detection to improve accurate positioning of empirical reference values.
- the present invention provides a method for implementing path maximum transmission unit detection, the method comprising: determining a detection space according to a reference number of empirical reference values in an empirical reference table;
- the PMTU value is determined based on the above detection space.
- the method for implementing path maximum transmission unit detection may have the following features: determining the detection space according to the reference number of empirical reference values in the empirical reference table includes: selecting an empirical reference value with the largest reference count as the initial PMTU in the empirical reference table. Value, and Transmitting the text with the initial PMTU value as the text length;
- the packet with the highest reference value is incremented to send the packet until the packet fails to be sent. If the packet fails to be sent, the packet with the highest reference number of the reference count is sent down until the packet is sent. Success
- the foregoing determining the PMTU value according to the foregoing detection space includes:
- the empirical reference value with the largest reference count in the above detection space is selected as the above PMTU value.
- the packet with the highest reference value is incremented to send the packet until the packet fails to be sent. If the packet fails to be sent, the packet with the highest reference value is sent down until the packet is sent. Successful delivery includes:
- MTU maximum transmission unit
- ICMP Internet Control Message Protocol
- the foregoing method for implementing path maximum transmission unit detection may have the following characteristics: After determining the PMTU value according to the foregoing detection space, the method further includes: if the PMTU value is an empirical reference value in the experience reference table, adding a reference count of the empirical reference value, otherwise, adding the PMTU value to the foregoing Experience reference table.
- the method for implementing the path maximum transmission unit detection may have the following features:
- the foregoing method further includes:
- the largest empirical reference value is selected as the PMTU value.
- the present invention provides a router, and the foregoing router includes:
- a space determination module configured to: determine a detection space according to a reference number of empirical reference values in an empirical reference table
- a Path Maximum Transmission Unit (PMTU) determination module is configured to: determine a PMTU value based on the above detection space.
- the above router may have the following characteristics:
- the space determination module described above includes:
- the initial determining unit is set to: in the empirical reference table, select the empirical reference value with the largest reference count as the initial value of the PMTU, and send the initial value of the PMTU as the length of the 4 ⁇ text; and the iterative determining unit, set to: If the packet is sent successfully, the packet with the highest reference value is incremented to send the packet until the packet fails to be sent. If the packet fails to be sent, the packet with the highest reference number of the reference count is sent down until the packet is successfully sent. ;
- the above path maximum transmission unit (PMTU) determining module is further configured to: select an empirical reference value having the largest reference count in the above detection space as the above PMTU value.
- the above router may also have the following characteristics:
- the above-mentioned iterative determining unit is further configured to: if the packet transmission fails, and the received maximum transmission unit (MTU) value of the next hop of the gateway carried in the Internet Control Message Protocol (ICMP) packet from the gateway is Mu, Then find the minimum empirical reference value Mj among the empirical reference values larger than Mu as the new Max, and select an empirical reference value Mi with the largest reference count between [MO, Mj] as the new PMTU value; if the message is sent If the received
- Mi as the new PMTU value
- the above router may also have the following characteristics:
- the above routers also include:
- the update module is configured to: after determining the PMTU value according to the foregoing detection space, if the PMTU value is an empirical reference value in the experience reference table, the reference count of the empirical reference value is incremented by one, otherwise, the PMTU value is added to The above experience is referenced in the table.
- the above router may also have the following characteristics:
- the above iterative determining unit is further configured to: when selecting an empirical reference value with the largest reference count, if the reference count of the empirical reference values of the selected interval is the same, the largest empirical reference value is selected as the PMTU value.
- FIG. 1 is a flowchart of a method for detecting a maximum transmission unit of a path according to the present invention
- FIG. 2 is a schematic diagram of a first process for determining a detection space according to the present invention
- FIG. 3 is a schematic diagram of a second process of determining a detection space according to the present invention.
- FIG. 4 is a schematic diagram of a third process for determining a detection space according to the present invention.
- FIG. 5 is a schematic diagram of a fourth process for determining a detection space according to the present invention
- FIG. 6 is a schematic structural diagram of a router according to the present invention.
- the present invention proposes a method for realizing the detection of the largest transmission unit of the path, and applies the method to the detection algorithm.
- This method proposes the concept of empirical reference value reference counting, which can be used not only in hierarchical detection algorithms, but also in decrementing, incremental or other algorithms based on empirical reference values.
- FIG. 1 it is a flowchart of a method for detecting a maximum transmission unit of a path according to the present invention, where the method includes:
- Step 101 Determine a detection space according to the number of times of reference of the empirical reference value in the empirical reference table.
- the value sets a reference count for counting the number of uses of each empirical reference value; and can use the reference count to dynamically update the empirical reference value in the empirical reference table; wherein, the empirical reference table can be seen in Table 1:
- Step 102 Determine a PMTU value according to the foregoing detection space.
- the empirical reference value with the largest reference count is selected as the PMTU value
- the reference count value may be initialized to 0; whenever the empirical reference value is detected as the optimal PMTU value, the reference count of the empirical reference value is incremented by one.
- the present invention combines a hierarchical detection algorithm based on an empirical reference table to analyze the use of reference counting, in which no network packet loss is considered; an initial iteration point is selected at the beginning of the detection, and a reference count is selected in the empirical reference table.
- the maximum empirical reference value is used as the initial value of the PMTU; then the message is sent as the message length, if the transmission is successful, the selection is made) the message is sent with the highest empirical reference value until the transmission fails; if the transmission fails, the selection reference count is decremented.
- the largest empirical reference sends a message until the transmission is successful.
- the path MTU value can be obtained faster by the above method.
- the next MTU value of the gateway is smaller than the current PMTU value.
- MTU value of the next hop of the gateway carried in the returned ICMP message is Mu
- Mj in the empirical reference value larger than Mu is found as the new Max, then between [MO, Max] Select a bow
- use the highest empirical reference value Mi as the new PMTU value, see Figure 3. If there is no MTU value of the next hop of the gateway in the reply (some gateways do not support it), then directly assign Max Mi, see Figure 4.
- the empirical reference value when selecting an empirical reference value with the largest reference count, if the reference count of the empirical reference values in the selected area of the array is the same, the empirical reference value is selected to be the largest.
- Hierarchical detection first needs to determine the initial detection space [Min, Max]. The above is the process of determining the initial detection space; the following is the layered detection, which is not described in detail in the present invention.
- the reference count of the empirical reference value is incremented by one. Otherwise, the PMTU value is inserted into the array as a new empirical reference value.
- the MTU value of the router is generally not changed frequently in real life, even if it is changed, the scope of the change is not large, and it usually changes between some certain values. Therefore, the more times the PMTUD is performed, the faster the convergence of the algorithm using the reference count is; Generally, the decrement method and the increment method are used, and the time complexity is 0 ( ⁇ ), even if the dichotomy method is used to find the time complexity is 0 (logN); and the time complexity after using the reference count is less than 0 (logN).
- the empirical reference value array is MO, Ml, ..., M99; the reference count of each empirical reference value They are 0, 1 , 0, ..., 0, 7, 9, 0, ..., 0, 2; where Ml has a reference count of 1, M59 has a reference count of 7, and M60 has a reference count of 9. , M99 has a reference count of 2, and other empirical reference values have a reference count of 0.
- the final initial detection space is [M59, M60], and the results of the number of packets sent under the four algorithms are shown in Table 2. It can be clearly seen that the use of reference counting greatly reduces the number of unnecessary detection packets and improves the convergence speed.
- the router includes a space determining module 61 and a PMTU determining module 62.
- the space determining module is configured to determine a detecting space according to a reference number of empirical reference values in an empirical reference table;
- a Maximum Transmission Unit (PMTU) determination module is operative to determine a PMTU value based on the detection space described above.
- PMTU Maximum Transmission Unit
- the space determining module may include an initial determining unit and an iterative determining unit.
- the initial determining unit is configured to select, in the empirical reference table, an empirical reference value with the largest count as the initial value of the PMTU, and use the initial value of the PMTU as the text length. Sending the text; the iterative determining unit is configured to: if the message is successfully sent, incrementally select the empirical reference value with the largest reference count to send the message until the message fails to be sent; if the message fails to be sent, the empirical reference with the largest selection reference count is decremented. The value is sent until the packet is sent successfully.
- the path maximum transmission unit (PMTU) determining module is further configured to select an empirical reference value having the largest reference count in the foregoing detection space as the foregoing PMTU value.
- the upper limit encapsulates the packet and sends the encapsulated packet.
- the above router may further include an update module, after the determining the PMTU value according to the foregoing detection space. If the above PMTU value is the empirical reference value in the experience reference table, the reference count of the above empirical reference value is incremented by one, otherwise, the PMTU value is added to the above empirical reference table.
- the iterative determining unit is further configured to select the largest empirical reference value as the PMTU value if the reference count of the empirical reference values of the selected interval is the same when selecting an empirical reference value with the largest reference count.
- the router determines the detection space by the space determination module, and then the PMTU determination module selects the empirical reference value with the largest reference count as the PMTU value; the router uses the reference count to greatly reduce the number of the useless detection packets, and improves the convergence speed, and The ⁇ "determination bit for the empirical reference value has been improved.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
实现路径最大传输单元探测的方法及路由器 Method and router for realizing path maximum transmission unit detection
技术领域 Technical field
本发明涉及计算机技术, 尤其涉及一种实现路径最大传输单元探测的方 法及路由器。 背景技术 The present invention relates to computer technology, and more particularly to a method and router for implementing path maximum transmission unit detection. Background technique
当前因特网协议族存在一个缺点, 就是对一台主机来说缺乏发现任意一 条路径的路径最大传输单元( Path MTU , PMTU ) 的标准机制。 在当前网络 中并非所有的路由器设备都支持 PMTU探测( Path MTU Discovery, PMTUD ) 功能, 要替换这些设备将是一个成本很大的工程, 所以 PMTU探测算法越来 越引起人们的注意和研究。 A disadvantage of the current Internet Protocol family is the lack of a standard mechanism for the Path MTU (PMTU) of a path to find any path. In the current network, not all router devices support the Path MTU Discovery (PMTUD) function. To replace these devices will be a costly project, so the PMTU detection algorithm has attracted more attention and research.
在请求评议(Equest For Comments, RFC ) 1191中详细分析了该问题的 技术背景及解决方法, 提到的探测算法包括递减法、 递增法、 经验参考表法。 Nick Christenson提出了分层探测算法, 该分层探测算法进一步提高了探测精 度; 之后, 也有利用经验参考表改进的分层探测算法, 但对于如何提高对经 验参考值的精确定位没有深入的考虑。 发明内容 The technical background and solution of the problem are analyzed in detail in Equest For Comments (RFC) 1191. The detection algorithms mentioned include decrement method, incremental method, and empirical reference table method. Nick Christenson proposed a layered detection algorithm that further improves the detection accuracy. Later, there is also a layered detection algorithm improved by the empirical reference table, but there is no in-depth consideration of how to improve the accurate positioning of the empirical reference values. Summary of the invention
为了解决该技术问题, 本发明提供了一种实现路径最大传输单元探测的 方法及路由器, 以提高对经验参考值的精确定位。 In order to solve the technical problem, the present invention provides a method and a router for implementing path maximum transmission unit detection to improve accurate positioning of empirical reference values.
本发明提供了一种实现路径最大传输单元探测的方法, 该方法包括: 根据经验参考表中经验参考值的引用次数确定探测空间; 以及 The present invention provides a method for implementing path maximum transmission unit detection, the method comprising: determining a detection space according to a reference number of empirical reference values in an empirical reference table;
根据上述探测空间确定 PMTU值。 The PMTU value is determined based on the above detection space.
优选地, 上述实现路径最大传输单元探测的方法可具有如下特点: 上述根据经验参考表中经验参考值的引用次数确定探测空间包括: 在经验参考表中选择引用计数最大的经验参考值作为 PMTU初始值, 并 以上述 PMTU初始值作为 文长度发送 文; 以及 Preferably, the method for implementing path maximum transmission unit detection may have the following features: determining the detection space according to the reference number of empirical reference values in the empirical reference table includes: selecting an empirical reference value with the largest reference count as the initial PMTU in the empirical reference table. Value, and Transmitting the text with the initial PMTU value as the text length;
若报文发送成功, 则递增选择引用计数最大的经验参考值发送报文, 直 至报文发送失败; 若报文发送失败, 则递减选择引用计数最大的经验参考值 发送报文, 直至报文发送成功; If the packet is sent successfully, the packet with the highest reference value is incremented to send the packet until the packet fails to be sent. If the packet fails to be sent, the packet with the highest reference number of the reference count is sent down until the packet is sent. Success
上述根据上述探测空间确定 PMTU值包括: The foregoing determining the PMTU value according to the foregoing detection space includes:
选择上述探测空间中引用计数最大的经验参考值为上述 PMTU值。 The empirical reference value with the largest reference count in the above detection space is selected as the above PMTU value.
优选地, 上述实现路径最大传输单元探测的方法可具有如下特点: 上述在经验参考表中选择引用计数最大的经验参考值作为 PMTU初始 从经验参考表中选择经验参考值 MO, Ml , …, Mn构成经验参考值数组, 对上述经验参考值进行排序, 且初始化临界值 Min=M0, Max=Mn; 从上述经 验参考值数组中选择引用计数最大的经验参考值 Mi作为 PMTU初始值, 以 上述初始 PMTU值作为报文长度上限封装报文, 并发送封装后的报文; Preferably, the method for implementing the path maximum transmission unit detection may have the following characteristics: selecting the empirical reference value with the largest reference count in the empirical reference table as the PMTU initial selection empirical reference value MO, Ml, ..., Mn from the empirical reference table. Forming an array of empirical reference values, sorting the above empirical reference values, and initializing the threshold value Min=M0, Max=Mn; selecting the empirical reference value Mi with the largest reference count from the above empirical reference value array as the initial value of the PMTU, with the above initial The PMTU value encapsulates the packet as the upper limit of the packet length, and sends the encapsulated packet.
上述若报文发送成功,则递增选择引用计数最大的经验参考值发送报文, 直至报文发送失败; 若报文发送失败, 则递减选择引用计数最大的经验参考 值发送报文, 直至报文发送成功包括: If the packet is sent successfully, the packet with the highest reference value is incremented to send the packet until the packet fails to be sent. If the packet fails to be sent, the packet with the highest reference value is sent down until the packet is sent. Successful delivery includes:
若报文发送失败, 且收到的来自网关的因特网控制消息协议(ICMP )报 文中携带的上述网关的下一跳的最大传输单元(MTU )值为 Mu, 则寻找比 Mu大的经验参考值中的最小经验参考值 Mj作为新的 Max, 并在 [MO, Mj] 之间选择一个弓 I用计数最大的经验参考值 Mi作为新的 PMTU值; If the message fails to be sent, and the maximum transmission unit (MTU) value of the next hop of the gateway carried in the received Internet Control Message Protocol (ICMP) message from the gateway is Mu, then an empirical reference larger than Mu is sought. The minimum empirical reference value Mj in the value is taken as the new Max, and an empirical reference value Mi with the largest count is selected between [MO, Mj] as the new PMTU value;
若报文发送失败, 且收到的来自网关的 ICMP报文中未携带上述网关的 下一跳的 MTU值 , 则直接赋值 Max=Mi , 并在 [MO , Mi]之间选择一个弓 |用 计数最大的经验参考值 Mi作为新的 PMTU值; If the packet fails to be sent, and the received ICMP message from the gateway does not carry the MTU value of the next hop of the gateway, directly assign Max=Mi and select a bow between [MO, Mi]. Counting the largest empirical reference value Mi as the new PMTU value;
若报文发送成功, 则在 [Mi, Mn] 之间选择一个引用计数最大的经验参 考值作为 PMTU值, 且赋值 Min=Mi; 以及 If the message is sent successfully, select an empirical reference value with the highest reference count between [Mi, Mn] as the PMTU value, and assign the value Min=Mi;
选择新的 PMTU值后, 再次发送艮文, 再次更改 Min和 MAX的值, 直 至两者在经验参考值数组中是相邻的两个值为止。 After selecting the new PMTU value, send the message again and change the values of Min and MAX again until the two values are adjacent in the empirical reference array.
优选地, 上述实现路径最大传输单元探测的方法可具有如下特点: 在上述根据上述探测空间确定 PMTU值之后, 上述方法还包括: 如果上述 PMTU值是经验参考表中的经验参考值, 则上述经验参考值的 引用计数累加一, 否则, 将该 PMTU值加入到上述经验参考表中。 Preferably, the foregoing method for implementing path maximum transmission unit detection may have the following characteristics: After determining the PMTU value according to the foregoing detection space, the method further includes: if the PMTU value is an empirical reference value in the experience reference table, adding a reference count of the empirical reference value, otherwise, adding the PMTU value to the foregoing Experience reference table.
优选地, 上述实现路径最大传输单元探测的方法可具有如下特点: 上述方法还包括: Preferably, the method for implementing the path maximum transmission unit detection may have the following features: The foregoing method further includes:
在选择一个引用计数最大的经验参考值时, 如果所选择的区间的经验参 考值的引用计数都相同, 则选择最大的经验参考值作为 PMTU值。 When selecting an empirical reference value with the largest reference count, if the reference count of the empirical reference values of the selected interval is the same, the largest empirical reference value is selected as the PMTU value.
本发明提供了一种路由器, 上述路由器包括: The present invention provides a router, and the foregoing router includes:
空间确定模块, 其设置为: 根据经验参考表中经验参考值的引用次数确 定探测空间; 以及 a space determination module, configured to: determine a detection space according to a reference number of empirical reference values in an empirical reference table;
路径最大传输单元(PMTU )确定模块, 其设置为: 根据上述探测空间 确定 PMTU值。 A Path Maximum Transmission Unit (PMTU) determination module is configured to: determine a PMTU value based on the above detection space.
优选地, 上述路由器可具有如下特点: Preferably, the above router may have the following characteristics:
上述空间确定模块包括: The space determination module described above includes:
初始确定单元, 设置为: 在经验参考表中选择引用计数最大的经验参考 值作为 PMTU初始值, 并以上述 PMTU初始值作为 4艮文长度发送 4艮文; 以及 迭代确定单元, 设置为: 若报文发送成功, 则递增选择引用计数最大的 经验参考值发送报文, 直至报文发送失败; 若报文发送失败, 则递减选择引 用计数最大的经验参考值发送报文, 直至报文发送成功; The initial determining unit is set to: in the empirical reference table, select the empirical reference value with the largest reference count as the initial value of the PMTU, and send the initial value of the PMTU as the length of the 4 艮 text; and the iterative determining unit, set to: If the packet is sent successfully, the packet with the highest reference value is incremented to send the packet until the packet fails to be sent. If the packet fails to be sent, the packet with the highest reference number of the reference count is sent down until the packet is successfully sent. ;
上述路径最大传输单元(PMTU )确定模块还设置为: 选择上述探测空 间中引用计数最大的经验参考值为上述 PMTU值。 The above path maximum transmission unit (PMTU) determining module is further configured to: select an empirical reference value having the largest reference count in the above detection space as the above PMTU value.
优选地, 上述路由器还可具有如下特点: Preferably, the above router may also have the following characteristics:
上述初始确定单元还设置为: 从经验参考表中选择经验参考值 M0 , Ml , ..· , Mn构成经验参考值数组, 对上述经验参考值进行排序, 且初始化 临界值 Min=M0, Max=Mn; 从上述经验参考值数组中选择引用计数最大的经 验参考值 Mi作为 PMTU初始值, 以上述 PMTU初始值作为报文长度上限封 装报文, 并发送封装后的报文; 上述迭代确定单元还设置为: 若报文发送失败, 且收到的来自网关的因 特网控制消息协议(ICMP )报文中携带的上述网关的下一跳的最大传输单元 ( MTU )值为 Mu, 则寻找比 Mu大的经验参考值中的最小经验参考值 Mj作 为新的 Max, 并在 [MO, Mj]之间选择一个引用计数最大的经验参考值 Mi作 为新的 PMTU值; 若报文发送失败, 且收到的来自网关的 ICMP报文中未携 带上述网关的下一跳的 MTU值, 则直接赋值 Max=Mi, 并在 [MO, Mi]之间 选择一个引用计数最大的经验参考值 Mi作为新的 PMTU值; 若报文发送成 功, 则在 [Mi, Mn] 之间选择一个引用计数最大的经验参考值作为 PMTU值, 且赋值 Min=Mi; 以及选择新的 PMTU值后, 再次发送报文, 再次更改 Min 和 MAX的值, 直至两者在经验参考值数组中是相邻的两个值为止。 The above initial determining unit is further configured to: select an empirical reference value M0, Ml, ..·, Mn from the empirical reference table to form an array of empirical reference values, sort the above empirical reference values, and initialize the critical value Min=M0, Max= Mn; selecting the empirical reference value Mi with the largest reference count from the above-mentioned empirical reference value array as the initial value of the PMTU, and using the initial value of the PMTU as the upper limit of the packet length to encapsulate the packet, and sending the encapsulated packet; The above-mentioned iterative determining unit is further configured to: if the packet transmission fails, and the received maximum transmission unit (MTU) value of the next hop of the gateway carried in the Internet Control Message Protocol (ICMP) packet from the gateway is Mu, Then find the minimum empirical reference value Mj among the empirical reference values larger than Mu as the new Max, and select an empirical reference value Mi with the largest reference count between [MO, Mj] as the new PMTU value; if the message is sent If the received MTU packet from the gateway does not carry the MTU value of the next hop of the gateway, the value of Max=Mi is directly assigned, and an empirical reference value with the largest reference count is selected between [MO, Mi]. Mi as the new PMTU value; if the message is sent successfully, select the empirical reference value with the largest reference count between [Mi, Mn] as the PMTU value, and assign Min=Mi; and select the new PMTU value again. Send the message and change the values of Min and MAX again until the two are adjacent to each other in the empirical reference array.
优选地, 上述路由器还可具有如下特点: Preferably, the above router may also have the following characteristics:
上述路由器还包括: The above routers also include:
更新模块, 设置为: 在上述根据上述探测空间确定 PMTU值之后, 如果 上述 PMTU值是经验参考表中的经验参考值, 则上述经验参考值的引用计数 累加一, 否则, 将该 PMTU值加入到上述经验参考表中。 The update module is configured to: after determining the PMTU value according to the foregoing detection space, if the PMTU value is an empirical reference value in the experience reference table, the reference count of the empirical reference value is incremented by one, otherwise, the PMTU value is added to The above experience is referenced in the table.
优选地, 上述路由器还可具有如下特点: Preferably, the above router may also have the following characteristics:
上述迭代确定单元还设置为:在选择一个引用计数最大的经验参考值时, 如果所选择的区间的经验参考值的引用计数都相同, 则选择最大的经验参考 值作为 PMTU值。 The above iterative determining unit is further configured to: when selecting an empirical reference value with the largest reference count, if the reference count of the empirical reference values of the selected interval is the same, the largest empirical reference value is selected as the PMTU value.
本发明实施例的技术方案, 提高了对经验参考值定位的精度, 节省了逼 近最佳 PMTU的迭代步骤, 达到了快速收敛的效果。 附图概述 The technical solution of the embodiment of the invention improves the accuracy of the positioning of the empirical reference value, saves the iterative step approaching the optimal PMTU, and achieves the effect of fast convergence. BRIEF abstract
图 1为本发明实现路径最大传输单元探测方法的流程图; 1 is a flowchart of a method for detecting a maximum transmission unit of a path according to the present invention;
图 2为本发明确定探测空间的第一过程的示意图; 2 is a schematic diagram of a first process for determining a detection space according to the present invention;
图 3为本发明确定探测空间的第二过程的示意图; 3 is a schematic diagram of a second process of determining a detection space according to the present invention;
图 4为本发明确定探测空间的第三过程的示意图; 4 is a schematic diagram of a third process for determining a detection space according to the present invention;
图 5为本发明确定探测空间的第四过程的示意图; 图 6 为本发明路由器的结构示意图。 本发明的较佳实施方式 FIG. 5 is a schematic diagram of a fourth process for determining a detection space according to the present invention; FIG. FIG. 6 is a schematic structural diagram of a router according to the present invention. Preferred embodiment of the invention
下面结合附图对技术方案的实施作进一步地详细描述。 The implementation of the technical solution will be further described in detail below with reference to the accompanying drawings.
针对提高对经验参考值的精确定位问题, 本发明提出了一种实现路径最 大传输单元探测的方法, 并将该方法应用到探测算法中去。 该方法提出了经 验参考值引用计数的概念, 该方法不仅可以在分层探测算法中使用, 也可以 在递减法、 递增法或是在基于经验参考值的其他算法中使用。 In order to improve the precise positioning of the empirical reference value, the present invention proposes a method for realizing the detection of the largest transmission unit of the path, and applies the method to the detection algorithm. This method proposes the concept of empirical reference value reference counting, which can be used not only in hierarchical detection algorithms, but also in decrementing, incremental or other algorithms based on empirical reference values.
在基于经验参考值的各类算法中,必将面临选择一个经验参考值的问题, 选择哪一个经验参考值, 目前没有标准规定。 引入经验参考值引用计数以后, 选择经验参考值便有了依据。 In various algorithms based on empirical reference values, there is bound to be the problem of selecting an empirical reference value, which empirical reference value to choose, and there is currently no standard. After the introduction of the empirical reference value reference count, there is a basis for selecting the empirical reference value.
如图 1所示, 为本发明实现路径最大传输单元探测方法的流程图, 该方 法包括: As shown in FIG. 1 , it is a flowchart of a method for detecting a maximum transmission unit of a path according to the present invention, where the method includes:
步骤 101、 根据经验参考表中经验参考值的引用次数确定探测空间; 目前经验参考表中只有各个 RFC中所建议的一些经验参考值, 并没有引 用计数的概念; 而本发明为每个经验参考值设定一个引用计数, 用于统计每 个经验参考值的使用次数; 且可以利用该引用计数动态更新经验参考表中的 经验参考值; 其中, 经验参考表可参见表 1 : Step 101: Determine a detection space according to the number of times of reference of the empirical reference value in the empirical reference table. Currently, only some empirical reference values suggested in the respective RFCs in the experience reference table do not refer to the concept of counting; and the present invention is for each empirical reference. The value sets a reference count for counting the number of uses of each empirical reference value; and can use the reference count to dynamically update the empirical reference value in the empirical reference table; wherein, the empirical reference table can be seen in Table 1:
经验参考表 Experience reference table
MTU值 参考 MTU value
65535 RFC791 65535 RFC791
65535 RFC 1044 65535 RFC 1044
17914 IBM标准 17914 IBM standard
8166 RFC 1042 8166 RFC 1042
4464 RFC 1042 4464 RFC 1042
4352 RFC1188 4352 RFC1188
2048 RFC907 2048 RFC907
2002 RFC 1042 2002 RFC 1042
1536 RFC895 1536 RFC895
1500 RFC894 1500 RFC1134 1500 RFC894 1500 RFC1134
1492 RFC 1042 1492 RFC 1042
1006 RFC1055 1006 RFC1055
1006 RFC1822 1006 RFC1822
576 RFC877 576 RFC877
544 DEC标准 544 DEC standard
512 RFC1088 512 RFC1088
508 RFC 1042 508 RFC 1042
508 RFC1051 508 RFC1051
296 RFC1144 296 RFC1144
68 RFC791 在 RFC中只是推荐了一些特定的经验参考值, 对于特定环境下, 如果在 这些经验参考值之外的有些经验参考值常用, 这些常用的经验参考值可以加 入到该经验参考表中来, 并统计其引用计数; 68 RFC791 only some specific empirical reference values are recommended in the RFC. For some specific environments, if some empirical reference values are used in addition to these empirical reference values, these common empirical reference values can be added to the experience reference table. , and count its reference count;
步骤 102、 根据上述探测空间确定 PMTU值。 Step 102: Determine a PMTU value according to the foregoing detection space.
当需要在该探测区间上的经验参考值选择一个经验参考值时, 选择引用 计数最大的经验参考值作为 PMTU值; When an empirical reference value needs to be selected in the empirical reference value on the detection interval, the empirical reference value with the largest reference count is selected as the PMTU value;
其中, 在初始化时, 引用计数值可以初始化为 0; 每当该经验参考值被 探测为最佳 PMTU值时, 该经验参考值的引用计数累加 1。 Wherein, at initialization, the reference count value may be initialized to 0; whenever the empirical reference value is detected as the optimal PMTU value, the reference count of the empirical reference value is incremented by one.
釆用上述方法,提高了对经验参考值定位的精度,节省了逼近最佳 PMTU 的迭代步骤, 达到了快速收敛的效果。 Using the above method, the accuracy of the empirical reference value is improved, and the iterative steps approaching the optimal PMTU are saved, and the fast convergence effect is achieved.
本发明结合基于经验参考表的分层探测算法来分析引用计数的使用方 法, 在该实施例中不考虑网络丟包情况; 在探测开始时选择一个初始迭代点, 在经验参考表中选择引用计数最大的经验参考值作为 PMTU初始值; 然后以 此作为报文长度发送报文, 若发送成功则递增选择 )用计数最大的经验参考 值发送报文直至发送失败; 若发送失败则递减选择引用计数最大的经验参考 值发送报文直至发送成功。 通过上述方法可以较快得到路径 MTU值。 The present invention combines a hierarchical detection algorithm based on an empirical reference table to analyze the use of reference counting, in which no network packet loss is considered; an initial iteration point is selected at the beginning of the detection, and a reference count is selected in the empirical reference table. The maximum empirical reference value is used as the initial value of the PMTU; then the message is sent as the message length, if the transmission is successful, the selection is made) the message is sent with the highest empirical reference value until the transmission fails; if the transmission fails, the selection reference count is decremented. The largest empirical reference sends a message until the transmission is successful. The path MTU value can be obtained faster by the above method.
具体的实现过程如下: 假设初始经验参考值数组为 MO, Ml , M2, Mn; MO, Ml , M2, ... , Mn一般为表 1中所列出的经验参考值;将数组中的经验参考值按从小到大的 顺序进行排序, 且初始化临界值 Min=M0, Max=Mn; 从数组中选择引用计数 最大的 Mi作为 PMTU初始值,参见图 2, 以此作为报文长度上限,封装报文, 将不分片 (Don't Fragment, DF )标志置位后发送。 The specific implementation process is as follows: Assume that the initial empirical reference value array is MO, Ml, M2, Mn; MO, Ml, M2, ..., Mn are generally the empirical reference values listed in Table 1; experience in the array Reference values from small to large Sorting sequentially, and initializing the threshold value Min=M0, Max=Mn; Selecting the Mi with the largest reference count from the array as the initial value of the PMTU, see Figure 2, as the upper limit of the packet length, encapsulating the message, will not fragment The (Don't Fragment, DF) flag is set and sent.
如果收到某网关发来的 "需要分片, 但 DF 未置位" 的因特网控制消息 协议 ( Internet Control Message Protocol, ICMP ) 消息, 说明该网关下一 ϋ 的 MTU值小于目前的 PMTU值。假设回复的 ICMP报文中携带回来的该网关下 一跳的 MTU值为 Mu, 找到比 Mu大的经验参考值中的最小经验参考值 Mj 作为新的 Max , 则在 [MO , Max]之间选择一个弓 |用计数最大的经验参考值 Mi 作为新的 PMTU值, 参见图 3。 如果回复 ^艮文中没有该网关下一跳的 MTU 值(有的网关不支持) , 则直接赋值 Max=Mi, 参见图 4。 If you receive an Internet Control Message Protocol (ICMP) message from the gateway that requires "segmentation but DF is not set", the next MTU value of the gateway is smaller than the current PMTU value. Assume that the MTU value of the next hop of the gateway carried in the returned ICMP message is Mu, and the minimum empirical reference value Mj in the empirical reference value larger than Mu is found as the new Max, then between [MO, Max] Select a bow | use the highest empirical reference value Mi as the new PMTU value, see Figure 3. If there is no MTU value of the next hop of the gateway in the reply (some gateways do not support it), then directly assign Max=Mi, see Figure 4.
如果发送成功, 则在 [Mi, Mn] 之间选择一个引用计数最大的经验参考 值作为 PMTU值, 且赋值 Min=Mi , 参见图 5。 If the transmission is successful, select an empirical reference value with the highest reference count between [Mi, Mn] as the PMTU value, and assign the value Min=Mi , see Figure 5.
这样 , 找到新的 PMTU值后再次发送 ^艮文 , 再次更改 Min和 Max的值 , 直到两者在经验参考值数组中是相邻的两个值为止, 即两者之间没有其他的 经验参考值了; 并且保证 Min长度报文发送成功, Max长度报文发送失败。 In this way, after finding the new PMTU value, send the message again, and change the values of Min and Max again, until the two are adjacent values in the empirical reference value array, that is, there is no other empirical reference between the two. The value is up; and the length of the message is sent successfully, and the Max length packet is sent.
其中, 在选择一个引用计数最大的经验参考值时, 如果数组中所选择区 间的经验参考值的引用计数都相同, 则选择经验参考值最大的。 Wherein, when selecting an empirical reference value with the largest reference count, if the reference count of the empirical reference values in the selected area of the array is the same, the empirical reference value is selected to be the largest.
分层探测首先需要确定初始探测空间 [Min, Max] , 以上即是确定初始探 测空间的过程; 下面要作的就是分层探测, 本发明不再详述。 Hierarchical detection first needs to determine the initial detection space [Min, Max]. The above is the process of determining the initial detection space; the following is the layered detection, which is not described in detail in the present invention.
如果分层探测后 PMTU结果是数组中的已知经验参考值, 那么把该经验 参考值的引用计数累加 1 , 否则, 就在数组中插入该 PMTU值作为一个新的 经验参考值。 If the PMTU result after layered detection is a known empirical reference value in the array, then the reference count of the empirical reference value is incremented by one. Otherwise, the PMTU value is inserted into the array as a new empirical reference value.
因为现实中路由器 MTU值一般是不会经常改动的, 即使改动, 改动范 围也不大, 通常在一些确定值之间改变, 所以进行 PMTUD的次数越多, 使 用引用计数后的算法收敛越快; 一般釆用递减法、 递增法, 其时间复杂度为 0 ( η ) , 即使使用二分法查找时间复杂度为 0 ( logN ) ; 而使用引用计数后 的时间复杂度要小于 0 ( logN ) 。 Because the MTU value of the router is generally not changed frequently in real life, even if it is changed, the scope of the change is not large, and it usually changes between some certain values. Therefore, the more times the PMTUD is performed, the faster the convergence of the algorithm using the reference count is; Generally, the decrement method and the increment method are used, and the time complexity is 0 ( η ), even if the dichotomy method is used to find the time complexity is 0 (logN); and the time complexity after using the reference count is less than 0 (logN).
假设经验参考值数组为 MO, Ml , ... , M99; 各经验参考值的引用计数 分别为 0, 1 , 0, ... , 0, 7, 9, 0, ... , 0, 2; 其中, Ml的引用计数为 1 , M59 的引用计数为 7, M60的引用计数为 9, M99的引用计数为 2, 其他经验参考 值的引用计数均为 0。 最终确定的初始探测空间是 [M59, M60] , 则四种算法 下的发包次数结果参见表 2, 可以明显看出使用引用计数后大大降低了发送 无用探测包的数量, 提高了收敛速度。 Suppose the empirical reference value array is MO, Ml, ..., M99; the reference count of each empirical reference value They are 0, 1 , 0, ..., 0, 7, 9, 0, ..., 0, 2; where Ml has a reference count of 1, M59 has a reference count of 7, and M60 has a reference count of 9. , M99 has a reference count of 2, and other empirical reference values have a reference count of 0. The final initial detection space is [M59, M60], and the results of the number of packets sent under the four algorithms are shown in Table 2. It can be clearly seen that the use of reference counting greatly reduces the number of unnecessary detection packets and improves the convergence speed.
不同算法下发送无用探测包的次数表 Number of times of sending unwanted probe packets under different algorithms
如图 6所示, 为本发明路由器的结构示意图, 上述路由器包括空间确定 模块 61和 PMTU确定模块 62; 其中, 空间确定模块用于根据经验参考表中 经验参考值的引用次数确定探测空间; 路径最大传输单元(PMTU )确定模 块用于根据上述探测空间确定 PMTU值。 As shown in FIG. 6 , which is a schematic structural diagram of a router according to the present invention, the router includes a space determining module 61 and a PMTU determining module 62. The space determining module is configured to determine a detecting space according to a reference number of empirical reference values in an empirical reference table; A Maximum Transmission Unit (PMTU) determination module is operative to determine a PMTU value based on the detection space described above.
其中, 上述空间确定模块可以包括初始确定单元和迭代确定单元; 该初 始确定单元用于在经验参考表中选择 1用计数最大的经验参考值作为 PMTU 初始值, 并以上述 PMTU初始值作为 文长度发送 文; 该迭代确定单元用 于若报文发送成功, 则递增选择引用计数最大的经验参考值发送报文, 直至 报文发送失败; 若报文发送失败, 则递减选择引用计数最大的经验参考值发 送报文, 直至报文发送成功。 上述路径最大传输单元(PMTU )确定模块, 进一步用于选择上述探测空间中引用计数最大的经验参考值为上述 PMTU 值。 The space determining module may include an initial determining unit and an iterative determining unit. The initial determining unit is configured to select, in the empirical reference table, an empirical reference value with the largest count as the initial value of the PMTU, and use the initial value of the PMTU as the text length. Sending the text; the iterative determining unit is configured to: if the message is successfully sent, incrementally select the empirical reference value with the largest reference count to send the message until the message fails to be sent; if the message fails to be sent, the empirical reference with the largest selection reference count is decremented. The value is sent until the packet is sent successfully. The path maximum transmission unit (PMTU) determining module is further configured to select an empirical reference value having the largest reference count in the foregoing detection space as the foregoing PMTU value.
优选地, 上述初始确定单元可以进一步用于从经验参考表中选择经验参 考值 MO, Ml , ..· , Mn构成经验参考值数组, 对上述经验参考值进行排序, 且初始化临界值 Min=M0 , Max=Mn; 从上述经验参考值数组中选择引用计数 最大的经验参考值 Mi作为 PMTU初始值, 以上述 PMTU初始值作为报文长 度上限封装报文, 并发送封装后的报文; 上述迭代确定单元可以进一步用于 若报文发送失败, 且收到的来自网关的 ICMP报文中携带的上述网关的下一 跳的 MTU值为 Mu, 则寻找比 Mu大的经验参考值中的最小经验参考值 Mj 作为新的 Max, 并在 [MO, Mj]之间选择一个引用计数最大的经验参考值 Mi 作为新的 PMTU值; 若报文发送失败, 且收到的来自网关的 ICMP报文中未 携带上述网关的下一跳的 MTU值, 则直接赋值 Max=Mi, 并在 [MO, Mi]之 间选择一个引用计数最大的经验参考值 Mi作为新的 PMTU值; 若报文发送 成功, 则在 [Mi, Mn] 之间选择一个引用计数最大的经验参考值作为 PMTU 值, 且赋值 Min=Mi; 以及选择新的 PMTU值后, 再次发送报文, 再次更改 Min和 MAX的值, 直至两者在经验参考值数组中是相邻的两个值为止。 Preferably, the initial determining unit may be further configured to select an empirical reference value MO, Ml, .., Mn from the empirical reference table to form an array of empirical reference values, sort the empirical reference values, and initialize the threshold value Min=M0. , Max=Mn; select the empirical reference value Mi with the largest reference count from the above empirical reference value array as the initial value of PMTU, and use the above initial PMTU value as the message length The upper limit encapsulates the packet and sends the encapsulated packet. The iterative determining unit may be further configured to: if the packet fails to be sent, and the received MTU value of the next hop of the gateway carried in the ICMP packet from the gateway For Mu, find the minimum empirical reference value Mj among the empirical reference values larger than Mu as the new Max, and select an empirical reference value Mi with the largest reference count between [MO, Mj] as the new PMTU value; If the packet fails to be sent, and the received ICMP message from the gateway does not carry the MTU value of the next hop of the gateway, the value of Max=Mi is directly assigned, and a reference count is selected between [MO, Mi]. The empirical reference value Mi is used as the new PMTU value; if the message is sent successfully, an empirical reference value with the largest reference count is selected as the PMTU value between [Mi, Mn], and the value of Min=Mi is assigned; and the new PMTU value is selected. After that, the message is sent again, and the values of Min and MAX are changed again until the two are adjacent to each other in the empirical reference value array.
为了将特定环境下, 在经验参考表之外的有些常用经验参考值加入到该 经验参考表中来, 上述路由器还可以包括更新模块, 该更新模块用于在上述 根据上述探测空间确定 PMTU值之后,如果上述 PMTU值是经验参考表中的 经验参考值, 则上述经验参考值的引用计数累加一, 否则, 将该 PMTU值加 入到上述经验参考表中。 In order to add some common empirical reference values outside the experience reference table to the experience reference table in a specific environment, the above router may further include an update module, after the determining the PMTU value according to the foregoing detection space. If the above PMTU value is the empirical reference value in the experience reference table, the reference count of the above empirical reference value is incremented by one, otherwise, the PMTU value is added to the above empirical reference table.
另外, 上述迭代确定单元还用于在选择一个引用计数最大的经验参考值 时, 如果所选择的区间的经验参考值的引用计数都相同, 则选择最大的经验 参考值作为 PMTU值。 In addition, the iterative determining unit is further configured to select the largest empirical reference value as the PMTU value if the reference count of the empirical reference values of the selected interval is the same when selecting an empirical reference value with the largest reference count.
上述空间确定模块确定探测空间的过程可参见图 2-图 5, 此处不再赘述。 该路由器通过空间确定模块确定出探测空间, 然后由 PMTU确定模块选 择引用计数最大的经验参考值作为 PMTU值; 该路由器使用引用计数后大大 降低了发送无用探测包的数量, 提高了收敛速度, 且提高了对经验参考值的 ^"确定位。 For the process of determining the detection space by the space determining module, refer to FIG. 2 to FIG. 5, and details are not described herein again. The router determines the detection space by the space determination module, and then the PMTU determination module selects the empirical reference value with the largest reference count as the PMTU value; the router uses the reference count to greatly reduce the number of the useless detection packets, and improves the convergence speed, and The ^"determination bit for the empirical reference value has been improved.
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序 来指令相关硬件完成, 上述程序可以存储于计算机可读存储介质中, 如只读 存储器、 磁盘或光盘等。 可选地, 上述实施例的全部或部分步骤也可以使用 一个或多个集成电路来实现。 相应地, 上述实施例中的各模块 /单元可以釆用 硬件的形式实现, 也可以釆用软件功能模块的形式实现。 本发明不限制于任 何特定形式的硬件和软件的结合。 以上实施例仅用以说明本发明的技术方案而非限制, 仅仅参照较佳实施 例对本发明进行了详细说明。 本领域的普通技术人员应当理解, 可以对本发 明的技术方案进行修改或者等同替换, 而不脱离本发明技术方案的精神和范 围, 均应涵盖在本发明的权利要求范围当中。 One of ordinary skill in the art will appreciate that all or a portion of the above steps may be accomplished by a program that instructs the associated hardware, such as a read-only memory, a magnetic disk, or an optical disk. Alternatively, all or part of the steps of the above embodiments may also be implemented using one or more integrated circuits. Correspondingly, each module/unit in the foregoing embodiment may be implemented in the form of hardware, or may be implemented in the form of a software function module. The invention is not limited to any specific form of combination of hardware and software. The above embodiments are only intended to illustrate the technical solutions of the present invention and are not to be construed as limiting the invention. A person skilled in the art should understand that the technical solutions of the present invention may be modified or equivalent, without departing from the spirit and scope of the present invention, and should be included in the scope of the claims of the present invention.
工业实用性 本发明实施例的技术方案, 提高了对经验参考值定位的精度, 节省了逼 近最佳 PMTU的迭代步骤, 达到了快速收敛的效果。 Industrial Applicability The technical solution of the embodiment of the present invention improves the accuracy of the empirical reference value positioning, saves the iterative steps approaching the optimal PMTU, and achieves the effect of fast convergence.
Claims
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010585548.9A CN102546359B (en) | 2010-12-10 | 2010-12-10 | Method for detecting path maximum transmission unit and router for detecting same |
| CN201010585548.9 | 2010-12-10 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2012075813A1 true WO2012075813A1 (en) | 2012-06-14 |
Family
ID=46206588
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2011/077429 Ceased WO2012075813A1 (en) | 2010-12-10 | 2011-07-21 | Method for detecting path maximum transmission unit and router |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102546359B (en) |
| WO (1) | WO2012075813A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105634977B (en) * | 2014-10-29 | 2019-06-04 | 新华三技术有限公司 | It was found that the method and apparatus of Path Maximum Transmission Unit |
| CN116192768B (en) * | 2023-03-06 | 2025-04-18 | 安超云软件有限公司 | A method, device, equipment and storage medium for determining a maximum transmission unit |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101408881A (en) * | 2004-09-29 | 2009-04-15 | 千兆科技(深圳)有限公司 | Method and system for generating binary file content signature |
| CN101677292A (en) * | 2008-09-16 | 2010-03-24 | 中兴通讯股份有限公司 | Method for fragmenting data in stream control transmission protocol |
| US7738495B2 (en) * | 2006-01-23 | 2010-06-15 | Cisco Technology, Inc. | Method of determining a maximum transmission unit value of a network path using transport layer feedback |
-
2010
- 2010-12-10 CN CN201010585548.9A patent/CN102546359B/en not_active Expired - Fee Related
-
2011
- 2011-07-21 WO PCT/CN2011/077429 patent/WO2012075813A1/en not_active Ceased
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101408881A (en) * | 2004-09-29 | 2009-04-15 | 千兆科技(深圳)有限公司 | Method and system for generating binary file content signature |
| US7738495B2 (en) * | 2006-01-23 | 2010-06-15 | Cisco Technology, Inc. | Method of determining a maximum transmission unit value of a network path using transport layer feedback |
| CN101677292A (en) * | 2008-09-16 | 2010-03-24 | 中兴通讯股份有限公司 | Method for fragmenting data in stream control transmission protocol |
Non-Patent Citations (2)
| Title |
|---|
| HUANG YONGFENG ET AL.: "A Hierarchical Path MTU Discovery Algorithm Based on Empiristic Data", ACTA ELECTRONICA SINICA, no. 10, 31 October 2007 (2007-10-31) * |
| J. MOGUL ET AL.: "RFC1191 Path MTU Discovery", IETF, 30 November 1990 (1990-11-30), Retrieved from the Internet <URL:URL:http://tools.ietf.org/pdf/rfc1191.pdf> * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102546359B (en) | 2014-12-10 |
| CN102546359A (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104704779B (en) | Method and apparatus for accelerating the forwarding in software defined network | |
| EP3541027B1 (en) | Method and device for determining transmission path | |
| Sidler et al. | Scalable 10Gbps TCP/IP stack architecture for reconfigurable hardware | |
| US8422501B2 (en) | Efficient path maximum transmission unit information discovery and storage | |
| US9602428B2 (en) | Method and apparatus for locality sensitive hash-based load balancing | |
| Lu et al. | One more queue is enough: Minimizing flow completion time with explicit priority notification | |
| Carpio et al. | DiffFlow: Differentiating short and long flows for load balancing in data center networks | |
| CN113676361A (en) | On-demand probes for quality of experience metrics | |
| US20200204472A1 (en) | Data packet sending method and apparatus in ipv6 network | |
| WO2018210117A1 (en) | Congestion control method, network device, and network interface controller thereof | |
| WO2017156974A1 (en) | Information transmission method, apparatus and system | |
| US10462065B2 (en) | Path maximum transmission unit discovery | |
| CN100459576C (en) | A Method of Detecting the Maximum Transmission Unit of a Path | |
| US9954791B2 (en) | Network interface selection for network connections | |
| JP2003333076A (en) | Offloading method of network stack | |
| US20160134727A1 (en) | A method for operating a software defined network and a software defined network | |
| CN110945845B (en) | Subflow-based load balancing | |
| CN101616078A (en) | A method for discovering the maximum transmission unit of a path, a router and a node device | |
| CN110838935A (en) | High-availability SDN controller clustering method, system, storage medium and equipment | |
| WO2017213745A1 (en) | Self-protecting computer network router with queue resource manager | |
| Vladimirov et al. | Network coding datagram protocol for TCP/IP networks | |
| CN117459460A (en) | Method, device, equipment, network system and storage medium for processing network congestion | |
| He et al. | Resilient QUIC protocol for emerging wireless networks | |
| WO2017162117A1 (en) | Accurate speed limiting method and apparatus for cluster | |
| CN106105098A (en) | Switch and method for processing service request message |
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: 11847831 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 11847831 Country of ref document: EP Kind code of ref document: A1 |