請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/26339
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 逄愛君 | |
dc.contributor.author | Po-Ju Chiu | en |
dc.contributor.author | 邱柏儒 | zh_TW |
dc.date.accessioned | 2021-06-08T07:06:51Z | - |
dc.date.copyright | 2008-09-02 | |
dc.date.issued | 2008 | |
dc.date.submitted | 2008-08-26 | |
dc.identifier.citation | [1] DaSilva LA, Morgan GE, Bostian CW, et al. The resurgence of push-to-talk technologies. IEEE Communications Magazine 2006; 44: 48-55.
[2] Motorola. Motorola Push-to-Talk over Cellular Solution. http://www.motorola.com/networkoperators/pdfs/new/PoC.pdf [3] Nextel. Nextel Walkie-Talkie. http://www.nextel.com [4] OMA. Push to Talk over Cellular (PoC)-Architecture. OMAAD-PoC V1_0-20060127-C Candidate Version 1.0 V, 27 January 2006. [5] Saikat Guha, Neil Daswani, Ravi Jain, An Experimental Study of the Skype Peer-to-Peer VoIP System. Wireless Communications and Mobile Computing, 7 Jan 2008 [6] Bryan DA, Lowekamp BB, Jennings C. SOSIMPLE: A serverless, standards-based, P2P SIP communication system. IEEE International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications, June 2005. [7] Singh K, Schulzrinne H. Peer-to-Peer Internet Telephonyg using SIP. ACM International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), June 2005. [8] R. Huebsch, J.M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker, I. Stoica, Querying the Internet with PIER, in: Proceedings of the 29th Int’l Conference on Very Large Databases VLDB’03, September 2003. [9] C. Schmidt, M. Parashar, Enabling flexible queries with guarantees in P2P systems, IEEE Internet Computing 8 (3) (2004) 19-26. [10] Y Shu, BC Ooi, KL Tan, A Zhou, Supporting multi-dimensional range queries in peer-to-peer systems, IEEE Int’l Conference on Peer-to-Peer Computing, 2005. [11] X Yu, An Adaptive Algorithm for P2P k-nearest Neighbor Search in High Dimensions, IEEE Int’l Conference on Control and Automation, 2007. [12] R. van Renesse, K.P. Birman, W. Vogels, Astrolabe: a robust and scalable technology for distribute system monitoring, management and data mining, ACM Transactions on Computer Systems 21 (2) (2003) 164-206. [13] P. Cao, Z. Wang, Efficient top-K query calculation in distributed networks, in: Proceedings of the 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing PODC 2004, July 25-28, 2004, pp. 206-215. [14] D. Psaltoulis, I. Kostoulas, I. Gupta, K. Birman, A. Demers, Practical algorithms for size estimation in large and dynamic groups, in: Proceedings of the Twenty-Third Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2004, July 25-28, 2004. [15] P. Yalagandula, M. Dahlin, A scalable distributed information management system, in: SIGCOMM’04, August 30-September 3, 2004. [16] Zhou, Aoying Zhang, Rong Vu, Quang Hieu Qian, Weining, Content-based Search using Term Aggregation and Classification over Hybrid Peer-to-Peer Systems, Network and Parallel Computing Workshops, 2007. [17] T. Hodes, S. Czerwinski, B. Zhao, A. Joseph, R. Katz, An architecture for secure wide-area service discovery, Wireless Networks 8 (2/3) (2002) 213-230. [18] M. Cai, M. Frank, J. Chen, P. Szekely, MAAN: a multiattribute addressable network for grid information services, in: Proceedings of the Int’l Workshop on Grid Computing, November 2003. [19] M. Cai, M. Frank, RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network, in: Proceedings of the 13th Conference on World Wide Web, May 17-20, 2004, pp. 650-657. [20] T. Feder, P. Hell, S. Klein, R. Motwani, Complexity of graph partition problems, in: Proceedings of the thirty-first annual ACM symposium on Theory of computing 1999. [21] Microsoft Corp, Microsoft IT numbers! http://bink.nu/news/microsoft-it-numbers.aspx [22] Skype Journal. http://skypejournal.com/blog/yet_more_news_topics/statistics/ | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/26339 | - |
dc.description.abstract | 近來在點對點網路上的隨按即說服務系統愈受關注,本篇論文提出在點對點網路上隨按即說服務中散佈使用者資訊的問題。透過使用者資訊散佈在點對點網路中不同的方式,隨按即說服務搜尋使用者時所產生的訊息數量也隨之不同。我們證明了要尋找一種使用者資訊的散佈方式使得訊息數量的成本有最小值的問題是NP完全的問題,並且為此問題找出合理的下限。本篇論文提出一種啟發式演算法散佈使用者資訊,有效降低在隨按即說服務中搜尋使用者之成本。透過一系列模擬實驗的結果,我們將展示此啟發式演算法的效能與能力。 | zh_TW |
dc.description.abstract | This paper explores the problem of user information distribution for peer-to-peer (P2P) Push-to-Talk (PTT) service. With different distribution method of user information, the number of messages flow in the network varies. To find a way to distribute user information so that the cost has minimum value will be proved to be NP-Complete and a low bound of this problem will be presented. We design a heuristic mechanism to efficiently reduce the cost of group requests and user registrations. The heuristic mechanism is investigated through our simulations. Series of experiments are conducted to show the capabilities of our heuristic mechanism. | en |
dc.description.provenance | Made available in DSpace on 2021-06-08T07:06:51Z (GMT). No. of bitstreams: 1 ntu-97-R95922089-1.pdf: 1013125 bytes, checksum: dfd8cf51bfa791f45e86d408c1505427 (MD5) Previous issue date: 2008 | en |
dc.description.tableofcontents | 口試委員會審定書 #
ACKNOWLEDGEMENT i 摘要 ii ABSTRACT iii CONTENTS iv LIST OF FIGURES v LIST OF ALGORITHMS vi Chapter 1 Introduction 1 Chapter 2 System Design 6 2.1 System Model 6 2.2 NP-Completeness 9 2.3 Our Heuristic Mechanism 12 Chapter 3 Performance Analysis 16 Chapter 4 Experimental Results 20 Chapter 5 Conclusions 25 REFERENCES 26 | |
dc.language.iso | en | |
dc.title | 點對點網路上隨按即說服務系統人際搜尋機制之設計 | zh_TW |
dc.title | Design of Push-to-talk People Search Mechanism on Peer-to-peer Network | en |
dc.type | Thesis | |
dc.date.schoolyear | 96-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 施吉昇,劉邦鋒,周承復 | |
dc.subject.keyword | 點對點網路,隨按即說服務, | zh_TW |
dc.subject.keyword | peer-to-peer,push-to-talk, | en |
dc.relation.page | 28 | |
dc.rights.note | 未授權 | |
dc.date.accepted | 2008-08-26 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-97-1.pdf 目前未授權公開取用 | 989.38 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。