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

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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113822/144841 (79%)
造訪人次 : 51817788 線上人數 : 620

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

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 理學院 > 應用數學系 > 學位論文 > Item 140.119/32603

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/32603

題名:	數位網路上預算的二階段配置法 A Two-Phase Approach on Budget Allocation for All-IP Networks
作者:	金立人 Chin, Li-Jen
貢獻者:	陸行 Luh,H. 金立人 Chin, Li-Jen
關鍵詞:	All-IP網路資源分配 All-IP Networks Resource Allocation
日期:	2004
上傳時間:	2009-09-17 13:49:52 (UTC+8)
摘要:	本論文著眼於All-IP網路中的預算分配。我們定義網路的服務品質只與各使用者使用網路頻寬的要求有關，提出一種使管理者能以統計上百分比來估計網路服務品質的方法。這個方法包含路徑選擇以及頻寬分配二個階段。為了展現這種方法的可行性，我們列舉一些數據來分別比較以最大滿意度和最小成本為目標的不同分配結果，作為使用這個方法的參考。 In this thesis, we focus on budget allocation for All-IP networks. We propose a method which assists managers to estimate the quality of service on networks. The quality of service on networks is defined by satisfaction functions that are simply written in terms of bandwidth required by the users on the network. We present a two-phase approach which includes a path se-lection and a scheme for bandwidth allocation. In order to illustrate an easy implementation of this approach, we also develop the Maximum Satisfaction Method and the Minimum Cost Method. Numerical examples are given to show the effectiveness of our approach.
參考文獻:	[1] P.J. Bickel and K.A. Doksum, Mathematical Statistics: Basic Ideas and Selected Topics, Prentice Hall, 1977. [2] J. Boyle, RSVP Extensions for CIDR Aggregated Data Flow, Internet work in progress, June 1997. [3] K. Gopalan and T. Chiueh, Delay Budget Allocation in Dlay Bounded Network Paths, Technical Report TR-113, Experimental Computer Sys-tems Labs, Dept. of Computer Science, State University of New York, Stony Brook, NY, June 2002. [4] D. Mitra and Q. Wang, Stochastic Traffic Engineering, with Applications to Network Revenue Management, Proceedings of IEEE INFOCOM`03, San Francisco, 2-10, CA, 2003. [5] MATLAB 6.5, the Mathworks, Inc., 2002. [6] E. Mulyana, U. Killat, A Hybrid Genetic Algorithm Approach for OSPF Weight Setting Problem, 2nd POLISH-GERMAN TELETRAFFIC SYM-POSIUM PGTS, 9th Polish Teletraffic Symposium, 2002, found in inter-net. [7] E. Mulyana and U. Killat, An Alternative Genetic Algorithm to Optimize OSPF Weights, July 2002, found in internet. [8] W. Ogryczak, T. Śliwiński and A. Wierzbicki, Fair Resource Allocation Schemes and Network Dimensioning Problems, Journal of Telecommu-nication and Information Technology, 34-42, Mar. 2003. [9] A. Orda, Routing with End-to-End QoS Guarantees in Broadband Net-works, IEEE/ACM Transaction on Networking, Vol. 7, No. 3, 365-374, June 1999. [10] K.G. Ramakrishnan and M.A. Rodrigues, Optimal Routing in Shortest Path Data Networks, Bell Labs Technical Journal, 117–138, January, June 2001. [11] S. Rooney, Connection closures: Adding application-defined behavior to network connections, Internet work in progress, April 1997. [12] P. Thomas, D. Teneketzis, J. K. Mackie-Mason, A Market-Based Ap-proach to Optimal Resource Allocation in Integrated-Services Connec-tion-Oriented Networks, Operations Research, Vol. 50, No. 4, 603-616, July-August 2002. [13] C.H. Wang, Mathematical Models of Pareto Optimal Path Selection on All-IP Networks, Master Thesis, National Chengchi University, Taipei, 2004. [14] L. W. Winston, Operations Research Applications and Algorithms, Bel-mont, CA: THOMSON BROOKS/COLE, 2004.
描述:	碩士國立政治大學應用數學研究所 91751002 93
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0917510021
資料類型:	thesis
顯示於類別:	[應用數學系] 學位論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
51002101.pdf		45Kb	Adobe PDF2	896	檢視/開啟
51002102.pdf		79Kb	Adobe PDF2	927	檢視/開啟
51002103.pdf		120Kb	Adobe PDF2	815	檢視/開啟
51002104.pdf		390Kb	Adobe PDF2	1037	檢視/開啟
51002105.pdf		357Kb	Adobe PDF2	1528	檢視/開啟
51002106.pdf		259Kb	Adobe PDF2	811	檢視/開啟
51002107.pdf		69Kb	Adobe PDF2	793	檢視/開啟
51002108.pdf		118Kb	Adobe PDF2	1061	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 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 © - 回饋