Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電機工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37094
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor雷欽隆
dc.contributor.authorChi-Jui Changen
dc.contributor.author張其叡zh_TW
dc.date.accessioned2021-06-13T15:19:06Z-
dc.date.available2008-07-26
dc.date.copyright2008-07-26
dc.date.issued2008
dc.date.submitted2008-07-24
dc.identifier.citation[1] S. Baset and H. Schulzrinne. An analysis of the Skype peer-to-peer internet
telephony protocol. In INFOCOM. IEEE, 2006.
[2] C.-M. Cheng, Y.-S. Huan, H. T. Kung, and C.-H.Wu. Path probing relay
routing for achieving high end-to-end performance. In Global
Telecommunications Conference, 2004. GLOBECOM ’04. IEEE, volume 3, pages
1359–1365, 2004.
[3] Defense Advanced Research Projects Agency. Request for Comments 793.
Transmission Control Protocol. Internet Engineering Task Force Documents,
1981.
[4] eBay Inc. First quarter 2008 results.
http://investor.ebay.com/financial releases.cfm.
[5] T. Fei, S. Tao, L. Gao, and R. Gu´erin. How to select a good alternate path in
large peer-to-peer systems? In INFOCOM. IEEE, 2006.
[6] T. Fei, S. Tao, L. Gao, R. Gu´erin, and Z.-L. Zhang. Light-weight overlay path
selection in a peer-to-peer environment. In INFOCOM. IEEE, 2006.
[7] B. Ford, P. Srisuresh, and D. Kegel. Peer-to-peer communication across
network address translators. In USENIX Annual Technical Conference, pages
179–192, 2005.
[8] S. Guha and N. Daswani. An experimental study of the Skype peer-to-peer
VoIP system. Technical report, Cornell University, Dec. 16 2005.
[9] X. Hei and H. Song. Stochastic relay routing in peer-to-peer networks. In
Proceedings 41st IEEE International Conference on Communications, 2006.
[10] ITU-T Recommandation. G. 107. The E-Model, a Computational Model for
Use in Transmission Planning. International Telecommunication Union,
CHGenf, 2002.
[11] V. Jacobson. Congestion avoidance and control. In Proceeding of ACM
SIGCOMM, August 1988.
[12] L. Liu and R. Zimmermann. Adaptive low-latency peer-to-peer streaming
and its application. Multimedia Systems, 11(6):497–512, 2006.
[13] Y. Liu, Y. Gu, H. Zhang,W. Gong, and D. Towsley. Application level relay for
high-bandwidth data transport. In The First Workshop on Networks for Grid
Applications (GridNets), San Jose, October 2004.
[14] S. McCanne and V. Jacobson. The BSD packet filter: A new architecture for
user-level packet capture. In Proceedings of USENIX’93, pages 259–270, 1993.
[15] J. Nagle. Congestion control in IP/TCP internetworks. Computer
Communication Review, 14(4):11–17, Oct. 1984.
[16] M. Narbutt, A. Kelly, L. Murphy, and P. Perry. Adaptive voIP playout
scheduling: Assessing user satisfaction. IEEE Internet Computing, 9(4):28–34,
2005.
[17] R. Ramjee, J. F. Kurose, D. F.Towsley, and H. Schulzrinne. Adaptive playout
mechanisms for packetized audio applications in wide-area networks. In
INFOCOM, pages 680–688, 1994.
[18] S. Ren, L. Guo, and X. Zhang. ASAP: an AS-aware peer-relay protocol for
high quality voIP. In Proceedings of ICDCS, pages 70–79, 2006.
[19] J. Rosenberg, R. Mahy, and C. Huitema. Traversal Using Relay NAT (TURN).
draft-rosenberg-midcom-turn-05 (work in progress), July, 2004.
[20] B. Sat and B. W.Wah. Playout scheduling and loss-concealments in voip for
optimizing conversational voice communication quality. In Proceedings of
Multimedia’07, pages 137–146, New York, NY, USA, 2007. ACM.
[21] C. Schensted. Longest increasing and decreasing subsequences. Canad. J.
Math., 13:179–191, 1961.
[22] Skype Technologies S.A. http://www.skype.com.
[23] H. Zhang, L. Tang., and J. Li. Impact of Overlay Routing on End-to-End
Delay. In Proceedings of ICCCN, pages 435–440, 2006.
[24] R. Zimmermann, B. Seo, L. Liu, R. Hampole, and B. Nash. Audiopeer: A
collaborative distributed audio chat system. Distributed Multimedia Systems,
San Jose, CA, 2004.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37094-
dc.description.abstract本論文以統計探討兩種學術界極少著墨的同儕介接技術之缺陷:一、雙介接,即一通網路電話的兩個方向使用相異的介接點,可能導致介接路徑於語音品質上的不對稱。本研究所收集的樣本中約三分之一為雙介接,其中百分之四十七因介接點之一不穩定且表現低落而有一定期間的失衡。於用戶端採樣雙介接通話的前數秒,輔以網路電話軟體中即時抽換介接點的功能,能有效防止介接路徑不對稱的情形。二、工作中的介接點帶來的處理延遲會顯著地降低網路電話的品質。受話方緩衝雖然能吸收處理延遲的負面影響,在靜態的緩衝設計下仍有百分之三十一的模擬通話衰退,並且這已是比適應性緩衝來得好的數字。本文定義節點的「忙碌度」配合其當地上班時間判斷其是否勝任介接的角色。為取得必要資料,本研究亦發展出毋須大規模部署的處理延遲量測和計算方法。zh_TW
dc.description.abstractTwo of the rarely discussed hazards of peer-to-peer relaying are statistically analyzed in this thesis under a voice-over-IP context: 1) Relay path asymmetry in voice quality is a potential consequence of bi-relaying, or using two distinct relays for the opposite directions of the same call. About one third of all relayed calls collected are bi-relayed, and 47% of them are unbalanced for a significant portion of time, mostly due to the instability and poor performance of one of the two relays. Client sampling through the first seconds of a bi-relayed call combined with the voice-over-IP application’s feature to hot-swap relays form a proved method to avoid relay path asymmetry. 2) Processing delay on a loaded relay can serious degrade an Internet telephone call. Playout buffers absorb some of the negative impact of processing delays, but still 31% of the calls simulated suffered with the static scheme, which generally outperforms adaptive buffers. Busy level is the proposed indicator of whether a peer node is too occupied to relay, along with its local work hour. A novel methodology is devised to collect the necessary traces for computing processing delays without large-scale deployment.en
dc.description.provenanceMade available in DSpace on 2021-06-13T15:19:06Z (GMT). No. of bitstreams: 1
ntu-97-R95921023-1.pdf: 969532 bytes, checksum: c721dbbffe2aeaeb08833b791ecd068d (MD5)
Previous issue date: 2008
en
dc.description.tableofcontentsList of Figures ii
List of Table iii
1 Introduction 1
2 Background 3
2.1 Skype 3
2.2 The E-model 4
2.3 Related Work 5
3 Data Collection 7
3.1 The Method 8
3.2 Post-processing 10
3.3 Trace Summary 12
4 Relay Path Asymmetry 13
4.1 Impact of Bi-relaying 14
4.2 Characterizing Unbalance 18
4.3 Avoiding Relay Path Asymmetry 20
5 Relay Processing Delay 23
5.1 Characterizing Processing Delay 23
5.2 Impact of Processing Delay 25
6 Conclusion 29
dc.language.isoen
dc.subject量測zh_TW
dc.subject同儕網路zh_TW
dc.subject介接點zh_TW
dc.subject網路電話zh_TW
dc.subject語音品質zh_TW
dc.subject路徑不對稱zh_TW
dc.subject處理延遲zh_TW
dc.subjectvoice-over-IPen
dc.subjectprocessing delayen
dc.subjectpath asymmetryen
dc.subjectvoice qualityen
dc.subjectPeer-to-peeren
dc.subjectrelayen
dc.subjectmeasurementen
dc.title同儕介接技術之奧窔-網路電話輯論zh_TW
dc.titleThe Dark Side of Peer-to-Peer Relaying: A Topical Study on Voice-over-IPen
dc.typeThesis
dc.date.schoolyear96-2
dc.description.degree碩士
dc.contributor.oralexamcommittee郭斯彥,黃秋煌,顏嗣鈞,劉立
dc.subject.keyword同儕網路,介接點,網路電話,語音品質,路徑不對稱,處理延遲,量測,zh_TW
dc.subject.keywordPeer-to-peer,relay,voice-over-IP,voice quality,path asymmetry,processing delay,measurement,en
dc.relation.page31
dc.rights.note有償授權
dc.date.accepted2008-07-24
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電機工程學研究所zh_TW
顯示於系所單位:電機工程學系

文件中的檔案:
檔案 大小格式 
ntu-97-1.pdf
  未授權公開取用
946.81 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved