政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/38548

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/38548

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 113318/144297 (79%)
造访人次 : 50953913 在线人数 : 926

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜寻范围

查询小技巧：

您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果

若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据

进阶搜寻

主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于政大典藏 ‧ 管理

到手机版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/38548

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/38548

题名:	利用同儕網路實現互動式的網路電台 PeerIIR: Peer-to-Peer interactive Internet radio system
作者:	謝東諺
贡献者:	蔡子傑謝東諺
关键词:	網路電台同儕網路
日期:	2009
上传时间:	2010-04-09 14:49:30 (UTC+8)
摘要:	同儕網路(Peer-to-Peer Network)是近年來最熱門的研究領域之一。在此篇論文中，我們利用同儕網路設計了一個互動式的網路電台，其名稱叫做PeerIIR。有別於傳統的網路電台多半是單向的傳輸系統，我們結合了網路電話的技術實現了可以讓許多人互動的網路電台。電台主持人可以邀請其他的共同主持人來一同主持節目。而收聽節目的聽眾，也可以call-in給節目主持人。然而，在主持人、共同主持人或call-in的人同時講話的時候，會同時產生多條聲音串流來佔用網路頻寬。為了解決這個問題，在節目的主持人只有一個人時，我們會建立樹狀的拓樸來傳送我們的封包。然而，當有多個主持人或是有人Call-in給節目主持人時，我們會透過distributed mixer negotiation的演算法, 在我們所設置的PeerIIR伺服器之間建立樹狀的架構,以分散式地合成聲音串流，達到節省網路頻寬的目的。最後也透過了一連串的實驗模擬來證明我們所設計的系統確實能夠在反應延遲、頻寬負荷上達到好的效能。 Peer-to-Peer (P2P) applications are popular recently and have become one of the hottest research topics. The participants share their resources (such as processing power, disk storage, and network bandwidth) in the P2P architecture. In this thesis, we design and implement an Interactive Internet Radio system using the P2P approach, called PeerIIR. Different from the traditional radio system which can just broadcast the voice streams to its audience, the PeerIIR utilizes the Voice-over-Internet-Protocol (VoIP) features to make the live interaction between the program host and the audience possible. The program host can invite co-hosts to talk in the program. The audience can also use call-in service to talk with the hosts. However, when the host, co-hosts, and calliners are speaking at the same time, they will produce multiple streams which need to deliver to all the audience on the system. This could consume the network bandwidth inefficiently, or even exhaust the link capacity of the audience. Thus, how to process multiple streams produced at the same time and to deliver to all the audience efficiently is the key issue. When there are only one program host producing the audio stream, a distribution tree is built to distribute it. If there are co-hosts or calliners speaking, a distributed mixer negotiation algorithm is performed to build a voice mixing tree among PeerIIR servers. Therefore the audio streams are mixed distributedly and step by step along the mixing tree to save transmission bandwidth. The results from series of simulation show that the performance for response time and link/node stress is enhanced compared with some related works.
參考文獻:	[1] S. Saroiu, P. K. Gummadi, and S. D. Gribble, “A measurement study of peer-to-peer file sharing systems,” in ACM/SPIE Multimedia Computing and Networking, San Jose, CA, Jan. 2002. [2] I. Stoica, R. Morris, D. Karger, M. Kaashock, and H. Balakrishman, “Chord: A scalable peer-to-peer lookup protocol for Internet applications,” in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001. [3] N. Magharei, R. Rejaie, and Y. Guo, “Mesh or Multiple-Tree: A Comparative Study of Live P2P Streaming Approaches,” in INFOCOM, Anchorage, AK, May. 2007. [4] X. Zhang et al., “DONet/CoolStreaming: A Data-driven Overlay Network for Live Media Streaming,” in Proc. IEEE INFOCOM, May. 2005. [5] B. Li, and H. Yin, “Peer-to-Peer Live Video Streaming on the Internet: Issues, Existing Approaches, and Challenges,” in IEEE Communications Magazine, Toronto, Ont., Canada, June. 2007. [6] http://www.bittorrent.com/ [7] B. Goode, “Voice over Internet Protocol (VoIP),” in PROCEEDINGS OF THE IEEE, VOL. 90, NO. 9, Sep. 2002. [8] http://www.pplive.com/ [9] http://www.ppstream.com/ [10] http://www.sopcast.com/ [11] http://www.skype.com/ [12] http://www.kazaa.co/ [13] X. Hei, C. Liang, J. Liang, Y. Liu, and K. W. Ross, “A Measurement Study of a Large-Scale P2P IPTV System,” in Multimedia, IEEE Transactions, Dec. 2007. [14] Y. H. Chu, S. G. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture,” in SIGCOMM’01, San Diego, California, USA, August. 2001. [15] J. Lennox, and H. Schulzrinne, “A Protocol for Reliable Decentralized Conferencing,” in NOSSDAV’03, Monterey, California, USA, June. 2003. [16] M. Radenkovic, and C. Greenhalgh, “Multi-party Distributed Audio Service with TCP Fairness,” in Multimedia’02, Juan-les-Pins, France, December. 2002. [17] T. K. Chua, and D. C. Pheanis, “Bandwidth-Conserving Real-Time VoIP Teleconference System,” in ITNG’06, 2006. [18] X. Gu, Z. Wen, P. S. Yu, and Z. Y. Shae, “peerTalk: A Peer-to-Peer Multi-Party Voice-Over-IP System,” in Parallel and Distributed Systems, IEEE Transaction on April. 2008. [19] S. H. Min, J. Holliday, and D. S. Cho, “Optimal Super-peer Selection for Large-scale P2P System,” in ICHIT’06, 2006.
描述:	碩士國立政治大學資訊科學學系 96753034 98
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0096753034
数据类型:	thesis
显示于类别:	[資訊科學系] 學位論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML2	316	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回馈