CN102546359B - Method for detecting path maximum transmission unit and router for detecting same - Google Patents
Method for detecting path maximum transmission unit and router for detecting same Download PDFInfo
- Publication number
- CN102546359B CN102546359B CN201010585548.9A CN201010585548A CN102546359B CN 102546359 B CN102546359 B CN 102546359B CN 201010585548 A CN201010585548 A CN 201010585548A CN 102546359 B CN102546359 B CN 102546359B
- Authority
- CN
- China
- Prior art keywords
- value
- pmtu
- experience
- message
- reference count
- 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.)
- Expired - Fee Related
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method for detecting a path maximum transmission unit and a router for detecting the same. The method includes: determining a detection space according to citation times of experience reference values in an experience reference table; and determining a PMTU (path maximum transmission unit) value according to the detection space. The router comprises a space determining module and a PMTU determining module, wherein the space determining module is used for determining the detection space according to the citation times of the experience reference values in the experience reference table, and the PMTU determining module is used for determining the PMTU value according to the detection space. By the aid of the technical scheme, precision of positioning the experience reference value is improved, the iterative step of approaching the optimal PMTU is omitted, and the effect of rapid convergence is achieved.
Description
Technical field
The present invention relates to computer technology, relate in particular to method and router that a kind of realizing route MTU is surveyed.
Background technology
There is a shortcoming in current internet protocol suite, is exactly concerning a main frame, to lack the standard mechanism of the PMTU (Path MTU, PMTU) of finding any paths.In current network, be not that all router devices all support PMTU to survey (Path MTU Discovery, PMTUD) function, replacing these equipment will be an engineering that cost is very large, so PMTU probe algorithm more and more attracts much attention and studies.
In (RFC) 1191 that request for comments labor technical background and the solution of this problem, the probe algorithm of mentioning comprises diminishing method, incremental method, experience table method.Nick Christenson has proposed layered probe algorithm, and this layered probe algorithm has further improved detection accuracy; Afterwards, also utilize the improved layered probe algorithm of experience table, but there is no deep consideration for the accurate location of how to improve experience value.
Summary of the invention
In order to solve this technical problem, the invention provides method and router that a kind of realizing route MTU is surveyed, to improve the accurate location to experience value.
The invention provides a kind of method that realizing route MTU is surveyed, the method comprises:
Rule of thumb in reference table, the number of times of quoting of experience value is determined space exploration; And
According to above-mentioned space exploration, determine PMTU value.
Preferably, the method that above-mentioned realizing route MTU is surveyed can have following features:
In above-mentioned rule of thumb reference table, the number of times of quoting of experience value determines that space exploration comprises:
In experience table, select the experience value of reference count maximum as PMTU initial value, and using above-mentioned PMTU initial value and send message as message length; And
If message sends successfully, increase progressively and select the experience value of reference count maximum to send message, until message sends unsuccessfully; If message sends unsuccessfully, successively decrease and select the experience value of reference count maximum to send message, until message sends successfully;
Above-mentionedly according to above-mentioned space exploration, determine that PMTU value comprises:
The experience value of selecting reference count maximum in above-mentioned space exploration is above-mentioned PMTU value.
Preferably, the method that above-mentioned realizing route MTU is surveyed can have following features:
The above-mentioned experience value of reference count maximum of selecting in experience table is as PMTU initial value, and usings above-mentioned PMTU initial value and as message length, send message and comprise:
From experience table, select experience value M0, M1 ..., Mn forms experience value array, above-mentioned experience value sorted, and initialization critical value Min=M0, Max=Mn; From above-mentioned experience value array, select the experience value Mi of reference count maximum as PMTU initial value, using above-mentioned initial p MTU value as message length upper limit encapsulated message, and send the message after encapsulation;
If above-mentioned message sends successfully, increase progressively and select the experience value of reference count maximum to send message, until message sends unsuccessfully; If message sends unsuccessfully, successively decrease and select the experience value of reference count maximum to send message, until sending successfully, message comprises:
If message sends unsuccessfully, and MTU (MTU) value of the down hop of the above-mentioned gateway carrying in the Internet Control Message Protocol from gateway of receiving (ICMP) message is Mu, find than the minimum experience value Mj in the large experience value of Mu as new Max, and between [M0, Mj], select the experience value Mi of a reference count maximum as new PMTU value;
If message sends unsuccessfully, and in the icmp packet from gateway of receiving, do not carry the MTU value of the down hop of above-mentioned gateway, indirect assignment Max=Mi, and between [M0, Mi], select the experience value Mi of a reference count maximum as new PMTU value;
If message sends successfully, between [Mi, Mn], select the experience value of a reference count maximum as PMTU value, and assignment Min=Mi; And
Select, after new PMTU value, again to send message, again change the value of Min and MAX, until both are two adjacent values in experience value array.
Preferably, the method that above-mentioned realizing route MTU is surveyed can have following features:
Above-mentioned according to above-mentioned space exploration, determine PMTU value after, said method also comprises:
If above-mentioned PMTU value is the experience value in experience table, the reference count of above-mentioned experience value adds up one, otherwise, this PMTU value is joined in above-mentioned experience table.
Preferably, the method that above-mentioned realizing route MTU is surveyed can have following features:
Said method also comprises:
When selecting the experience value of a reference count maximum, if the reference count of the experience value in selected interval is all identical, select maximum experience value as PMTU value.
The invention provides a kind of router, above-mentioned router comprises:
Space determination module, determines space exploration for the number of times of quoting of reference table experience value rule of thumb; And
PMTU (PMTU) determination module, for determining PMTU value according to above-mentioned space exploration.
Preferably, above-mentioned router can have following features:
Above-mentioned space determination module comprises:
Initial determining unit, for select the experience value of reference count maximum as PMTU initial value at experience table, and usings above-mentioned PMTU initial value and sends message as message length; And
Iteration determining unit, if send successfully for message, increases progressively and selects the experience value of reference count maximum to send message, until message sends unsuccessfully; If message sends unsuccessfully, successively decrease and select the experience value of reference count maximum to send message, until message sends successfully;
Above-mentioned PMTU (PMTU) determination module, being further used for selecting the experience value of reference count maximum in above-mentioned space exploration is above-mentioned PMTU value.
Preferably, above-mentioned router also can have following features:
Above-mentioned initial determining unit, is further used for selecting experience value M0 from experience table, M1 ..., Mn forms experience value array, above-mentioned experience value sorted, and initialization critical value Min=M0, Max=Mn; From above-mentioned experience value array, select the experience value Mi of reference count maximum as PMTU initial value, using above-mentioned PMTU initial value as message length upper limit encapsulated message, and send the message after encapsulation;
Above-mentioned iteration determining unit, if being further used for message sends unsuccessfully, and MTU (MTU) value of the down hop of the above-mentioned gateway carrying in the Internet Control Message Protocol from gateway of receiving (ICMP) message is Mu, find than the minimum experience value Mj in the large experience value of Mu as new Max, and between [M0, Mj], select the experience value Mi of a reference count maximum as new PMTU value; If message sends unsuccessfully, and in the icmp packet from gateway of receiving, do not carry the MTU value of the down hop of above-mentioned gateway, indirect assignment Max=Mi, and between [M0, Mi], select the experience value Mi of a reference count maximum as new PMTU value; If message sends successfully, between [Mi, Mn], select the experience value of a reference count maximum as PMTU value, and assignment Min=Mi; And select, after new PMTU value, again to send message, again change the value of Min and MAX, until both are two adjacent values in experience value array.
Preferably, above-mentioned router also can have following features:
Above-mentioned router also comprises:
Update module, for above-mentioned according to above-mentioned space exploration, determine PMTU value after, if above-mentioned PMTU value is the experience value in experience table, the reference count of above-mentioned experience value adds up one, otherwise, this PMTU value is joined in above-mentioned experience table.
Preferably, above-mentioned router also can have following features:
Above-mentioned iteration determining unit, also, for when selecting the experience value of a reference count maximum, if the reference count of the experience value in selected interval is all identical, selects maximum experience value as PMTU value.
Technical scheme of the present invention, has improved the precision to experience value location, has saved the iterative step that approaches best PMTU, has reached the effect of Fast Convergent.
Accompanying drawing explanation
Fig. 1 is the flow chart of realizing route MTU detection method of the present invention;
Fig. 2 is the schematic diagram that the present invention determines the first process of space exploration;
Fig. 3 is the schematic diagram that the present invention determines the second process of space exploration;
Fig. 4 is the schematic diagram that the present invention determines the 3rd process of space exploration;
Fig. 5 is the schematic diagram that the present invention determines the 4th process of space exploration;
Fig. 6 is the structural representation of router of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the enforcement of technical scheme is described in further detail.
For the accurate orientation problem improving experience value, the present invention proposes a kind of method that realizing route MTU is surveyed, and the method is applied in probe algorithm and is gone.The method has proposed the concept of experience value reference count, and the method not only can be used in layered probe algorithm, also can or use in other algorithms based on experience value at diminishing method, incremental method.
In all kinds of algorithms based on experience value, will face the problem of selecting an experience value, select which experience value, there is no at present standard regulation.After introducing the reference count of experience value, select experience value just to have foundation.
As shown in Figure 1, be the flow chart of realizing route MTU detection method of the present invention, the method comprises:
Step 101, rule of thumb the number of times of quoting of experience value is determined space exploration in reference table;
In experience table, only have some experience values of advising in each RFC at present, not the concept of reference count; And the present invention is a reference count of each experience value setting, for adding up the access times of each experience value; And can utilize this reference count to dynamically update the experience value in experience table; Wherein, experience table can be referring to table 1:
Table 1 experience table
MTU value | Reference |
65535 | RFC791 |
65535 | RFC1044 |
17914 | IBM standard |
8166 | RFC1042 |
4464 | RFC1042 |
4352 | RFC1188 |
2048 | RFC907 |
2002 | RFC1042 |
1536 | RFC895 |
1500 | RFC894 |
1500 | RFC1134 |
1492 | RFC1042 |
1006 | RFC1055 |
1006 | RFC1822 |
576 | RFC877 |
544 | DEC standard |
512 | RFC1088 |
508 | RFC1042 |
508 | RFC1051 |
296 | RFC1144 |
68 | RFC791 |
Some specific experience values in RFC, have just been recommended, under specific environment, if some the experience value outside these experience values is conventional, these conventional experience values can join this experience table, and add up its reference count;
Step 102, according to above-mentioned space exploration, determine PMTU value.
When experience value that need to be on this detection interval is selected an experience value, select the experience value of reference count maximum as PMTU value;
Wherein, when initialization, reference count value can be initialized as 0; When this experience value is detected as best PMTU value, the reference count of this experience value cumulative 1.
Adopt said method, improved the precision to experience value location, saved the iterative step that approaches best PMTU, reached the effect of Fast Convergent.
The present invention analyzes the using method of reference count in conjunction with the layered probe algorithm based on experience table, do not consider in this embodiment Network Packet Loss situation; When surveying beginning, select a primary iteration point, in experience table, select the experience value of reference count maximum as PMTU initial value; Then using that this sends message as message length, if send, successfully increase progressively and select the experience value of reference count maximum to send message until send unsuccessfully; If send, unsuccessfully successively decrease and select the experience value of reference count maximum to send message until send successfully.By said method, can comparatively fast obtain path mtu value.
Concrete implementation procedure is as follows:
Suppose that initial experience reference value array is M0, M1, M2 ..., Mn; M0, M1, M2 ..., Mn is generally experience value listed in table 1; Experience value in array is sorted by order from small to large, and initialization critical value Min=M0, Max=Mn; From array, select the Mi of reference count maximum as PMTU initial value, referring to Fig. 2, using this as the message length upper limit, encapsulated message, will be not send after burst (Don ' t Fragment, DF) flag set.
If Internet Control Message Protocol (Internet Control Message Protocol, the ICMP) message of " need burst, but not set of DF " of receiving that certain gateway sends, illustrates that the MTU value of this gateway down hop is less than current PMTU value.The MTU value of carrying this gateway down hop of returning in the icmp packet of supposing to reply is Mu, find than the minimum experience value Mj in the large experience value of Mu as new Max, at [M0, Max] between select the experience value Mi of a reference count maximum as new PMTU value, referring to Fig. 3.If the MTU value of this gateway down hop (gateway having is not supported) not in reply message, indirect assignment Max=Mi, referring to Fig. 4.
If sent successfully, between [Mi, Mn], select the experience value of a reference count maximum as PMTU value, and assignment Min=Mi, referring to Fig. 5.
Like this, again send message after finding new PMTU value, again change the value of Min and Max, until both are two adjacent values in experience value array, there is no other experience value between the two; And guarantee that Min length message sends successfully, Max length message sends unsuccessfully.
Wherein, when selecting the experience value of a reference count maximum, if the reference count of the experience value in selected interval is all identical in array, select experience value maximum.
First layered probe needs to determine initial probe space [Min, Max], and above be the process of determining initial probe space; What will do below is exactly layered probe, and the present invention no longer describes in detail.
If PMTU result is the known experience value in array after layered probe, so the reference count of this experience value is added up to 1, otherwise, just in array, insert this PMTU value as a new experience value.
Because router MTU value generally can often not changed in reality, even if change, change scope is also little, conventionally between some determined values, changes, so it is more to carry out the number of times of PMTUD, uses the algorithmic statement after reference count faster; General diminishing method, the incremental method of adopting, its time complexity is O (n), even if use binary search time complexity, is O (logN); And time complexity after use reference count is less than O (logN).
Suppose that experience value array is M0, M1 ..., M99; The reference count of each experience value is respectively 0,1,0 ..., 0,7,9,0 ..., 0,2; Wherein, the reference count that the reference count that the reference count that the reference count of M1 is 1, M59 is 7, M60 is 9, M99 is 2, and the reference count of other experience values is 0.Final definite initial probe space is [M59, M60], and the number of times result of giving out a contract for a project under four kinds of algorithms is referring to table 2, can obviously find out after using reference count and greatly reduce the quantity that sends useless detection packet, has improved convergence rate.
Under table 2 algorithms of different, send the frequency table of useless detection packet
Algorithm | Iterations |
Incremental method | 61 |
Diminishing method | 41 |
Dichotomy | 7 |
Reference count method | 2 |
As shown in Figure 6, be the structural representation of router of the present invention, above-mentioned router comprises space determination module 61 and PMTU determination module 62; Wherein, space determination module is determined space exploration for the number of times of quoting of reference table experience value rule of thumb; PMTU (PMTU) determination module is for determining PMTU value according to above-mentioned space exploration.
Wherein, above-mentioned space determination module can comprise initial determining unit and iteration determining unit; This initial determining unit is for selecting the experience value of reference count maximum as PMTU initial value at experience table, and usings above-mentioned PMTU initial value and send message as message length; If this iteration determining unit sends successfully for message, increase progressively and select the experience value of reference count maximum to send message, until message sends unsuccessfully; If message sends unsuccessfully, successively decrease and select the experience value of reference count maximum to send message, until message sends successfully.Above-mentioned PMTU (PMTU) determination module, being further used for selecting the experience value of reference count maximum in above-mentioned space exploration is above-mentioned PMTU value.
Preferably, above-mentioned initial determining unit can be further used for selecting experience value M0 from experience table, M1 ..., Mn forms experience value array, above-mentioned experience value sorted, and initialization critical value Min=M0, Max=Mn; From above-mentioned experience value array, select the experience value Mi of reference count maximum as PMTU initial value, using above-mentioned PMTU initial value as message length upper limit encapsulated message, and send the message after encapsulation; If can being further used for message, above-mentioned iteration determining unit sends unsuccessfully, and the MTU value of the down hop of the above-mentioned gateway carrying in the icmp packet from gateway of receiving is Mu, find than the minimum experience value Mj in the large experience value of Mu as new Max, and between [M0, Mj], select the experience value Mi of a reference count maximum as new PMTU value; If message sends unsuccessfully, and in the icmp packet from gateway of receiving, do not carry the MTU value of the down hop of above-mentioned gateway, indirect assignment Max=Mi, and between [M0, Mi], select the experience value Mi of a reference count maximum as new PMTU value; If message sends successfully, between [Mi, Mn], select the experience value of a reference count maximum as PMTU value, and assignment Min=Mi; And select, after new PMTU value, again to send message, again change the value of Min and MAX, until both are two adjacent values in experience value array.
For by under specific environment, some conventional experience value outside experience table joins this experience table, above-mentioned router can also comprise update module, this update module for above-mentioned according to above-mentioned space exploration, determine PMTU value after, if above-mentioned PMTU value is the experience value in experience table, the reference count of above-mentioned experience value adds up one, otherwise, this PMTU value is joined in above-mentioned experience table.
In addition, above-mentioned iteration determining unit also, for when selecting the experience value of a reference count maximum, if the reference count of the experience value in selected interval is all identical, selects maximum experience value as PMTU value.
Above-mentioned space determination module determines that the process of space exploration can, referring to Fig. 2-Fig. 5, repeat no more herein.
This router is determined space exploration by space determination module, then by PMTU determination module, selects the experience value of reference count maximum as PMTU value; This router greatly reduces the quantity that sends useless detection packet after using reference count, has improved convergence rate, and has improved the accurate location to experience value.
One of ordinary skill in the art will appreciate that all or part of step in said method can come instruction related hardware to complete by program, said procedure can be stored in computer-readable recording medium, as read-only memory, disk or CD etc.Alternatively, all or part of step of above-described embodiment also can realize with one or more integrated circuits.Correspondingly, each the module/unit in above-described embodiment can adopt the form of hardware to realize, and also can adopt the form of software function module to realize.The present invention is not restricted to the combination of the hardware and software of any particular form.
Above embodiment is only unrestricted in order to technical scheme of the present invention to be described, only with reference to preferred embodiment, the present invention is had been described in detail.Those of ordinary skill in the art should be appreciated that and can modify or be equal to replacement technical scheme of the present invention, and do not depart from the spirit and scope of technical solution of the present invention, all should be encompassed in the middle of claim scope of the present invention.
Claims (8)
1. the method that realizing route MTU (PMTU) is surveyed, is characterized in that, described method comprises:
Rule of thumb in reference table, the number of times of quoting of experience value is determined space exploration; And
According to described space exploration, determine PMTU value;
In described rule of thumb reference table, the number of times of quoting of experience value determines that space exploration comprises:
In experience table, select the experience value of reference count maximum as PMTU initial value, and using described PMTU initial value and send message as message length; And
If message sends successfully, increase progressively and select the experience value of reference count maximum to send message, until message sends unsuccessfully; If message sends unsuccessfully, successively decrease and select the experience value of reference count maximum to send message, until message sends successfully;
Describedly according to described space exploration, determine that PMTU value comprises:
The experience value of selecting reference count maximum in described space exploration is described PMTU value.
2. the method that realizing route MTU according to claim 1 is surveyed, it is characterized in that, the described experience value of reference count maximum of selecting in experience table is as PMTU initial value, and usings described PMTU initial value and as message length, send message and comprise:
From experience table, select experience value M0, M1 ..., Mn forms experience value array, described experience value sorted, and initialization critical value Min=M0, Max=Mn; From described experience value array, select the experience value Mi of reference count maximum as PMTU initial value, using described initial p MTU value as message length upper limit encapsulated message, and send the message after encapsulation;
If described message sends successfully, increase progressively and select the experience value of reference count maximum to send message, until message sends unsuccessfully; If message sends unsuccessfully, successively decrease and select the experience value of reference count maximum to send message, until sending successfully, message comprises:
If message sends unsuccessfully, and MTU (MTU) value of the down hop of the described gateway carrying in the Internet Control Message Protocol from gateway of receiving (ICMP) message is Mu, indirect assignment Max=Mu, and [Min, Max) between select the experience value Mi of a reference count maximum as new PMTU value;
If message sends unsuccessfully, and in the icmp packet from gateway of receiving, do not carry the MTU value of the down hop of described gateway, indirect assignment Max=Mi, and [Min, Max) between select the experience value Mi of a reference count maximum as new PMTU value;
If message sends successfully, indirect assignment Min=Mi, and (Min, Max] between select the experience value of a reference count maximum as PMTU value; And
Select, after new PMTU value, again to send message, again change the value of Min and MAX, until both do not have other experience values between adjacent two values or Min and MAX.
3. the method that realizing route MTU according to claim 2 is surveyed, is characterized in that, described according to described space exploration, determine PMTU value after, described method also comprises:
If described PMTU value is the experience value in experience table, the reference count of described experience value adds up one, otherwise, this PMTU value is joined in described experience table.
4. the method that realizing route MTU according to claim 2 is surveyed, is characterized in that, described method also comprises:
When selecting the experience value of a reference count maximum, if the reference count of the experience value in selected interval is all identical, select maximum experience value as PMTU value.
5. a router, is characterized in that, described router comprises:
Space determination module, determines space exploration for the number of times of quoting of reference table experience value rule of thumb; And
PMTU (PMTU) determination module, for determining PMTU value according to described space exploration;
Described space determination module comprises:
Initial determining unit, for select the experience value of reference count maximum as PMTU initial value at experience table, and usings described PMTU initial value and sends message as message length; And
Iteration determining unit, if send successfully for message, increases progressively and selects the experience value of reference count maximum to send message, until message sends unsuccessfully; If message sends unsuccessfully, successively decrease and select the experience value of reference count maximum to send message, until message sends successfully;
Described PMTU (PMTU) determination module, being further used for selecting the experience value of reference count maximum in described space exploration is described PMTU value.
6. router according to claim 5, is characterized in that:
Described initial determining unit, is further used for selecting experience value M0 from experience table, M1 ..., Mn forms experience value array, described experience value sorted, and initialization critical value Min=M0, Max=Mn; From described experience value array, select the experience value Mi of reference count maximum as PMTU initial value, using described PMTU initial value as message length upper limit encapsulated message, and send the message after encapsulation;
Described iteration determining unit, if being further used for message sends unsuccessfully, and MTU (MTU) value of the down hop of the described gateway carrying in the Internet Control Message Protocol from gateway of receiving (ICMP) message is Mu, indirect assignment Max=Mu, and [Min, Max) between select the experience value Mi of a reference count maximum as new PMTU value; If message sends unsuccessfully, and in the icmp packet from gateway of receiving, do not carry the MTU value of the down hop of described gateway, indirect assignment Max=Mi, and [Min, Max) between select the experience value Mi of a reference count maximum as new PMTU value; If message sends successfully, indirect assignment Min=Mi, and (Min, Max] between select the experience value of a reference count maximum as PMTU value; And select, after new PMTU value, again to send message, again change the value of Min and MAX, until both do not have other experience values between adjacent two values or Min and MAX.
7. router according to claim 6, is characterized in that, described router also comprises:
Update module, for described according to described space exploration, determine PMTU value after, if described PMTU value is the experience value in experience table, the reference count of described experience value adds up one, otherwise, this PMTU value is joined in described experience table.
8. router according to claim 6, is characterized in that:
Described iteration determining unit, also, for when selecting the experience value of a reference count maximum, if the reference count of the experience value in selected interval is all identical, selects maximum experience value as PMTU value.
Priority Applications (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 |
PCT/CN2011/077429 WO2012075813A1 (en) | 2010-12-10 | 2011-07-21 | Method for detecting path maximum transmission unit and router |
Applications Claiming Priority (1)
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 |
Publications (2)
Publication Number | Publication Date |
---|---|
CN102546359A CN102546359A (en) | 2012-07-04 |
CN102546359B true CN102546359B (en) | 2014-12-10 |
Family
ID=46206588
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201010585548.9A Expired - Fee Related CN102546359B (en) | 2010-12-10 | 2010-12-10 | Method for detecting path maximum transmission unit and router for detecting same |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN102546359B (en) |
WO (1) | WO2012075813A1 (en) |
Families Citing this family (1)
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 |
Citations (2)
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 |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
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 active Application Filing
Patent Citations (2)
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 |
Non-Patent Citations (2)
Title |
---|
基于经验值的分层PMTU探测算法;黄永峰等;《电子学报》;20071031;第35卷(第10期);第1865-1869页 * |
黄永峰等.基于经验值的分层PMTU探测算法.《电子学报》.2007,第35卷(第10期), * |
Also Published As
Publication number | Publication date |
---|---|
CN102546359A (en) | 2012-07-04 |
WO2012075813A1 (en) | 2012-06-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20170149877A1 (en) | Weighted load balancing using scaled parallel hashing | |
US7924758B2 (en) | Energy-aware routing apparatus and method | |
US10355971B2 (en) | System and method for data path validation and verification | |
US9426716B2 (en) | Optimizing communication for mesh routing protocols using directional beam forming | |
CN104717081A (en) | Gateway function realization method and device | |
CN103259725A (en) | Messaging method and network equipment | |
WO2014159047A2 (en) | Using latency and route information to estimate location | |
CN101656653B (en) | Method and device for configuring receive buffer applied to multi-path transmission | |
CN104994021A (en) | Method and device for determining optimal path | |
EP3515018B1 (en) | Method, apparatus and system for measuring network path | |
Tsai et al. | Enabling efficient and consistent network update in wireless data centers | |
EP3585013B1 (en) | Data transmission method and apparatus | |
CN102546359B (en) | Method for detecting path maximum transmission unit and router for detecting same | |
CN106411553B (en) | Method and device for optimizing service chain path | |
US10333794B2 (en) | Validating routing tables of routing devices | |
US20150201365A1 (en) | System and Method for Distributed and Integrated Mobility Support for Mobile Networks and Mobile Hosts | |
US10333839B2 (en) | Routing a data packet in a communication network | |
CN112615785A (en) | Routing method and device of network data packet | |
CN102739540B (en) | Method and system of access of branch to headquarters, and branch equipment | |
CN105814850A (en) | Method for routing data packet, node and communication system | |
US8595239B1 (en) | Minimally disruptive hash table | |
Wu et al. | SPread: Exploiting fractal social community for efficient multi-copy routing in VDTNs | |
US9185029B2 (en) | Apparatus and method for processing path management packet | |
CN105900383A (en) | Communication system, control node and communication method | |
KR101531026B1 (en) | Management method for client node list in the network by using fifo memory |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141210 Termination date: 20191210 |
|
CF01 | Termination of patent right due to non-payment of annual fee |