Publications-Theses

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 數位網路上預算的二階段配置法
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
上傳時間 17-Sep-2009 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
dc.contributor.advisor 陸行zh_TW
dc.contributor.advisor Luh,H.en_US
dc.contributor.author (Authors) 金立人zh_TW
dc.contributor.author (Authors) Chin, Li-Jenen_US
dc.creator (作者) 金立人zh_TW
dc.creator (作者) Chin, Li-Jenen_US
dc.date (日期) 2004en_US
dc.date.accessioned 17-Sep-2009 13:49:52 (UTC+8)-
dc.date.available 17-Sep-2009 13:49:52 (UTC+8)-
dc.date.issued (上傳時間) 17-Sep-2009 13:49:52 (UTC+8)-
dc.identifier (Other Identifiers) G0917510021en_US
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/32603-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 應用數學研究所zh_TW
dc.description (描述) 91751002zh_TW
dc.description (描述) 93zh_TW
dc.description.abstract (摘要) 本論文著眼於All-IP網路中的預算分配。我們定義網路的服務品質只與各使用者使用網路頻寬的要求有關,提出一種使管理者能以統計上百分比來估計網路服務品質的方法。這個方法包含路徑選擇以及頻寬分配二個階段。為了展現這種方法的可行性,我們列舉一些數據來分別比較以最大滿意度和最小成本為目標的不同分配結果,作為使用這個方法的參考。zh_TW
dc.description.abstract (摘要) 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.en_US
dc.description.tableofcontents Abstract (in Chinese) I
Abstract II
1. Introduction 1
2. The Maximum Satisfaction Method 7
2.1 The Two Phases: MBM and BRAM 7
2.2 Example 1 of MBM Model 12
2.3 Example 1 of BRAM Model with 15
2.3.1 Calculate the satisfaction by the expected number of
connections 15
2.3.2 Simulation of example 1 with the same weights 17
2.4 Example 1 of BRAM model with different weights 18
2.4.1 Calculate the satisfaction by the expected number of
connections 18
2.4.2 Simulation of example 1 with different weights 19
2.5 Example 2 with MBM Model 19
2.5.1 Three classes have different weights 21
2.5.2 Simulation of example 2 22
2.6 The Application on another All-IP Network 23
2.6.1 Calculate the satisfaction with the expected number of
connections 26
2.6.2 Simulation 27
3. The Minimum Cost Method 28
3.1 A Simulation Algorithm Applied on All-IP Networks 28
3.1.1 A Statistical inference process of our study 32
3.1.2 The simulation process 33
3.2 The Minimum Cost Method 36
3.2.1 Example 1 of MCM model 36
3.2.2 Example 1 of MCM with 38
3.2.3 Three classes with different weights 39
3.3 Example 2 of MCM Model 40
3.4 The Application on another All-IP Network 44
4. Comparison of Maximum Satisfaction Method with the Minimum
Cost Method 49
4.1 Comparison by examples 49
4.2 Another Network 51
5. Conclusion 55
Bibliography 57
zh_TW
dc.format.extent 46456 bytes-
dc.format.extent 81014 bytes-
dc.format.extent 123440 bytes-
dc.format.extent 399961 bytes-
dc.format.extent 366036 bytes-
dc.format.extent 266001 bytes-
dc.format.extent 71180 bytes-
dc.format.extent 121456 bytes-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G0917510021en_US
dc.subject (關鍵詞) All-IP網路zh_TW
dc.subject (關鍵詞) 資源分配zh_TW
dc.subject (關鍵詞) All-IP Networksen_US
dc.subject (關鍵詞) Resource Allocationen_US
dc.title (題名) 數位網路上預算的二階段配置法zh_TW
dc.title (題名) A Two-Phase Approach on Budget Allocation for All-IP Networksen_US
dc.type (資料類型) thesisen
dc.relation.reference (參考文獻) [1] P.J. Bickel and K.A. Doksum, Mathematical Statistics: Basic Ideas and Selected Topics, Prentice Hall, 1977.zh_TW
dc.relation.reference (參考文獻) [2] J. Boyle, RSVP Extensions for CIDR Aggregated Data Flow, Internet work in progress, June 1997.zh_TW
dc.relation.reference (參考文獻) [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.zh_TW
dc.relation.reference (參考文獻) [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.zh_TW
dc.relation.reference (參考文獻) [5] MATLAB 6.5, the Mathworks, Inc., 2002.zh_TW
dc.relation.reference (參考文獻) [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.zh_TW
dc.relation.reference (參考文獻) [7] E. Mulyana and U. Killat, An Alternative Genetic Algorithm to Optimize OSPF Weights, July 2002, found in internet.zh_TW
dc.relation.reference (參考文獻) [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.zh_TW
dc.relation.reference (參考文獻) [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.zh_TW
dc.relation.reference (參考文獻) [10] K.G. Ramakrishnan and M.A. Rodrigues, Optimal Routing in Shortest Path Data Networks, Bell Labs Technical Journal, 117–138, January, June 2001.zh_TW
dc.relation.reference (參考文獻) [11] S. Rooney, Connection closures: Adding application-defined behavior to network connections, Internet work in progress, April 1997.zh_TW
dc.relation.reference (參考文獻) [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.zh_TW
dc.relation.reference (參考文獻) [13] C.H. Wang, Mathematical Models of Pareto Optimal Path Selection on All-IP Networks, Master Thesis, National Chengchi University, Taipei, 2004.zh_TW
dc.relation.reference (參考文獻) [14] L. W. Winston, Operations Research Applications and Algorithms, Bel-mont, CA: THOMSON BROOKS/COLE, 2004.zh_TW