Please use this identifier to cite or link to this item:

Title: 數位網路上預算的二階段配置法
A Two-Phase Approach on Budget Allocation for All-IP Networks
Authors: 金立人
Chin, Li-Jen
Contributors: 陸行
Chin, Li-Jen
Keywords: All-IP網路
All-IP Networks
Resource Allocation
Date: 2004
Issue Date: 2009-09-17 13:49:52 (UTC+8)
Abstract: 本論文著眼於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.
Reference: [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.
Description: 碩士
Source URI:
Data Type: thesis
Appears in Collections:[應用數學系] 學位論文

Files in This Item:

File Description SizeFormat
51002101.pdf45KbAdobe PDF837View/Open
51002102.pdf79KbAdobe PDF893View/Open
51002103.pdf120KbAdobe PDF775View/Open
51002104.pdf390KbAdobe PDF1003View/Open
51002105.pdf357KbAdobe PDF1448View/Open
51002106.pdf259KbAdobe PDF772View/Open
51002107.pdf69KbAdobe PDF751View/Open
51002108.pdf118KbAdobe PDF1024View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing