Change search
ReferencesLink to record
Permanent link

Direct link
NATCracker: NAT Combinations Matter
Number of Authors: 3
2010 (English)Conference paper (Refereed)
Abstract [en]

In this paper, we report our experience in working with Network Address Translators (NATs). Traditionally, there were only 4 types of NATs. For each type, the (im)possibility of traversal is well-known. Recently, the NAT community has provided a deeper dissection of NAT behaviors resulting into at least 27 types and documented the (im)possibility of traversal for some types. There are, however, two fundamental issues that were not previously tackled by the community. First, given the more elaborate set of behaviors, it is incorrect to reason about traversing a single NAT, instead combinations must be considered and we have not found any study that comprehensively states, for every possible combination, whether direct connectivity with no relay is feasible. Such a statement is the first outcome of the paper. Second, there is a serious need for some kind of formalism to reason about NATs which is a second outcome of this paper. The results were obtained using our own scheme which is an augmentation of currently-known traversal methods. The scheme is validated by reasoning using our formalism, simulation and implementation in a real P2P network.

Place, publisher, year, edition, pages
2010, 9.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-23788OAI: oai:DiVA.org:ri-23788DiVA: diva2:1042865
Conference
19th International Conference on Computer Communications and Networks
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(725 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 725 kBChecksum SHA-512
eae203bcfd8fc2c0c9f87c2c96bbec1f0f1f548c18dfa423f2296985f0c45a11ae99711d87ed56d40371205da3eb75b3cb90c87b977518981a331cf9fd49a04f
Type fulltextMimetype application/pdf

Other links

http
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link