计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2009年
24期
81-83
,共3页
交互式连通建立%会话初始协议%网络地址转换%候选
交互式連通建立%會話初始協議%網絡地阯轉換%候選
교호식련통건립%회화초시협의%망락지지전환%후선
Interactive Connectivity Establishment(ICE)%Session Initiation Protocol(SIP)%Network Address Translator(NAT)%candidate
基于交互式连通建立草案协议,综合运用网络地址转换(NAT)会话穿越工具和中继穿越工具,设计一个媒体流穿越NAT的算法实例.使用请求/应答交互方式,探索通信双方NAT拓扑部署,通过排序算法找到并选择一条最优的传输路径.在Linux下进行编程测试,能使媒体流较好地穿越不同拓扑部署的NAT.
基于交互式連通建立草案協議,綜閤運用網絡地阯轉換(NAT)會話穿越工具和中繼穿越工具,設計一箇媒體流穿越NAT的算法實例.使用請求/應答交互方式,探索通信雙方NAT拓撲部署,通過排序算法找到併選擇一條最優的傳輸路徑.在Linux下進行編程測試,能使媒體流較好地穿越不同拓撲部署的NAT.
기우교호식련통건립초안협의,종합운용망락지지전환(NAT)회화천월공구화중계천월공구,설계일개매체류천월NAT적산법실례.사용청구/응답교호방식,탐색통신쌍방NAT탁복부서,통과배서산법조도병선택일조최우적전수로경.재Linux하진행편정측시,능사매체류교호지천월불동탁복부서적NAT.
An algorithm instance is designed about traversing Network Address Translator(NAT) for media streams, in which Session Traversal Utilities for NAT(STUN) and Traversal Using Relays around NAT(TURN) based on the Interactive Connectivity Establishment(ICE) are used synthetically. The algorithm explores the NAT topology for peer by the request/response interaction and finds the best path. The program test on Linux proves that media streams are able to pass through various topologies of NAT deployment.
