- Volume 15 Number 4 (2024)
- Volume 15 Number 3 (2024)
- Volume 15 Number 2 (2024)
- Volume 15 Number 1 (2024)
- Volume 14 Number 4 (Nov. 2023)
- Volume 14 Number 3 (Aug. 2023)
- Volume 14 Number 2 (May 2023)
- Volume 14 Number 1 (Feb. 2023)
- Volume 13 Number 4 (Nov. 2022)
- Volume 13 Number 3 (Aug. 2022)
- Volume 13 Number 2 (May 2022)
- Volume 13 Number 1 (Feb. 2022)
- Volume 12 Number 4 (Nov. 2021)
- Volume 12 Number 3 (Aug. 2021)
- Volume 12 Number 2 (May. 2021)
- Volume 12 Number 1 (Feb. 2021)
- Volume 11 Number 6 (Dec. 2020)
- Volume 11 Number 5 (Oct. 2020)
- Volume 11 Number 4 (Aug. 2020)
- Volume 11 Number 3 (Jun. 2020)
- Volume 11 Number 2 (Apr. 2020)
- Volume 11 Number 1 (Feb. 2020)
- Volume 10 Number 6 (Dec. 2019)
- Volume 10 Number 5 (Oct. 2019)
- Volume 10 Number 4 (Aug. 2019)
- Volume 10 Number 3 (Jun. 2019)
- Volume 10 Number 2 (Apr. 2019)
- Volume 10 Number 1 (Feb. 2019)
- Volume 9 Number 6 (Dec. 2018)
- Volume 9 Number 5 (Oct. 2018)
- Volume 9 Number 4 (Aug. 2018)
- Volume 9 Number 3 (Jun. 2018)
- Volume 9 Number 2 (Apr. 2018)
- Volume 9 Number 1 (Feb. 2018)
- Volume 8 Number 6 (Dec. 2017)
- Volume 8 Number 5 (Oct. 2017)
- Volume 8 Number 4 (Aug. 2017)
- Volume 8 Number 3 (Jun. 2017)
- Volume 8 Number 2 (Apr. 2017)
- Volume 8 Number 1 (Feb. 2017)
- Volume 7 Number 6 (Dec. 2016)
- Volume 7 Number 5 (Oct. 2016)
- Volume 7 Number 4 (Aug. 2016)
- Volume 7 Number 3 (Jun. 2016)
- Volume 7 Number 2 (Apr. 2016)
- Volume 7 Number 1 (Feb. 2016)
- Volume 6 Number 6 (Dec. 2015)
- Volume 6 Number 5 (Oct. 2015)
- Volume 6 Number 4 (Aug. 2015)
- Volume 6 Number 3 (Jun. 2015)
- Volume 6 Number 2 (Apr. 2015)
- Volume 6 Number 1 (Feb. 2015)
- Volume 5 Number 6 (Dec. 2014)
- Volume 5 Number 5 (Oct. 2014)
- Volume 5 Number 4 (Aug. 2014)
- Volume 5 Number 3 (Jun. 2014)
- Volume 5 Number 2 (Apr. 2014)
- Volume 5 Number 1 (Feb. 2014)
- Volume 4 Number 6 (Dec. 2013)
- Volume 4 Number 5 (Oct. 2013)
- Volume 4 Number 4 (Aug. 2013)
- Volume 4 Number 3 (Jun. 2013)
- Volume 4 Number 2 (Apr. 2013)
- Volume 4 Number 1 (Feb. 2013)
- Volume 3 Number 6 (Dec. 2012)
- Volume 3 Number 5 (Oct. 2012)
- Volume 3 Number 4 (Aug. 2012)
- Volume 3 Number 3 (Jun. 2012)
- Volume 3 Number 2 (Apr. 2012)
- Volume 3 Number 1 (Feb. 2012)
- Volume 2 Number 6 (Dec. 2011)
- Volume 2 Number 5 (Oct. 2011)
- Volume 2 Number 4 (Aug. 2011)
- Volume 2 Number 3 (Jun. 2011)
- Volume 2 Number 2 (Apr. 2011)
- Volume 2 Number 1 (Feb. 2011)
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
- ISSN: 2010-0248 (Print)
- Abbreviated Title: Int. J. Innov. Manag. Technol.
- Frequency: Quarterly
- DOI: 10.18178/IJIMT
- Editor-in-Chief: Prof. Jin Wang
- Managing Editor: Ms. Nancy Y. Liu
- Abstracting/ Indexing: Google Scholar, CNKI, Ulrich's Periodicals Directory, Crossref, Electronic Journals Library.
E-mail: editor@ijimt.org
- Article Processing Charge: 500 USD
DOI: 10.7763/IJIMT.2012.V3.226
How Practical Are TCP NAT Traversal Schemes?
Abstract—Peer-to-peer (P2P) communication has emerged as the mainstream of network applications. However, Network Address Translation (NAT) is a barrier to P2P applications and induces NAT traversal problems. TCP NAT traversal is more complicated than that of UDP. Two hosts must perform a three-way handshake procedure to establish a TCP connection and most NAT devices implement TCP state tracking mechanisms to trace TCP stages. This article aims to introduce and verify the applicability of four common TCP NAT traversal schemes including SNT, SLT, P2PNAT and ESi. According to the experiment results, we observe that each TCPNAT traversal scheme generates a specific packet sequence and is suitable for some specific NAT devices. No single scheme works well in every situation since NAT behavior is not standardized. Therefore, there should be a complete behavior test for NAT devices. With NAT behavior information, two hosts can choose a proper scheme for establishing a direct connection.
Index Terms—Network address translation, NAT, NAT Traversal, TCP, TCP NAT traversal.
The authors are with the Department of Computer Science, National Chiao Tung University (e-mail: cllin@cs.nctu.edu.tw; Tel: +886-3-5712121ext.54792; fax: +886-3-5721490) .
Cite: Chien-Chao Tseng and Chia-Liang Lin,"How Practical Are TCP NAT Traversal Schemes?," International Journal of Innovation, Management and Technology vol. 3, no. 3, pp. 221-225 , 2012.