CN103023783A - Dynamic virtual private network (DVPN) based data transmission method and device - Google Patents
Dynamic virtual private network (DVPN) based data transmission method and device Download PDFInfo
- Publication number
- CN103023783A CN103023783A CN2012105072717A CN201210507271A CN103023783A CN 103023783 A CN103023783 A CN 103023783A CN 2012105072717 A CN2012105072717 A CN 2012105072717A CN 201210507271 A CN201210507271 A CN 201210507271A CN 103023783 A CN103023783 A CN 103023783A
- Authority
- CN
- China
- Prior art keywords
- spoke
- neighbours
- data
- cost
- equipment
- 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.)
- Granted
Links
Images
Abstract
The invention discloses a dynamic virtual private network (DVPN) based data transmission method and a device. The method includes that a Spoke sends a Cost Request message to a neighbor Spoke; the Spoke receives a Cost Response message returned by the neighbor Spoke, and a Cost value between the neighbor Spoke and a target Spoke is carried in the Cost Response message; and the Spoke compares a Cost value between the device and the target Spoke with Cost values among the device, the neighbor Spoke and the target Spoke, and when data are required to be sent to the target Spoke, the data are sent to the target Spoke through a path with the minimum Cost value. According to the DVPN based data transmission method and the device, the forward delay of the data can be reduced.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of based on DVPN(Dynamic Virtual Private Network, Dynamic VPN network) data transmission method and equipment.
Background technology
Increasing enterprise wishes to utilize public network to set up VPN(Virtual Private Network, VPN (virtual private network)), to connect the different a plurality of branches in geographical position; Yet enterprise branch office adopts dynamic address access public network usually, so that the end of communicating by letter can't be known the public network address of opposite end in advance, has proposed a difficult problem for setting up VPN.The DVPN technology has been proposed for this reason, it is by NHRP(Next Hop Resolution Protocol, Next Hop Resolution Protocol) or VAM(VPN Address Management, the VPN address administration) the public network address information of dynamic change is collected, safeguarded and distribute to agreement, thereby use in each branch of enterprise network in the situation of dynamic address access public network, between each branch, set up VPN.
DVPN comprises that Full-Mesh(is entirely interconnected) network, in the Full-Mesh network, it is direct-connected to set up direct(between the Spoke) tunnel directly communicates, and Hub is mainly as the center of Routing Information Exchange; Concrete, Spoke is to the Server(server) can obtain the information of Hub after the registration, and set up permanent tunnel with Hub and be connected; And can set up the direct tunnel between any two Spoke, this direct tunnel is dynamic, needs deleted when not having data interaction within one period stipulated time.
In the Full-Mesh network, tunnel establishment procedure comprises the steps:
Step 1, Site(node as shown in Figure 1) the initial condition schematic diagram of access network; Under initial condition, each Site is linked into network, but does not set up the tunnel each other.
Step 2, Site as shown in Figure 2 register schematic diagram to Server; In the process of Server registration, each Site can pass through the mutual of registration request message and back message using, obtains the identity of Hub or Spoke, and set up the tunnel between Spoke and Hub at each Site; Wherein, this Server mode that can be NHS(realize corresponding to NHRP) or the mode that realizes corresponding to VAM of VAM Server().
Set up direct tunnel schematic diagram between step 3, the Spoke as shown in Figure 3; Between Spoke, set up in the process in direct tunnel, suppose that Spoke1 links to each other with PC1, Spoke2 links to each other with PC2, when PC1 need to send data to PC2, Spoke1 sends down hop analysis request message to Server, Server passes through down hop resolution response message notifying to Spoke1 with the public network address of Spoke2 registration, and Spoke1 can utilize the public network address of Spoke2 to be established to the direct tunnel of Spoke2 afterwards.
Between all Spoke, all set up after the direct tunnel, can form a Full-Mesh network, as shown in Figure 4, be the schematic diagram of Full-Mesh network; Comprise tunnel between Spoke and the Hub and the direct tunnel between Spoke and the Spoke in this network; At this moment, the data between each Spoke can directly be transmitted by the direct tunnel between the Spoke, and do not need to carry out transfer by Hub.
In the prior art, when carrying out data retransmission by the direct tunnel, the direct tunnel between the Spoke might not be to lack forward-path most between the Spoke.As shown in Figure 5, be Full-Mesh forwarded path Cost(expense) schematic diagram; The direct tunnel that Spoke1 arrives Spoke2 need to experience 8 jumpings (this forward-path is through 8 routers or three-tier switch), and Spoke1 to Hub need to experience 2+4=6 and jumps to the path of Spoke2, and Spoke1 to Spoke3 need to experience 2+2=4 to the path of Spoke2 and jump.
Summary of the invention
The invention provides a kind of data transmission method based on DVPN and equipment, with by less path cost the transmission of data, and reduce the forward delay of data.
In order to achieve the above object, the embodiment of the invention provides a kind of data transmission method based on Dynamic VPN network DVPN, be applied to comprise in the network of a plurality of Spoke, the upper maintenance of each Spoke has neighbours' expense Cost table, recorded the Cost value between this equipment and the neighbours Spoke in the described neighbours Cost table, the method may further comprise the steps:
Spoke sends expense request Cost Request message, the information of having carried purpose Spoke in the described Cost Request message to neighbours Spoke; After receiving described Cost Request message, utilize the neighbours Cost table of the information inquiry local maintenance of described purpose Spoke by described neighbours Spoke, obtain the Cost value between this equipment and the described purpose Spoke;
Described Spoke receives the expense response Cost Response message that neighbours Spoke returns, and has carried the Cost value between described neighbours Spoke and the described purpose Spoke in the described Cost Response message;
Described Spoke relatively the Cost value between this equipment and the described purpose Spoke and this equipment to described neighbours Spoke to the Cost value between the described purpose Spoke, and when needs sent data to described purpose Spoke, the path minimum by the Cost value sent data to described purpose Spoke.
Also include server in the described network, the process of each Spoke maintenance of neighbor Cost table, further comprise: each Spoke has carried life span ttl value N initiate to receive the registration reply message from described server in the process of registration to described server in the described registration reply message;
Each Spoke all sends keep-alive Keepalive message to the neighbours Spoke of this equipment, has carried described ttl value N in the described Keepalive message;
Each Spoke obtains the ttl value M that carries in the Keepalive message, and determines that the Cost value between this equipment and the neighbours Spoke is (N-M) behind the Keepalive message of receiving from neighbours Spoke;
The information of each Spoke described neighbours Spoke of record in the neighbours Cost of local maintenance table and the corresponding relation between the described Cost value (N-M).
The information of described purpose Spoke comprises the public network address of purpose Spoke; Described Spoke further comprises to the process that neighbours Spoke sends expense request Cost Request message:
When described Spoke sends data at needs to purpose Spoke, send the Cost Request message of the public network address that carries described purpose Spoke to neighbours Spoke.
Described Spoke sends data by the minimum path of Cost value to described purpose Spoke, specifically comprise: described Spoke is that described Spoke is during to neighbours Spoke to purpose Spoke in the minimum path of Cost value, by the address, direct tunnel between described Spoke and the purpose Spoke described data are carried out the ground floor encapsulation, and by the address, direct tunnel between described Spoke and the neighbours Spoke data after the ground floor encapsulation are carried out second layer encapsulation, and the data after the second layer encapsulation are sent to described neighbours Spoke;
During by the data of described neighbours Spoke after receiving second layer encapsulation, separate the data after second layer encapsulation obtains the ground floor encapsulation, and the data after the ground floor encapsulation are sent to described purpose Spoke.
Described Spoke sends data by the minimum path of Cost value to described purpose Spoke, specifically comprise: described Spoke is that described Spoke is during to neighbours Spoke to purpose Spoke in the minimum path of Cost value, by the address, direct tunnel between described Spoke and the neighbours Spoke described data are encapsulated, and carry the public network address of described purpose Spoke in the specific field of the data after encapsulation, and the data after will encapsulating send to described neighbours Spoke;
During by the data of described neighbours Spoke after receiving encapsulation, if the public network address that carries in the discovery specific field is not the public network address of this equipment, the destination address of the data after then will encapsulating is revised as the public network address that carries in the described specific field, and amended data are sent to described purpose Spoke.
The embodiment of the invention provides a kind of data transmission set based on Dynamic VPN network DVPN, is applied to comprise that as Spoke described equipment comprises in the network of a plurality of Spoke:
Maintenance module is used for maintenance of neighbor expense Cost table, has recorded the Cost value between this equipment and the neighbours Spoke in the described neighbours Cost table;
The message sending module is used for sending expense request Cost Request message, the information of having carried purpose Spoke in the described Cost Request message to neighbours Spoke; After receiving described Cost Request message, utilize the neighbours Cost table of the information inquiry local maintenance of described purpose Spoke by described neighbours Spoke, obtain the Cost value between this equipment and the described purpose Spoke;
Receiver module is used for receiving the expense response Cost Response message that neighbours Spoke returns, and has carried the Cost value between described neighbours Spoke and the purpose Spoke in the described Cost Response message;
Comparison module is used for relatively the extremely described neighbours Spoke Cost value between the described purpose Spoke extremely of the Cost value between this equipment and described purpose Spoke and this equipment;
Data transmission blocks is used for when needs send data to described purpose Spoke, and the path minimum by the Cost value sends data to described purpose Spoke.
Also include server in the described network; Described maintenance module is further used for receiving the registration reply message from described server, and having carried life span ttl value N in the described registration reply message in the process of initiating to register to described server; Neighbours Spoke to this equipment sends keep-alive Keepalive message, has carried described ttl value N in the described Keepalive message; Behind the Keepalive message of receiving from neighbours Spoke, the ttl value M that carries in the acquisition Keepalive message, and determine that the Cost value between this equipment and the neighbours Spoke is (N-M); The information of the described neighbours Spoke of record and the corresponding relation between the described Cost value (N-M) in the neighbours Cost of local maintenance table.
The information of described purpose Spoke comprises the public network address of described purpose Spoke; Described message sending module, concrete being used for sends the Cost Request message of the public network address that carries described purpose Spoke to neighbours Spoke when needs send data to purpose Spoke.
Described data transmission blocks, when being further used in the minimum path of Cost value as this equipment to neighbours Spoke to purpose Spoke, by the address, direct tunnel between this equipment and the purpose Spoke described data are carried out the ground floor encapsulation, and by the address, direct tunnel between this equipment and the neighbours Spoke data after the ground floor encapsulation are carried out second layer encapsulation, and the data after the second layer encapsulation are sent to described neighbours Spoke; During by the data of described neighbours Spoke after receiving second layer encapsulation, separate the data after second layer encapsulation obtains the ground floor encapsulation, and the data after the ground floor encapsulation are sent to described purpose Spoke.
Described data transmission blocks, when being further used in the minimum path of Cost value as this equipment to neighbours Spoke to purpose Spoke, by the address, direct tunnel between this equipment and the neighbours Spoke described data are encapsulated, and carry the public network address of described purpose Spoke in the specific field of the data after encapsulation, and the data after will encapsulating send to described neighbours Spoke; During by the data of described neighbours Spoke after receiving encapsulation, if the public network address that carries in the discovery specific field is not the public network address of this equipment, the destination address of the data after then will encapsulating is revised as the public network address that carries in the described specific field, and amended data are sent to described purpose Spoke.
Compared with prior art, the embodiment of the invention has the following advantages at least: in the embodiment of the invention, can determine among the DVPN shortest path of forwarding data between each Spoke, and can pass through the shortest path the transmission of data, thereby with less path cost the transmission of data, and the forward delay of reduction data.
Description of drawings
Fig. 1 is the initial condition schematic diagram of Site access network in the Full-Mesh network of prior art;
Fig. 2 is that Site registers schematic diagram to Server in the Full-Mesh network of prior art;
Fig. 3 sets up direct tunnel schematic diagram between the Spoke in the Full-Mesh network of prior art;
Fig. 4 is the schematic diagram of the Full-Mesh network of prior art;
Fig. 5 is the Full-Mesh forwarded path Cost schematic diagram of prior art;
Fig. 6 is a kind of data transmission method flow chart based on DVPN that the embodiment of the invention provides;
Fig. 7 is the concrete application scenarios schematic diagram of the embodiment of the invention;
Fig. 8 is a kind of data transmission set structure chart based on DVPN that the embodiment of the invention proposes.
Embodiment
Below in conjunction with accompanying drawing the embodiment of the invention is described in detail.
For problems of the prior art, the embodiment of the invention has proposed a kind of data transmission method based on DVPN, and the method can be applied in the Full-Mesh network of DVPN; And in the Full-Mesh network, can comprise at least that server (Server) and a plurality of Spoke(comprise Hub and Spoke).
In the embodiment of the invention, the upper maintenance of each Spoke has neighbours Cost table, and recorded the Cost value (namely transmitting jumping figure or tactful priority etc.) between this equipment and the neighbours Spoke in this neighbours Cost table.Suppose to comprise in the Full-Mesh network Spoke1, Spoke2 and Spoke3, then: the Cost value between Cost value, Spoke1 and the Spoke3 between Spoke1 upper record Spoke1 and the Spoke2; Cost value between Cost value, Spoke2 and the Spoke3 between Spoke2 upper record Spoke2 and the Spoke1; Cost value between Cost value, Spoke3 and the Spoke2 between Spoke3 upper record Spoke3 and the Spoke1.
Concrete, each Spoke is upper for maintenance of neighbor Cost table, then a kind ofly preferred embodiment is:
Each Spoke has carried TTL(Time To Live, life span initiate to receive the registration reply message (Register replay message) from server in the process of registration to server in this registration reply message) value N; This ttl value N is the ttl value of Full-Mesh network, and in the registration reply message that sends to each Spoke in this Full-Mesh network of server, has all carried identical ttl value N.
Each Spoke is after server obtains ttl value N, if setting up the tunnel of Full-Mesh, each Spoke connects (namely setting up the direct tunnel between all Spoke), then each Spoke all sends the Keepalive(keep-alive to the neighbours Spoke of this equipment) message (Keepalive message can timed sending), and carried ttl value N in the IP head of this Keepalive message; For example, Spoke1 sends the Keepalive message that carries ttl value N to Spoke2, and sends the Keepalive message that carries ttl value N to Spoke3; Spoke2 sends the Keepalive message that carries ttl value N to Spoke1, and sends the Keepalive message that carries ttl value N to Spoke3; Spoke3 sends the Keepalive message that carries ttl value N to Spoke1, and sends the Keepalive message that carries ttl value N to Spoke2.
Each Spoke obtains the ttl value M that carries in the Keepalive message, and determines that the Cost value between this equipment and the neighbours Spoke is (N-M) after the Keepalive message of receiving from neighbours Spoke; With the example that is treated between Spoke1 and the Spoke2, Spoke1 sends the Keepalive message that carries ttl value N by the direct tunnel between this equipment and the Spoke2 to Spoke2, and Spoke2 sends the Keepalive message that carries ttl value N by the direct tunnel between this equipment and the Spoke1 to Spoke1; Spoke1 obtain ttl value M from the IP head of Keepalive message, and the Cost value between definite Spoke1 and the Spoke2 is (N-M) behind the Keepalive message of receiving from Spoke2; Spoke2 obtain ttl value M from the IP head of Keepalive message, and the Cost value between definite Spoke2 and the Spoke1 is (N-M) behind the Keepalive message of receiving from Spoke1.
The information (such as the public network address of neighbours Spoke) of each Spoke record neighbours Spoke in the neighbours Cost table that safeguard this locality and the corresponding relation between the Cost value (N-M).For example, on the neighbours Cost of Spoke1 table, with the public network address of record Spoke2 and the corresponding relation between the Cost value (N-M), and the public network address of record Spoke3 and the corresponding relation between the Cost value (N-M); On the neighbours Cost of Spoke2 table, with the public network address of record Spoke1 and the corresponding relation between the Cost value (N-M), and the public network address of record Spoke3 and the corresponding relation between the Cost value (N-M); On the neighbours Cost of Spoke3 table, with the public network address of record Spoke1 and the corresponding relation between the Cost value (N-M), and the public network address of record Spoke2 and the corresponding relation between the Cost value (N-M).
In the embodiment of the invention, owing to be the processing for the Full-Mesh network, therefore after each Spoke of Full-Mesh network processes in the manner described above, all can in the neighbours Cost of local maintenance table, record the information of neighbours Spoke and the corresponding relation between the Cost value (N-M).
Based on the neighbours Cost table of local maintenance, as shown in Figure 6, the data transmission method based on DVPN that the embodiment of the invention proposes can may further comprise the steps:
Step 601, Spoke is other neighbours Spoke outside the purpose Spoke to neighbours Spoke() send the request of Cost Request(expense) message, the information of having carried purpose Spoke in this Cost Request message; The information of this purpose Spoke includes but not limited to the public network address of this purpose Spoke.
In the embodiment of the invention, Spoke sends the process of Cost Request message to neighbours Spoke, further comprise: when Spoke sends data at needs to purpose Spoke, send the Cost Request message of the public network address that carries purpose Spoke to neighbours Spoke; For example, when Spoke1 sends data at needs to Spoke2, send the Cost Request message of the public network address that carries Spoke2 to neighbours Spoke; Perhaps, the Spoke clocked flip sends the Cost Request message of the public network address that carries purpose Spoke to neighbours Spoke; For example, the Spoke1 clocked flip sends the Cost Request message and the Cost Request message that carries the public network address of Spoke3 of the public network address that carries Spoke2 to neighbours Spoke.
Application scenarios schematic diagram take Fig. 7 as the embodiment of the invention, then for Spoke1, when having data to be transmitted to Spoke2 by Spoke1, this Spoke1 need to be Spoke3, SpokeN and Hub to all neighbours Spoke() transmission Cost Request message; Wherein, carried the public network address of Spoke2 in this Cost Request message, and this Cost Request message is used for making each neighbours Spoke to inquire about the Cost value that this equipment arrives the direct tunnel of Spoke2.
Step 602, neighbours Spoke utilizes the neighbours Cost table of the information inquiry local maintenance of purpose Spoke after receiving Cost Request message, obtain the Cost value between this equipment and the purpose Spoke.
Concrete, owing to recorded the information of neighbours Spoke and the corresponding relation between the Cost value (N-M) in the neighbours Cost of the neighbours Spoke local maintenance table, therefore neighbours Spoke is after receiving Cost Request message, can directly utilize the information inquiry of purpose Spoke to Cost value corresponding to purpose Spoke, the Cost value that this purpose Spoke is corresponding is the Cost value between this equipment and the purpose Spoke.
Step 603, neighbours Spoke returns the response of Cost Response(expense to Spoke) message, carried the Cost value between neighbours Spoke and the purpose Spoke in this Cost Response message.
Step 604, Spoke is after receiving Cost Response message, relatively the Cost value between this equipment and the purpose Spoke and this equipment to neighbours Spoke to the Cost value between the purpose Spoke, and when needs sent data to purpose Spoke, the path minimum by the Cost value sent data to purpose Spoke.
As shown in Figure 7, Spoke1 is Spoke3, SpokeN and Hub to all neighbours Spoke() send after the Cost Request message, can receive the Cost Response message from all neighbours Spoke; The Cost value of having carried Cost value 2(in the Cost Response message from Spoke3 and be between Spoke3 and the Spoke2 is 2); The Cost value of having carried Cost value 5(in the Cost Response message from SpokeN and be between SpokeN and the Spoke2 is 5); The Cost value of having carried Cost value 4(in the Cost Response message from Hub and be between Hub and the Spoke2 is 4).
The Cost Response message that returns to Spoke based on above-mentioned neighbours Spoke and the neighbours Cost table of Spoke local maintenance, Spoke1 can be known: the Cost value between Spoke1 and the Spoke2 is 8, Spoke1 to Spoke3 to the Cost value between the Spoke2 be 4(2+2), Spoke1 to SpokeN to the Cost value between the Spoke2 be 7(2+5), Spoke1 to Hub to the Cost value between the Spoke2 be 6(2+4); By relatively the Cost value between this equipment and the purpose Spoke and this equipment to neighbours Spoke to the Cost value between the purpose Spoke, the minimum path of Cost value is that Spoke1 to Spoke3 is to Spoke2, therefore Spoke1 is when needs send data to Spoke2, can be by the minimum path of Cost value: Spoke1 to Spoke3 to the path of Spoke2 to purpose Spoke transmission data.
In sum, the embodiment of the invention can be optimized the tunnel forward-path, and reduces forwarding delay.For example, Spoke1 to Spoke3 to the Cost value of Spoke2 be 4, be shortest path; The data that this moment, Spoke1 can send to PC1 PC2 switch to Spoke1 to Spoke3 and transmit to the tunnel of Spoke2 from the direct tunnel, owing to reduced the jumping figure of forward-path, thus can reduce forward delay.
In the embodiment of the invention, Spoke is before receiving the Cost Response message that neighbours Spoke returns to Spoke, if Spoke need to send data to purpose Spoke, then Spoke can be directly by the direct tunnel forwarding data between Spoke and the purpose Spoke; Perhaps, Spoke can also be by Spoke to Hub to the path forwarding data between the purpose Spoke.
In the embodiment of the invention, Spoke to the mode that purpose Spoke sends data, specifically includes but not limited to following mode by the minimum path of Cost value:
Mode one, Spoke are that Spoke is during to neighbours Spoke to purpose Spoke in the minimum path of Cost value, by the address, direct tunnel between Spoke and the purpose Spoke data are carried out the ground floor encapsulation, and by the address, direct tunnel between Spoke and the neighbours Spoke data after the ground floor encapsulation are carried out second layer encapsulation, and the data after the second layer encapsulation are sent to neighbours Spoke; Further, during the data of neighbours Spoke after receiving second layer encapsulation, can separate second layer encapsulation, obtaining the data after the ground floor encapsulation, and the data after the ground floor encapsulation be sent to purpose Spoke.
As shown in Figure 7, Spoke1 carries out the ground floor encapsulation by the address, direct tunnel between Spoke1 and the Spoke2 to data (PC1 sends to the data of PC2), but do not send, and by the address, direct tunnel between Spoke1 and the Spoke3 data after the ground floor encapsulation are carried out second layer encapsulation, and the data after the second layer encapsulation are sent to Spoke3; Spoke3 takes off second layer encapsulation when the data of receiving after the second layer encapsulates, be reduced to the data after the ground floor that encapsulates by the address, direct tunnel between Spoke1 and the Spoke2 encapsulates, and the data after the ground floor encapsulation are sent to Spoke2.
Mode two, Spoke are that Spoke is during to neighbours Spoke to purpose Spoke in the minimum path of Cost value, by the address, direct tunnel between Spoke and the neighbours Spoke data are encapsulated, and carry the public network address of purpose Spoke in the specific field of the data after encapsulation, and the data after will encapsulating send to neighbours Spoke; During by the data of neighbours Spoke after receiving encapsulation, if the public network address that carries in the discovery specific field is not the public network address of this equipment, the destination address of the data after then will encapsulating is revised as the public network address that carries in the specific field, and amended data are sent to purpose Spoke.
As shown in Figure 7, Spoke1 encapsulates data (PC1 sends to the data of PC2) by the address, direct tunnel between Spoke1 and the Spoke3, carry the public network address of Spoke2 in the specific field of the data after encapsulation (such as the proprietary protocol heading), and the data after will encapsulating send to Spoke3; During the data of Spoke3 after receiving encapsulation, if find that the public network address that carries in the proprietary protocol heading is not the public network address of this equipment, the source address that then keeps data, the destination address of the data after the encapsulation is revised as the public network address that carries in the proprietary protocol heading, and amended data are sent to Spoke2.
Based on the inventive concept same with said method, the embodiment of the invention has also proposed a kind of data transmission set based on Dynamic VPN network DVPN, be applied to comprise in the network of a plurality of Spoke that as shown in Figure 8, described equipment (being Spoke) comprising as Spoke:
Maintenance module 11 is used for maintenance of neighbor expense Cost table, has recorded the Cost value between this equipment and the neighbours Spoke in the described neighbours Cost table;
Comparison module 14 is used for relatively the extremely described neighbours Spoke Cost value between the described purpose Spoke extremely of the Cost value between this equipment and described purpose Spoke and this equipment;
Data transmission blocks 15 is used for when needs send data to described purpose Spoke, and the path minimum by the Cost value sends data to described purpose Spoke.
Also include server in the described network; Described maintenance module 11 is further used for receiving the registration reply message from described server, and having carried life span ttl value N in the described registration reply message in the process of initiating to register to described server; Neighbours Spoke to this equipment sends keep-alive Keepalive message, has carried described ttl value N in the described Keepalive message; Behind the Keepalive message of receiving from neighbours Spoke, the ttl value M that carries in the acquisition Keepalive message, and determine that the Cost value between this equipment and the neighbours Spoke is (N-M); The information of the described neighbours Spoke of record and the corresponding relation between the described Cost value (N-M) in the neighbours Cost of local maintenance table.
The information of described purpose Spoke comprises the public network address of described purpose Spoke; Described message sending module 12, concrete being used for sends the Cost Request message of the public network address that carries described purpose Spoke to neighbours Spoke when needs send data to purpose Spoke.
Described data transmission blocks 15, when being further used in the minimum path of Cost value as this equipment to neighbours Spoke to purpose Spoke, by the address, direct tunnel between this equipment and the purpose Spoke described data are carried out the ground floor encapsulation, and by the address, direct tunnel between this equipment and the neighbours Spoke data after the ground floor encapsulation are carried out second layer encapsulation, and the data after the second layer encapsulation are sent to described neighbours Spoke; During by the data of described neighbours Spoke after receiving second layer encapsulation, separate the data after second layer encapsulation obtains the ground floor encapsulation, and the data after the ground floor encapsulation are sent to described purpose Spoke.
Described data transmission blocks 15, when being further used in the minimum path of Cost value as this equipment to neighbours Spoke to purpose Spoke, by the address, direct tunnel between this equipment and the neighbours Spoke described data are encapsulated, and carry the public network address of described purpose Spoke in the specific field of the data after encapsulation, and the data after will encapsulating send to described neighbours Spoke; During by the data of described neighbours Spoke after receiving encapsulation, if the public network address that carries in the discovery specific field is not the public network address of this equipment, the destination address of the data after then will encapsulating is revised as the public network address that carries in the described specific field, and amended data are sent to described purpose Spoke.
Wherein, the modules of apparatus of the present invention can be integrated in one, and also can separate deployment.Above-mentioned module can be merged into a module, also can further split into a plurality of submodules.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by hardware, also can realize by the mode that software adds necessary general hardware platform.Based on such understanding, technical scheme of the present invention can embody with the form of software product, it (can be CD-ROM that this software product can be stored in a non-volatile memory medium, USB flash disk, portable hard drive etc.) in, comprise some instructions with so that computer equipment (can be personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a preferred embodiment, the module in the accompanying drawing or flow process might not be that enforcement the present invention is necessary.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from present embodiment.The module of above-described embodiment can be merged into a module, also can further split into a plurality of submodules.
The invention described above sequence number does not represent the quality of embodiment just to description.
More than disclosed only be several specific embodiment of the present invention, still, the present invention is not limited thereto, the changes that any person skilled in the art can think of all should fall into protection scope of the present invention.
Claims (10)
1.
A kind of data transmission method based on Dynamic VPN network DVPN, be applied to comprise in the network of a plurality of Spoke, it is characterized in that, the upper maintenance of each Spoke has neighbours' expense Cost table, recorded the Cost value between this equipment and the neighbours Spoke in the described neighbours Cost table, the method may further comprise the steps:
Spoke sends expense request Cost Request message, the information of having carried purpose Spoke in the described Cost Request message to neighbours Spoke; After receiving described Cost Request message, utilize the neighbours Cost table of the information inquiry local maintenance of described purpose Spoke by described neighbours Spoke, obtain the Cost value between this equipment and the described purpose Spoke;
Described Spoke receives the expense response Cost Response message that neighbours Spoke returns, and has carried the Cost value between described neighbours Spoke and the described purpose Spoke in the described Cost Response message;
Described Spoke relatively the Cost value between this equipment and the described purpose Spoke and this equipment to described neighbours Spoke to the Cost value between the described purpose Spoke, and when needs sent data to described purpose Spoke, the path minimum by the Cost value sent data to described purpose Spoke.
2.
The method of claim 1 is characterized in that, also includes server in the described network, and the process of each Spoke maintenance of neighbor Cost table further comprises:
Each Spoke has carried life span ttl value N initiate to receive the registration reply message from described server in the process of registration to described server in the described registration reply message;
Each Spoke all sends keep-alive Keepalive message to the neighbours Spoke of this equipment, has carried described ttl value N in the described Keepalive message;
Each Spoke obtains the ttl value M that carries in the Keepalive message, and determines that the Cost value between this equipment and the neighbours Spoke is (N-M) behind the Keepalive message of receiving from neighbours Spoke;
The information of each Spoke described neighbours Spoke of record in the neighbours Cost of local maintenance table and the corresponding relation between the described Cost value (N-M).
3.
Method as claimed in claim 1 or 2 is characterized in that, the information of described purpose Spoke comprises the public network address of purpose Spoke; Described Spoke further comprises to the process that neighbours Spoke sends expense request Cost Request message:
When described Spoke sends data at needs to purpose Spoke, send the Cost Request message of the public network address that carries described purpose Spoke to neighbours Spoke.
4.
The method of claim 1 is characterized in that, described Spoke sends data by the minimum path of Cost value to described purpose Spoke, specifically comprises:
Described Spoke is that described Spoke is during to neighbours Spoke to purpose Spoke in the minimum path of Cost value, by the address, direct tunnel between described Spoke and the purpose Spoke described data are carried out the ground floor encapsulation, and by the address, direct tunnel between described Spoke and the neighbours Spoke data after the ground floor encapsulation are carried out second layer encapsulation, and the data after the second layer encapsulation are sent to described neighbours Spoke;
During by the data of described neighbours Spoke after receiving second layer encapsulation, separate the data after second layer encapsulation obtains the ground floor encapsulation, and the data after the ground floor encapsulation are sent to described purpose Spoke.
5.
The method of claim 1 is characterized in that, described Spoke sends data by the minimum path of Cost value to described purpose Spoke, specifically comprises:
Described Spoke is that described Spoke is during to neighbours Spoke to purpose Spoke in the minimum path of Cost value, by the address, direct tunnel between described Spoke and the neighbours Spoke described data are encapsulated, and carry the public network address of described purpose Spoke in the specific field of the data after encapsulation, and the data after will encapsulating send to described neighbours Spoke;
During by the data of described neighbours Spoke after receiving encapsulation, if the public network address that carries in the discovery specific field is not the public network address of this equipment, the destination address of the data after then will encapsulating is revised as the public network address that carries in the described specific field, and amended data are sent to described purpose Spoke.
6.
A kind of data transmission set based on Dynamic VPN network DVPN is applied to comprise in the network of a plurality of Spoke that as Spoke it is characterized in that, described equipment comprises:
Maintenance module is used for maintenance of neighbor expense Cost table, has recorded the Cost value between this equipment and the neighbours Spoke in the described neighbours Cost table;
The message sending module is used for sending expense request Cost Request message, the information of having carried purpose Spoke in the described Cost Request message to neighbours Spoke; After receiving described Cost Request message, utilize the neighbours Cost table of the information inquiry local maintenance of described purpose Spoke by described neighbours Spoke, obtain the Cost value between this equipment and the described purpose Spoke;
Receiver module is used for receiving the expense response Cost Response message that neighbours Spoke returns, and has carried the Cost value between described neighbours Spoke and the purpose Spoke in the described Cost Response message;
Comparison module is used for relatively the extremely described neighbours Spoke Cost value between the described purpose Spoke extremely of the Cost value between this equipment and described purpose Spoke and this equipment;
Data transmission blocks is used for when needs send data to described purpose Spoke, and the path minimum by the Cost value sends data to described purpose Spoke.
7.
Equipment as claimed in claim 6 is characterized in that, also includes server in the described network;
Described maintenance module is further used for receiving the registration reply message from described server, and having carried life span ttl value N in the described registration reply message in the process of initiating to register to described server; Neighbours Spoke to this equipment sends keep-alive Keepalive message, has carried described ttl value N in the described Keepalive message; Behind the Keepalive message of receiving from neighbours Spoke, the ttl value M that carries in the acquisition Keepalive message, and determine that the Cost value between this equipment and the neighbours Spoke is (N-M); The information of the described neighbours Spoke of record and the corresponding relation between the described Cost value (N-M) in the neighbours Cost of local maintenance table.
8.
Such as claim 6 or 7 described equipment, it is characterized in that the information of described purpose Spoke comprises the public network address of described purpose Spoke;
Described message sending module, concrete being used for sends the Cost Request message of the public network address that carries described purpose Spoke to neighbours Spoke when needs send data to purpose Spoke.
9.
Equipment as claimed in claim 6 is characterized in that,
Described data transmission blocks, when being further used in the minimum path of Cost value as this equipment to neighbours Spoke to purpose Spoke, by the address, direct tunnel between this equipment and the purpose Spoke described data are carried out the ground floor encapsulation, and by the address, direct tunnel between this equipment and the neighbours Spoke data after the ground floor encapsulation are carried out second layer encapsulation, and the data after the second layer encapsulation are sent to described neighbours Spoke; During by the data of described neighbours Spoke after receiving second layer encapsulation, separate the data after second layer encapsulation obtains the ground floor encapsulation, and the data after the ground floor encapsulation are sent to described purpose Spoke.
10.
Equipment as claimed in claim 6 is characterized in that,
Described data transmission blocks, when being further used in the minimum path of Cost value as this equipment to neighbours Spoke to purpose Spoke, by the address, direct tunnel between this equipment and the neighbours Spoke described data are encapsulated, and carry the public network address of described purpose Spoke in the specific field of the data after encapsulation, and the data after will encapsulating send to described neighbours Spoke; During by the data of described neighbours Spoke after receiving encapsulation, if the public network address that carries in the discovery specific field is not the public network address of this equipment, the destination address of the data after then will encapsulating is revised as the public network address that carries in the described specific field, and amended data are sent to described purpose Spoke.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210507271.7A CN103023783B (en) | 2012-12-03 | 2012-12-03 | A kind of data transmission method and equipment based on DVPN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210507271.7A CN103023783B (en) | 2012-12-03 | 2012-12-03 | A kind of data transmission method and equipment based on DVPN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103023783A true CN103023783A (en) | 2013-04-03 |
| CN103023783B CN103023783B (en) | 2016-06-29 |
Family
ID=47971928
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210507271.7A Active CN103023783B (en) | 2012-12-03 | 2012-12-03 | A kind of data transmission method and equipment based on DVPN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103023783B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105099926A (en) * | 2015-06-30 | 2015-11-25 | 杭州华三通信技术有限公司 | Method and equipment for determining routing overhead |
| CN108259292A (en) * | 2016-12-29 | 2018-07-06 | 华为技术有限公司 | Establish the method and device in tunnel |
| CN110995600A (en) * | 2019-12-10 | 2020-04-10 | 迈普通信技术股份有限公司 | Data transmission method and device, electronic equipment and readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1736064A (en) * | 2002-12-17 | 2006-02-15 | 思科技术公司 | Method and apparatus for advertising a link cost in a data communications network |
| US20070206597A1 (en) * | 2006-03-01 | 2007-09-06 | Rajiv Asati | Methods and apparatus for providing an enhanced dynamic multipoint virtual private network architecture |
| US20070255812A1 (en) * | 2006-05-01 | 2007-11-01 | Cisco Technology, Inc. | Ospf optimization for hub and spoke environment |
| US20100061246A1 (en) * | 2008-09-10 | 2010-03-11 | Cisco Technology,Inc. | Transit prevention in hub-and-spoke topologies using link state protocols |
| CN102594678A (en) * | 2012-02-15 | 2012-07-18 | 杭州华三通信技术有限公司 | Method for large-scale networking of dynamic virtual private network (DVPN) and client |
-
2012
- 2012-12-03 CN CN201210507271.7A patent/CN103023783B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1736064A (en) * | 2002-12-17 | 2006-02-15 | 思科技术公司 | Method and apparatus for advertising a link cost in a data communications network |
| US20070206597A1 (en) * | 2006-03-01 | 2007-09-06 | Rajiv Asati | Methods and apparatus for providing an enhanced dynamic multipoint virtual private network architecture |
| US20070255812A1 (en) * | 2006-05-01 | 2007-11-01 | Cisco Technology, Inc. | Ospf optimization for hub and spoke environment |
| US20100061246A1 (en) * | 2008-09-10 | 2010-03-11 | Cisco Technology,Inc. | Transit prevention in hub-and-spoke topologies using link state protocols |
| CN102594678A (en) * | 2012-02-15 | 2012-07-18 | 杭州华三通信技术有限公司 | Method for large-scale networking of dynamic virtual private network (DVPN) and client |
Non-Patent Citations (1)
| Title |
|---|
| 梁玉柱: ""基于DMVPN技术的广域网设计和实现"", 《信息系统工程》, no. 2, 20 February 2012 (2012-02-20), pages 119 - 120 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105099926A (en) * | 2015-06-30 | 2015-11-25 | 杭州华三通信技术有限公司 | Method and equipment for determining routing overhead |
| CN105099926B (en) * | 2015-06-30 | 2019-03-15 | 新华三技术有限公司 | A kind of routing cost determines method and apparatus |
| CN108259292A (en) * | 2016-12-29 | 2018-07-06 | 华为技术有限公司 | Establish the method and device in tunnel |
| CN110995600A (en) * | 2019-12-10 | 2020-04-10 | 迈普通信技术股份有限公司 | Data transmission method and device, electronic equipment and readable storage medium |
| CN110995600B (en) * | 2019-12-10 | 2021-12-17 | 迈普通信技术股份有限公司 | Data transmission method and device, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103023783B (en) | 2016-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103036809B (en) | For having the method and apparatus of the scalable network that active link utilizes | |
| JP5565981B2 (en) | Domain selection method and system for incoming calls | |
| CN103166858B (en) | A kind of message transmitting method and equipment | |
| CN101765228B (en) | Recovery method of CAPWAP tunnel and device thereof | |
| CN105430059A (en) | Smart client routing | |
| CN113596191B (en) | Data processing method, network element equipment and readable storage medium | |
| CN103209108B (en) | A kind of route generating method based on DVPN and equipment | |
| KR100677591B1 (en) | Terminal having a function of hand-over between different networks based on stream control transmission protocol and hand-over method of the same | |
| CN102355479B (en) | Method and equipment for forwarding traffic of multi-NAT (network address translation) gateway | |
| CN102739541B (en) | The method, apparatus and system of a kind of routing function startup and transfer of data | |
| CN101640882B (en) | Method and device for preventing flow from breaking | |
| CN103905284A (en) | EVI-network-based flow load sharing method and device | |
| WO2011106984A1 (en) | Method for transmitting data in parallel by mobile terminal and mobile terminal thereof | |
| CN103747470A (en) | Methods and apparatus for controlling wireless access points | |
| JP2010028422A (en) | Gateway | |
| CN103023667A (en) | Multicast data transmission method and device based on dynamic virtual private network (DVPN) | |
| CN101772193A (en) | Method, system and mobile access gateway for optimizing local routing | |
| CN103957161A (en) | Packet forwarding method and device | |
| CN103220228A (en) | Method and equipment for sending border gateway protocol (BGP) routes | |
| CN104994022A (en) | Message transmission method and service board | |
| CN103139075A (en) | Message transmission method and device | |
| CN103023783A (en) | Dynamic virtual private network (DVPN) based data transmission method and device | |
| CN102369764A (en) | System and method operable to enable shortest connection route | |
| CN105264958B (en) | A kind of method and device of bearer circuit voice service | |
| CN105337746A (en) | Multicast data transmission method and apparatus |
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 | ||
| CP03 | Change of name, title or address |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Patentee after: NEW H3C TECHNOLOGIES Co.,Ltd. Address before: 310053 Hangzhou hi tech Industrial Development Zone, Zhejiang province science and Technology Industrial Park, No. 310 and No. six road, HUAWEI, Hangzhou production base Patentee before: HANGZHOU H3C TECHNOLOGIES Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230625 Address after: 310052 11th Floor, 466 Changhe Road, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: H3C INFORMATION TECHNOLOGY Co.,Ltd. Address before: 310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466 Patentee before: NEW H3C TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |