CN100428741C - Communication method - Google Patents

Communication method Download PDF

Info

Publication number
CN100428741C
CN100428741C CNB2006100586297A CN200610058629A CN100428741C CN 100428741 C CN100428741 C CN 100428741C CN B2006100586297 A CNB2006100586297 A CN B2006100586297A CN 200610058629 A CN200610058629 A CN 200610058629A CN 100428741 C CN100428741 C CN 100428741C
Authority
CN
China
Prior art keywords
user side
port
hopping
burrows
server
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.)
Active
Application number
CNB2006100586297A
Other languages
Chinese (zh)
Other versions
CN1859314A (en
Inventor
何文彬
孙志斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNB2006100586297A priority Critical patent/CN100428741C/en
Priority to PCT/CN2006/002869 priority patent/WO2007048344A1/en
Publication of CN1859314A publication Critical patent/CN1859314A/en
Priority to US12/110,656 priority patent/US7783768B2/en
Application granted granted Critical
Publication of CN100428741C publication Critical patent/CN100428741C/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The present invention provides a communication method for establishing connection between a first user end and a second user end. The first user end is connected with a server through an asymmetric NAT, and the second user end is connected with the server through a symmetric NAT. The present invention comprises: a. when the first user end requests to establish connection with the second user end, the second user end transmits data packets to different ports of the server through the symmetric NAT so as to update a port jump list on the server; b. when the jump law in the port jump list is the regular jump, the second user end makes holes according to the jump law so as to establish the connection between the first user end and the second user end.

Description

Communication means
Technical field
The present invention relates to a kind of communication means, particularly a kind of communication means that can make that user side also can be realized point-to-point intercommunication in symmetric form NAT.
Background technology
NAT (network address translater) produces under the situation about lacking day by day in internet IP address, and its main purpose is exactly for can address reuse.The source IP address that NAT is responsible for IP packet that the computer of some Intranet IP address is sent to external network is converted to the IP address of the public network of NAT oneself, and purpose IP address is constant, and the IP packet is transmitted to router, finally arrives outside computer.The purpose IP address transition of being responsible for the IP packet that the computer with the outside returns simultaneously is the IP address of Intranet, and source IP address is constant, and finally is delivered to the computer in the Intranet.
NAT is divided into two big classes, basic NAT and NAPT (Network Address/Port Translator, the network address/port converter).Basic NAT can change the former IP address in the IP bag, but can not change the port in the IP bag.NAPT not only can change the IP address through the IP datagram of this NAT device, also can change TCP/UDP (User Datagram Protoco (UDP)) port of IP datagram.Characteristics by the NAPT online have determined and can only initiatively initiated to connect to the main frame of NAPT outside by the computer in the NAPT that outside main frame is thought directly and the computer in the NAPT directly connects is not allowed to.
So digital information passing through NAT/FW (fire compartment wall) is that internet goes up types of applications, particularly P2P (point-to-point) application, the often right problem of demand side.
For following several situations, better solution has been arranged at present:
1, transmit leg, recipient have an orientation at least in public network.
2, transmit leg, recipient are positioned at Cone (pyramid type) NAT (comprising Full Cone, RestrictedCone, Port Restricted Cone).
But if following situation, the scheme that adopts generally all is to carry out transfer by server at present, and can't realize real P2P communication.
Sequence number Transmit leg (Clien1) NAT type Recipient (Clien2) NAT type
1 Symmetric (symmetric form) NAT Symmetric NAT
2 Port Restricted Cone (port restricted pyramid type) NAT Symmetric NAT
3 Symmetric NAT Port Restricted Cone NAT
So make digital information penetrate Port Restricted Cone and symmetric Cone as far as possible, making between client directly interconnectedly to have practical meaning.
STUN (Simple Traversal of User Datagram Protocol (UDP) ThroughNetwork Address Translators (NATs)) agreement is by RFC 3489 definition, its operation principle is by STUN client and the server group communication that is placed on the public network, return client IP and address to client, client is judged the position of oneself by the feedback result under the multiple situation.Though STUN proposes in MIDCOM working group, do not need NAT to support.
Client is known own residing positional information, is all bases of passing through scheme.
At first we describe the routing address mapping relations table of Intranet, in fact at every turn when a certain the machine that is in an Intranet outwards sent out data, in fact carried out a mapping of Intranet IP address and outer net IP address+port numbers, simply be exemplified below:
(192.168.1.1 local area network (LAN))---------------------------------PORT1 (outer net)
(192.168.1.2 local area network (LAN))---------------------------------PORT2 (outer net)
When we are that 192.168.1.2 is when outwards sending out data once more, his source address in fact outside 192.168.1.2 changes into an online public IP+ distribute PORT temporarily, if CONENAT will keep original port PO RT2 constant so, if Symmetric is NAT, saltus step will take place in port, but in any case, corresponding routing relation between an Intranet IP and outer net port will be had.
Further understand: inner certain main frame (such as: 192.168.1.2) to certain IP of outside (such as: 219.237.60.1) send a UDP bag, so just on the NAT device of this Intranet, beaten " hole " that direction is 219.237.60.1, external equipment (219.237.60.1) just can have been got in touch by the 192.168.0.10 of this hole and Intranet later on, but the IP of other Intranets can not utilize this hole.
If two equipment that all are among the Cone NAT, then they connect (with reference to Fig. 1) in the following way each other.
At first, user side 1 logon server, NAT1 are that current session has distributed a port, and such as 60000, the address of the user side 1 received of server is 202.187.45.3:60000 so, the outer net address of Here it is user side 1.Equally, the port that user side 2 logon servers, NAT2 distribute for this session, such as 40000, server 2 the address of receiving is 187.34.1.56:40000 so.
At this moment, user side 1 and user side 2 can be with server communications.If user side thinks directly to send information to user side 21 this moment, he can obtain the public network address 187.34.1.56:40000 of user side 2 from server there so, what we needed now is to make a call to the hole that a direction is 202.187.45.3 (being the outer net address of user side 1) on NAT2, user side 1 sends to the information of 187.34.1.56:40000 so, and user side 2 just can have been received.
Because have only server to keep communicating by letter with user side 2.So this operation that burrows is sent by server indication user side 2.That is, if user side 1 wants that to user side 2 transmission information user side 1 sends order to server so, request server order user side 2 burrows to user side 1 direction.
Above process only is suitable for the situation of Cone NAT, if Symmetric is NAT, has redistributed to the port that user side 1 burrows when user side 2 so, and user side 2 can't be known this port.
Summary of the invention
Even the objective of the invention is to propose an a kind of side for also realizing the communication means of point-to-point intercommunication under the situation of symmetric form NAT.
According to the communication means that connects at first user side and second user side of being used for of the present invention, wherein, first user side is connected with server by asymmetric form NAT, and second user side is connected with server by symmetric form NAT.This method comprises: step a, and when the first user side request and second user side connected, second user side sent packet by symmetric form NAT to the different port of server, the port-hopping tabulation on the update service device; Step b, when the saltus step rule was the rule saltus step in the port-hopping tabulation, second user side burrowed according to this saltus step rule, sets up the connection between first user side and second user side; Step c, when the saltus step rule was the revocable saltus step of weighted value in the port-hopping tabulation, second user side adopted the circulation retransmission mechanism to burrow, until the connection of setting up between first user side and second user side.
According to communication means of the present invention, when the port-hopping rule is the rule saltus step, can set up the point-to-point connection between first user side and second user side.
Description of drawings
The communication system that Fig. 1 links to each other with server by NAT respectively for two users' end.
Fig. 2 is the flow chart according to method of attachment of the present invention.
Fig. 3 is the flow chart of rule saltus step and weighted value method of attachment fixedly the time for port-hopping.
Fig. 4 is the not flow chart of method of attachment fixedly time of rule saltus step but weighted value for port-hopping.
Embodiment
The present invention realizes that by udp port saltus step prediction client also can realize the method for P2P intercommunication in symmetric NAT.
Mainly there are 3 kinds of modes in the saltus step of symmetric nat port:
1, rule saltus step, as N+M, N+2M, N+3M, weights M fixes
2, compare rule, increase in a period of time the inside always, perhaps reduce always, the weights of change are fixing.
3, irregular fully, but do not have any rule begin increase, after a while, reduce such as 5467,3210,9971,10031 4998... again
The existing network greatly port-hopping of symmetric NAT belongs to preceding two kinds of situations, and the port that saltus step in most cases can not occur than saltus step before little situation.
For the situation of irregular saltus step, the mode by transit server transmits file.But, then can realize the interconnection of two users' end by method of the present invention for above-mentioned situation 1 and 2.
With reference to Fig. 2, the method that realizes the P2P intercommunication according to of the present invention between user side 1 and user side 2 is described, wherein user side 2 links to each other with server by symmetric form (symmetric) NAT.
At first, in step S201, the application that the user side 1 that user 1 uses connects to the user side 2 that server is filed a request and user 2 uses.
In step S202, server is prepared several listening ports number, and the client 2 that notice is in symmetric form NAT sends packets to these several listening ports, and these message bags are during by NAT, and saltus step all takes place the source address port.Server updates stored in the port-hopping tabulation on the server according to the packet that receives, and analyzes the saltus step rule according to this port-hopping tabulation.
In step S203, server judges whether this saltus step rule is irregular port-hopping.When definite this saltus step rule is irregular port-hopping, execution in step S210.Otherwise, when definite this saltus step rule is the port-hopping of rule, execution in step S204.
In step S204, server judges further whether the port-hopping of this rule is the fixing saltus step of weighted value.During the saltus step that if definite this rule saltus step is a weighted value to be fixed, execution in step S205.Otherwise execution in step S206.
In step S205, server requirement user side 2 carries out N+M and burrows, and wherein N is the port of the last saltus step in step S202, and M is the weighted value of determining in step S204.
If it is fixing that port-hopping is rule saltus step but weighted value, then in step S206, adopt the linear strategy that approaches.Promptly, server requirement user side 2 carries out for, and (i=N N+U) burrows, and wherein N is the port of the last saltus step in step S202, U analyzes a numerical value of determining in step 204, this numerical value is the value greater than the difference of the adjacent port that burrows before and after any in the port-hopping tabulation.That is to say that user side 2 carries out N, N+1 ..., N+U burrows.In the present invention, (i=A, B) expression second user side carries out port A burrowing to B to formula for.
After having carried out step S205 or S206, server requires user side 1 by the burrowing of user side 2 in step S205 or S206 in step S207, carries out connection between the two.That is to say, when weighted value is fixing weighted value M, and carried out after the step S205 that user side 1 is to the public network address of user side 2: port (this port is N+M) sends packet; When weighted value is revocable weighted value, and carried out after the step S206, user side 1 is to the public network address of user side 2: port (this port is N, N+1 ..., N+U) send packet.In step S208, whether successfully determine to connect.If success, then processing finishes.If not success, execution in step S209 then, determine to connect retry whether executed X time.Carried out X time if determine to connect retry, then execution in step S210.Otherwise return step S203.
In step S210, determine that whether port has upgraded retry Y time.If not, then return step S202.If, execution in step S211 then.In step S211, utilize the transit server mode to connect user side 1 and user side 2.
The effect of step S209 and S210 is the situation that causes packet loss in order to prevent that network is unusual, and the value of X and Y is generally less, for example value 2 or 3.
In addition, for weighted value is the situation of revocable weighted value, when the connection of not setting up among the step S207 between user side 1 and the user side 2, can further require user side 2 to carry out for (i=N, N+U * 2) burrow, carry out connection between user side 1 and the user side 2 etc. then.This situation will be described in detail in the description of reference Fig. 4.
Below, with reference to Fig. 3, be described in greater detail in the communication means of carrying out under the situation of symmetricNAT of the fixing rule saltus step port of weighted value.
User side 1 is to the connection request of server transmission with user side 2.Server receives after this connection request, sends to user side 2 and upgrades the port-hopping list request.When user side 2 received this renewal port-hopping list request, the different port transmission packet to server updated stored in the port-hopping tabulation on the server.Server is the rule saltus step according to the definite port-hopping of port-hopping tabulation, and weighted value is fixed as M.Server requests user side 2 carries out N+M (N is the port of last saltus step when upgrading the saltus step rule) and burrows, and sets up being connected of user side 1 and user side 2.Concrete, server requests user side 2 sends packet to user side 1 public network IP: Port (it is the port that user side 1 distributes for NAT1), and simultaneously, request user side 1 sends packet to user side 2 public network IP: Port (N+M).
Such as, NAT1 (202.187.45.3) is that user side 1 distributes udp port 62000, NAT2 (187.34.1.56) is that user side 2 distributes udp port 31000.By with the dialogue of server, user side 1 and user side 2 have all been known public network IP and the port that the other side is shone upon mutually.
When user side 1 request was connected with user side 2, it sent request to server.Server requests user side 2 sends packet to the different port of this server, upgrades the port-hopping tabulation.Suppose that the port-hopping tabulation after upgrading is: 31001,31002,31003,31004.From this port-hopping tabulation as can be seen, the port-hopping rule is that weighted value is 1 rule saltus step.Afterwards, server requests user side 2 sends packet to user side 1 public network 202.187.45.3:62000, is used for setting up on NAT2 the session corresponding relation; And server requests user side 1 is to user side 2 public network 187.34.1.56:31005 (31004+1 (weighted value)).Thereby,, set up the connection between user side 1 and the user side 2 by above-mentioned steps.
Below, with reference to Fig. 4, be described in greater detail in the operating process in the above-mentioned situation 2.
Symmetric form NAT in port-hopping rule many times is: on the basis of original port (N), directly at every turn+M (being above-mentioned situation 1); It is not fixing (being above-mentioned situation 2) that but a lot of situation M are also arranged.
For example, it is 3245 that the other side's port has just begun, and trend may be:
3,245 3,256 6,788 9,876 9978 (the each examples that increase of port number); Or
3,245 1,234 1,232 1,100 1000 (examples that port number reduces at every turn).
Can guess the port that change next time by the mode that the circulation retransmission mechanism is soundd out.
The example that increases progressively for above-mentioned port number, the simplest exploration mode is to send UDP from 9978-65535 (maximum port number), can guarantee successful connection substantially like this, but expense is excessive, just need in this example to send 65535-9978=55557 packet, obviously improper.Even according to the packet capturing analysis, the port after 30000 is seldom opened, and can improve and send UDP from 9978--30000, and even so expense is also still excessive.
Further optimize, analyze each trend that increases progressively, such as: 32453256678898769978 can from after once deduct and learn the previous difference that variation can not surpass a fixing number, such as 500, next step sends 9978~9978+500 so, and totally 500 bags are soundd out.Can further improve at every turn and increase progressively, send 9978~9978+500 with 500,9978~9978+1000,9978~9978+1500,9978~9978+2000,9978~9978+2500...... sounds out.Because be the mode of UDP, send the back no matter so expense is little, once, hits the other side's port, just connects stable later on.This strategy can be referred to as linear approximation.
It may be noted that the instability owing to network, more multi-link situation about not going up will be a packet loss, burrow so take following mode to carry out many wheels:
for(i=9978...i=9978+500);
for(i=9978...i=9978+1000);
for(i=9978...i=9978+1500);
......
That is to say that in the m wheel, second user side execution N to N+U * m circulates and burrows, wherein N is the port that burrows at last of second user side when analyzing the saltus step rule, and U is the value greater than the difference of the adjacent port that burrows in any front and back in port-hopping is tabulated.Herein, N=9978, U=500.
In this mode, back one is taken turns and has been covered previous round, can avoid causing owing to unstable networks the situation of packet loss effectively.
Certainly, also can adopt in such a way:
for(i=9978...i=9978+500);
for(i=9978...i=9978+1000);
for(i=9978+500...i=9978+1500);
......
That is to say, in the 1st takes turns, second user side is carried out N to N+U circulation and is burrowed, in greater than 1 m wheel, second user side is carried out N+U * (m-2) and is burrowed to N+U * m circulation, the port that burrows at last of second user side when wherein N is for analysis saltus step rule, U are the value greater than the difference of the adjacent port that burrows before and after any in the port-hopping tabulation.Herein, N=9978, U=500.
In this mode, for each port, guarantee at least retry once, this can reduce expense when being avoided packet loss.
If suppose network be, do not consider the situation of packet loss, also can adopt following mode:
for(i=9978...i=9978+500);
for(i=9978+500...i=9978+1000);
for(i=9978+1000...i=9978+1500);
......
That is to say, in the m wheel, second user side is carried out N+U * (m-1) and is burrowed to N+U * m circulation, the port that burrows at last of N second user side when analyzing the saltus step rule wherein, U for greater than in the port-hopping tabulation arbitrarily before and after the value of difference of the adjacent port that burrows.Herein, N=9978, U=500.
In this mode, each port is only once connected trial.
In first kind of above-mentioned mode is example, with reference to Fig. 4, describes the flow process of this communication means in detail.
At first, user side 1 is to the connection request of server transmission with user side 2.Server receives after this connection request, sends to user side 2 and upgrades the port-hopping list request.When user side 2 received this renewal port-hopping list request, the different port transmission packet to server updated stored in the port-hopping tabulation on the server.Server determines that according to port-hopping tabulation port-hopping is the rule saltus step, and weighted value fix, but the difference of the adjacent port that burrows in any front and back is not more than U.Server requests user side 2 carries out N, N+1 ..., N+U (N is the port of last saltus step when upgrading the saltus step rule) burrows, and sets up being connected of user side 1 and user side 2.Concrete, server requests user side 2 is to user side 1 public network IP: port (it is the port that user side 1 distributes for NAT1) sends packet, simultaneously, request user side 1 is to user side 2 public network IP: (this port is N to port, N+1 ..., N+U) send packet.When this connects and do not have when successful first round.Carry out second connection of taking turns, promptly server requests user side 2 carries out N, N+1 ..., N+U * 2 burrow.If second takes turns and does not also have successful connection, then carry out third round and connect according to such rule, and the like, be not described in detail at this.In the example as shown in Figure 4, connect in third round, the port that connects user side 2 when setting up is X.
Because unstable networks, perhaps other a lot of uncertain factors particularly are in the campus multi-level NAT of this port-hopping of Symmetric NAT or the situation of enterprise network, and the port of registration is not very regular, be sometimes negative as (12345), may be (123﹠amp sometimes; 45), run into such situation, when analyzing the saltus step rule, can not abandon at will that these are unusual, and will do necessary correcting process, change (12345) into as (12345), (123﹠amp; 45) Qu Diao ﹠amp; Change 12345 into.
By this programme, can realize that user side also can realize the method for P2P intercommunication in symmetric NAT, satisfy current P2P demands of applications.

Claims (7)

1. one kind is used for the communication means that connects at first user side and second user side, and wherein, first user side is connected with server by asymmetric form NAT, and second user side is connected with server by symmetric form NAT, and this method comprises:
Step a, when the first user side request and second user side connected, second user side sent packet by symmetric form NAT to the different port of server, the port-hopping tabulation on the update service device;
Step b, when saltus step rule in the port-hopping tabulation was the fixing rule saltus step of weighted value, second user side carried out N+M and burrows, and wherein N is the port that burrows for the last time of second user side in step a, and M is a weighted value;
Step c, when saltus step rule in the port-hopping tabulation was the revocable rule saltus step of weighted value, second user side adopted the circulation retransmission mechanism to burrow, until the connection of setting up between first user side and second user side.
2. communication means as claimed in claim 1, wherein,
Described step c is specially, when port-hopping is the revocable saltus step of weighted value, second user side carries out N to N+U circulation and burrows, until the connection of setting up between first user side and second user side, wherein N is the port that burrows for the last time of second user side in step a, and U is the value greater than the difference of the adjacent port that burrows in any front and back in the port-hopping tabulation.
3. communication means as claimed in claim 1 wherein, also comprises:
When the saltus step rule is irregular saltus step in the port-hopping tabulation, utilize the transit server mode to carry out communication between first user side and second user side.
4. communication means as claimed in claim 1, wherein,
Described step c is specially, and when port-hopping was the revocable saltus step of weighted value, second user side carried out the n wheel and burrows, and until the connection of setting up between first user side and second user side, n is the integer greater than 1,
Wherein, in the m wheel, second user side is carried out N to N+U * m circulation and is burrowed, and wherein N is the port that burrows for the last time of second user side in step a, U is the value greater than the difference of the adjacent port that burrows in any front and back in the port-hopping tabulation, and m is arbitrary integer of 1-n.
5. communication means as claimed in claim 1, wherein,
Described step c is specially, and when port-hopping was the revocable saltus step of weighted value, second user side carried out the n wheel and burrows, and until the connection of setting up between first user side and second user side, n is the integer greater than 1,
Wherein, in the 1st takes turns, second user side is carried out N to N+U circulation and is burrowed, in the m wheel, second user side is carried out N+U * (m-2) and is burrowed to N+U * m circulation, wherein N is the port that burrows for the last time of second user side in step a, and U is the value greater than the difference of the adjacent port that burrows in any front and back in the port-hopping tabulation, and m is arbitrary integer of 2-n.
6. communication means as claimed in claim 1, wherein,
Described step c is specially, and when port-hopping was the revocable saltus step of weighted value, second user side carried out the n wheel and burrows, and until the connection of setting up between first user side and second user side, n is the integer greater than 1,
Wherein, in m wheel, second user side is carried out N+U * (m-1) and is burrowed to N+U * m circulation, and wherein N is the port that burrows for the last time of second user side in step a, U is the value greater than the difference of the adjacent port that burrows in any front and back in the port-hopping tabulation, and m is arbitrary integer of 1-n.
7. as the arbitrary described communication means of claim 1-6, it further comprises:
The step that port in the port-hopping tabulation is revised.
CNB2006100586297A 2005-10-28 2006-03-02 Communication method Active CN100428741C (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CNB2006100586297A CN100428741C (en) 2006-03-02 2006-03-02 Communication method
PCT/CN2006/002869 WO2007048344A1 (en) 2005-10-28 2006-10-26 A method for establishing the peer-to-peer connection, a method device and system for realizing network communication traversal nat
US12/110,656 US7783768B2 (en) 2005-10-28 2008-04-28 Method for establishing peer-to-peer connection, method, apparatus and system for traversing NAT to realize network communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2006100586297A CN100428741C (en) 2006-03-02 2006-03-02 Communication method

Publications (2)

Publication Number Publication Date
CN1859314A CN1859314A (en) 2006-11-08
CN100428741C true CN100428741C (en) 2008-10-22

Family

ID=37298178

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2006100586297A Active CN100428741C (en) 2005-10-28 2006-03-02 Communication method

Country Status (1)

Country Link
CN (1) CN100428741C (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101557388B (en) 2008-04-11 2012-05-23 中国科学院声学研究所 NAT traversing method based on combination of UPnP and STUN technologies
CN103795819B (en) * 2014-01-27 2017-02-01 宁波键一生物科技有限公司 Inter-terminal data transmission method based on NAT in P2P application
CN104010037A (en) * 2014-05-30 2014-08-27 广州金山网络科技有限公司 Communication method and device
CN104853003B (en) * 2015-04-30 2018-05-15 中国人民解放军国防科学技术大学 A kind of address based on Netfilter, port-hopping Realization Method of Communication
TWI595765B (en) * 2015-10-22 2017-08-11 財團法人工業技術研究院 Method and communication device for network address translation traversal
CN109274735B (en) * 2018-09-11 2021-09-14 腾讯科技(深圳)有限公司 Peer-to-peer network connection method and related equipment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004066588A1 (en) * 2003-01-21 2004-08-05 Matsushita Electric Industrial Co., Ltd. A server for managing nat related address information for other servers
CN1547354A (en) * 2003-12-17 2004-11-17 港湾网络有限公司 Optimization method for network address translation rule configuration
CN1739308A (en) * 2003-01-15 2006-02-22 汤姆森许可贸易公司 Network address translation based mobility management

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1739308A (en) * 2003-01-15 2006-02-22 汤姆森许可贸易公司 Network address translation based mobility management
WO2004066588A1 (en) * 2003-01-21 2004-08-05 Matsushita Electric Industrial Co., Ltd. A server for managing nat related address information for other servers
CN1547354A (en) * 2003-12-17 2004-11-17 港湾网络有限公司 Optimization method for network address translation rule configuration

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种基于预测的Symmetric NAT 穿越解决方案. 王止戈,彭宇峰,张苏灵,高传善.计算机工程,第31卷第11期. 2005
一种基于预测的Symmetric NAT 穿越解决方案. 王止戈,彭宇峰,张苏灵,高传善.计算机工程,第31卷第11期. 2005 *

Also Published As

Publication number Publication date
CN1859314A (en) 2006-11-08

Similar Documents

Publication Publication Date Title
CN101385315B (en) Communication using private ip addresses of local networks
US7529255B2 (en) Peer-to-peer multicasting using multiple transport protocols
CN100428741C (en) Communication method
US7590758B2 (en) Peer-to-peer (P2P) connection despite network address translators (NATs) at both ends
US7245622B2 (en) Allowing IPv4 clients to communicate over an IPv6 network when behind a network address translator with reduced server workload
US7328280B2 (en) Peer-to-peer (P2P) connection despite network address translators (NATs) at both ends
CN100521663C (en) Method for crossing network address conversion in point-to-point communication
JP4819953B2 (en) Control tunnel and direct tunnel setting method in IPv4 network-based IPv6 service providing system
CN101822026B (en) Method and device for establishing connection between packet-oriented communication terminals through network address translation unit
JPH11508753A (en) Internet Protocol Filter
CN1711743A (en) Method and apparatus allowing remote access in data networks
JP3835462B2 (en) Information processing apparatus and bubble packet transmission method
CN1863157A (en) Method and apparatus for implementing network communication through NAT
KR100944421B1 (en) Method and apparatus for parameter borrowing for network address translator configuration, and method for self-configuratioin of a nat device, computer-readable medium, and communication network
CN1716941A (en) Method and call server for establishing a bi-directional peer-to-peer communication link
CN103023787A (en) Data center system, data center device and method for providing service
WO2014142278A1 (en) Control device, communication system, communication method, and program
EP2741460A1 (en) A method and a user agent for load balancing within several proxies in a SIP network comprising a router applying network address translation
JP2008258917A (en) Identical nat subordinate communication control system, nat device, identical nat subordinate communication control method, and program
CN104994178A (en) Network address translation method and device
Boucadair Discovering NAT64 IPv6 Prefixes Using the Port Control Protocol (PCP)
US8045579B2 (en) Method for managing communication connections by network address translating (NAT) network nodes
KR101124635B1 (en) Connecting gateway with ipv4/ipv6
CN1980223A (en) Device and method for realizing convertion between two different protocols
JP2006025457A (en) Network management system

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