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/37676
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor蔡志宏
dc.contributor.authorLiang-Yu Chenen
dc.contributor.author陳亮宇zh_TW
dc.date.accessioned2021-06-13T15:38:10Z-
dc.date.available2009-07-17
dc.date.copyright2008-07-17
dc.date.issued2008
dc.date.submitted2008-07-09
dc.identifier.citation[1] BOINGO WIRELESS-- Toward Ubiquitous Wireless Broadband
http://www.boingo.com/wi-fi_industry_basics.pdf
[2] WLAN校園漫遊機制與服務
http://wlanrc.nchc.org.tw/
[3] H. Jiang and S. Jordan, “A pricing model for high speed networks with guaranteed quality of service,” in Proc. of IEEE INFOCOM , vol. 2, pp.888-895, March 1996.
[4] J. Nan , G.. Venkitachalam and S. Jordan, “Dynamic congestion-based pricing of bandwidth and buffer,” IEEE/ACM Transactions on Networking, vol. 13, pp1233-1246, December 2005.
[5] D. Niyato and E. Hossain, “A queuing-theoretic and optimization-based model for radio resource management in IEEE 802.16 broadband wireless networks,” IEEE Transactions on Computers, vol. 55, pp1473-1488, November 2006.
[6] M. Hill, J. Chuzhoy, A. Freund, and J. Naor, “Algorithmic aspects of bandwidth trading,” ACM Transactions on Algorithms (TALG), Vol. 3, February 2007.
[7] T. Harks, “Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach,” ZIB-Report 04-32, August 2004.
[8] T. Harks and T. Poschwatta, “Priority pricing in utility fair networks,” 13th IEEE International Conference on Network Protocols, November 2005.
[9] H. Jiang, I. Sidhu and S. Jordan, “A Pricing Model for Networks with Priorities,” 34th. Annual Allerton Conference On Communication.
[10] E.W. Fulp, M. Ott, D. Reininger, D.S. Reeves, “Paying for QoS: an optimal distributed algorithm for pricingnetwork resources,” in Proc. of 1998 Sixth International Workshop on Quality of Service, 1998.
[11] S. Mandal and D. Saha, “A bandwidth pricing model that is attractive to regulators, users, and providers,” in Proc. of IEEE International Conference on Networks, vol. 2, pp738-742, November 2004.
[12] D. M. Chiu, “Some observations on fairness of bandwidth sharing,” in Proc. of IEEE Symposium on Computers and Communications, July 2000.
[13]Q. Wang, J. M. Peha and M. A. Sirbu, “Optimal Pricing for Integrated-Services Networks with Guaranteed Quality of Service,” In Internet Economics, 1996.
[14] J. Virapanicharoen and W. Benjapolakul, “Fair-efficient guard bandwidth coefficients selection in call admission control for mobile multimedia communications using game theoretic framework,” in Proc. of IEEE International Conference on Communications, June 2004.
[15] X. Wang and H. Schulzrinne, “Pricing Network Resources for Adaptive Applications,” IEEE/ACM Transactions on Networking, vol. 14, no. 3, June 2006.
[16] T. Heikkinen “Distributed scheduling and dynamic pricing in a communication network,” Wireless Networks, Volume 10, Issue 3, May 2004.
[17] C. S. Chang and Z. Liu, “A Bandwidth Sharing Theory for a Large Number of HTTP-Like Connections,” IEEE/ACM Transactions on Networking, vol. 12, no. 5, October 2004.
[18] J. Kuri and S. Roy, “Pricing Network Resources: A New Perspective,” in Proc. of International Conference on Wireless Communications, Networking and Mobile Computing, September 2007.
[19] D. Karabudak, C. C. Hung and B. Bing, “A call admission control scheme using genetic algorithms,” in Proc. of the 2004 ACM symposium on Applied computing, March 2004.
[20] H. Pan and S. Yamano, “An analysis of the channel utilization for call admission control in voice over WLAN,” in Proc. of the 2006 international conference on Wireless communications and mobile computing, July 2006.
[21] K. L. Dias, S. F. L. Fernandes and D. F. H. Sadok, “Predictive call admission control for all-IP wireless and mobile networks,” in Proc. of the 2003 IFIP/ACM Latin America conference on Towards a Latin American agenda for network research, October 2003.
[22] Y. Xiao and J. Rosdahl, “Performance analysis and enhancement for the current and future IEEE 802.11 MAC protocols,” ACM SIGMOBILE Mobile Computing and Communications Review, Volume 7, Issue 2, April 2003.
[23] R. Bruno, M. Conti and E. Gregori, “Performance modelling and measurements of TCP transfer throughput in 802.11-based WLAN,” in Proc of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems, October 2006.
[24] P. P. Pham, “Comprehensive analysis of the IEEE 802.11,”Mobile Networks and Applications, Volume 10, Issue 5, October 2005.
[25]維基百科:賽局理論。
http://zh.wikipedia.org/w/index.php
[26]M. J. Osborne, “an introduction to Game Theory,” Oxford, 2004.
[27]台大校園無線網路流量分析
http://ws5-2.cc.ntu.edu.tw/cgi-bin/glance.pl?flow/cc/wlan
[28]寬廣科技
http://www.qon.com.tw
[29]A. Balachandran, G. M. Voelker, P. Bahl, and P. V. Rangan, “Characterizing User Behavior and Network Performance in a Public Wireless LAN,” in Proc. ACM SIGEMTRICS'02, June 2002.
[30]D. Gross, C. M. Harris, ”Fundamentals of Queuing Theory,” Wiley InterScience, 1998.
[31]FON全球最大的無線網路共享社群
http://www.fon.com/tw/
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37676-
dc.description.abstract在現今無線網路蓬勃發展下,802.11a/b/g技術已被廣泛使用,全球許多電信業者、大專院校、自宅居民,均大量架設無線基地台。由於基地台的傳輸範圍較小,營運費用甚高。因此各國不同的電信業者經常彼此建立商業關係組成漫遊合作聯盟,讓彼此使用者可以漫遊至其它業者無線網路系統。我國各主要大學校園也組成漫遊體系,幫助彼此師生於它校享受漫遊服務。然而校園與業者間或業者與業者間之無線網路漫遊卻存在潛在的商業合作問題,使得彼此使用者無法互利漫遊。
本研究目標在校園和業者間之無線漫遊系統或業者間之漫遊系統建立一個記帳系統,以協助解決上述障礙。此系統中,各無線網路系統對於其使用者及漫遊使用者分別建立使用者分級,並利用賽局理論,選擇最適合之最低可傳輸速率組合給予不同使用者。此研究也提出效用函數及計算方法以反應滿意度程度,並利用電腦模擬分析漫遊之結果,也探討廣告效益,營運差異等因素對漫遊協議達成可能性之影響,希望藉此研究將有助於建立無線網路漫遊協議並從長遠來看增加網路資源之使用效率。
zh_TW
dc.description.abstractIn recent years, wireless networks have grown rapidly and 802.11a/b/g technologies have been widely employed. Many telecom operators, universities and households deploy their own wireless access points. Because of the short coverage of WLAN access points and the high operating cost, telecom operators in different countries often establish business relationship to form roaming alliances and then their users can roam to wireless networks of different operators. In Taiwan, main universities have formed a roaming alliance to help their teachers and students to enjoy roaming service at other campus. However, there exist business cooperation problems between campus networks and operators’ wireless networks, so that at this stage campus users still cannot roam to hot spots owned by business operators and vice versa.
This research aims to establish a credit system between campus networks and operators’ networks to resolve the problems above. Each wireless network system can categorize their users into original users, and then employ the Game Theory to provide different users with appropriate transmission rates. This research proposes to use utility function to reflect the satisfaction level and analyze the results of roaming agreement by means of simulation. Also, the impact factor, such as advertising benefit and operation models, are also included in the feasibility study of roaming agreement. We hope this research can be instrumental to the establishment of wireless network roaming agreement and improves network resource efficiency in the long term.
en
dc.description.provenanceMade available in DSpace on 2021-06-13T15:38:10Z (GMT). No. of bitstreams: 1
ntu-97-R95942107-1.pdf: 1195919 bytes, checksum: eb88b49b5dde33791a3c913acd52fa5a (MD5)
Previous issue date: 2008
en
dc.description.tableofcontents誌謝…………………………………………………………………… i
中文摘要…………………………………………………………… iii
英文摘要……………………………………………………………… v
第一章 緒論………………………………………………………… 1
1.1發展背景及現況………………………………………………… 1
1.2研究問題與目的………………………………………………… 3
1.3相關研究介……………………………………………………… 5
1.3.1最大化效用之研究…………………………………………… 5
1.3.2公平性之研究………………………………………………… 6
1.3.3最大化效用和公平性研究之綜合研究……………………… 7
1.3.4無線網路基地台呼叫允入控制機制之研究………………… 8
1.4研究方向及章節架構…………………………………………… 9
第二章 漫遊記帳系統介紹……………………………………… 11
2.1系統架構……………………………………………………… 11
2.1.1系統模型介紹……………………………………………… 14
2.1.2效用函數介紹……………………………………………… 19
2.2無線基地台呼叫允入控制機制……………………………… 20
2.3無線網路系統決策機制……………………………………… 22
2.3.1頻寬分配問題描述………………………………………… 22
2.3.2各漫遊系統決策每人可用之頻寬機制…………………… 24
2.4記帳系統虛擬貨幣轉換機制………………………………… 29
2.5決策時區選擇之考量………………………………………… 33
2.6排隊理論分析之可行性……………………………………… 35
第三章 校園及業者無線網路漫遊之賽局模擬及分析………… 36
3.1模擬參數設計………………………………………………… 36
3.2校園和業者漫遊系統漫遊人數之考量……………………… 39
3.3使用者平均使用時間改變之考量…………………………… 44
3.4使用者連線分佈改變之考量………………………………… 46
3.5廣告效益之考量……………………………………………… 47
3.6業者營運策略不同之影響…………………………………… 49
3.7全天決策和分時區決策比較………………………………… 52
第四章 業者無線網路漫遊之賽局模擬及分析………………… 57
4.1模擬參數設計………………………………………………… 57
4.2業者間漫遊系統漫遊人數之考量…………………………… 59
4.3使用者平均使用時間改變之考量…………………………… 62
4.4使用者連線分佈改變之考量………………………………… 63
4.5業者營運策略不同之影響…………………………………… 66
第五章 實作探討、結論及未來工作…………………………… 71
5.1實作探討……………………………………………………… 71
5.1.1每時區決策………………………………………………… 71
5.1.2每小時計算虛擬貨幣……………………………………… 72
5.2結論…………………………………………………………… 73
5.3未來工作……………………………………………………… 74
參考文獻…………………………………………………………… 75
dc.language.isozh-TW
dc.subject記帳系統zh_TW
dc.subject賽局理論zh_TW
dc.subject漫遊zh_TW
dc.subject允入控制機制zh_TW
dc.subjectroamingen
dc.subjectcredit systemen
dc.subjectadmission controlen
dc.subjectgame theoryen
dc.title網路業者和校園無線網路漫遊記帳系統之設計zh_TW
dc.titleDesign of A Credit System for Roaming between Operator and Campus Networksen
dc.typeThesis
dc.date.schoolyear96-2
dc.description.degree碩士
dc.contributor.oralexamcommittee林風,林宗男,許獻聰,張時中
dc.subject.keyword賽局理論,漫遊,允入控制機制,記帳系統,zh_TW
dc.subject.keywordgame theory,roaming,admission control,credit system,en
dc.relation.page79
dc.rights.note有償授權
dc.date.accepted2008-07-09
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-97-1.pdf
  未授權公開取用
1.17 MBAdobe 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