Natcracker: Nat combinations matter
2009 (English)In: Proceedings - International Conference on Computer Communications and Networks, ICCCN, San Francisco, CA, 2009Conference paper (Other academic)
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. Â©2009 IEEE.
Place, publisher, year, edition, pages
San Francisco, CA, 2009.
Network address translators, P2P network, Computer simulation
Other Electrical Engineering, Electronic Engineering, Information Engineering Computer Engineering
IdentifiersURN: urn:nbn:se:kth:diva-32889DOI: 10.1109/ICCCN.2009.5235278ScopusID: 2-s2.0-70449103450OAI: oai:DiVA.org:kth-32889DiVA: diva2:412761
QC 201104262011-04-262011-04-262013-11-22Bibliographically approved