ISCAS OpenIR
network address translation traversal based on bernoulli laws of largenumber in p2p streaming system
Ren Hao; Wang Jinlin
2011
SourceHigh Technology Letters
ISSN1006-6748
Volume17Issue:4Pages:401-406
English AbstractP2P streaming application must realize network address translation (NAT) traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN (UPUN) and port-mapping sample estimation (PMSE) algorithm are recommended in this paper. UPUN is the combination of UPnP and STUN, and PMSE utilizes port mapping samples added by symmetric NAT for different sessions to estimate regularity of port mapping of symmetric NAT, which takes advantage of the Bernoulli law of large numbers. Besides, for the situation that both peers are behind NAT, and to handle heavy relay server load when many inner peers want to communicate with each other, a peer auxiliary-relay (PAR) algorithm is presented. PAR lets outer peers with sufficient bandwidth act as relay servers to alleviate pressure of real server, which could avoid NAT traversal failure caused by single point failure of relay server. Finally, experiments show that the proposed algorithms could improve the success ratio significantly for NAT traversal in P2P streaming application as well as improve P2P streaming application applicability. © by HIGH TECHNOLOGY LETTERS PRESS.; P2P streaming application must realize network address translation (NAT) traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN (UPUN) and port-mapping sample estimation (PMSE) algorithm are recommended in this paper. UPUN is the combination of UPnP and STUN, and PMSE utilizes port mapping samples added by symmetric NAT for different sessions to estimate regularity of port mapping of symmetric NAT, which takes advantage of the Bernoulli law of large numbers. Besides, for the situation that both peers are behind NAT, and to handle heavy relay server load when many inner peers want to communicate with each other, a peer auxiliary-relay (PAR) algorithm is presented. PAR lets outer peers with sufficient bandwidth act as relay servers to alleviate pressure of real server, which could avoid NAT traversal failure caused by single point failure of relay server. Finally, experiments show that the proposed algorithms could improve the success ratio significantly for NAT traversal in P2P streaming application as well as improve P2P streaming application applicability. © by HIGH TECHNOLOGY LETTERS PRESS.
Indexed TypeEI
KeywordAlgorithms Estimation Mapping
Department(1) National Network New Media Engineering and Technology Research Center Institute of Acoustics Chinese Acad. of Sci. Beijing 100190 China; (2) Graduate University of Chinese Acad. of Sci. Beijing 100190 China; (3) State Nuclear Power software Development Center Beijing 100029 China
Language英语
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/16165
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Ren Hao,Wang Jinlin. network address translation traversal based on bernoulli laws of largenumber in p2p streaming system[J]. High Technology Letters,2011,17(4):401-406.
APA Ren Hao,&Wang Jinlin.(2011).network address translation traversal based on bernoulli laws of largenumber in p2p streaming system.High Technology Letters,17(4),401-406.
MLA Ren Hao,et al."network address translation traversal based on bernoulli laws of largenumber in p2p streaming system".High Technology Letters 17.4(2011):401-406.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ren Hao]'s Articles
[Wang Jinlin]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ren Hao]'s Articles
[Wang Jinlin]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ren Hao]'s Articles
[Wang Jinlin]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.