Responsive image
博碩士論文 etd-0710103-163617 詳細資訊
Title page for etd-0710103-163617
論文名稱
Title
滿足最大化服務品質需求之進入許可控制研究
Admission Control with Maximizing QoS Satisfactions
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
66
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2003-07-01
繳交日期
Date of Submission
2003-07-10
關鍵字
Keywords
資源配置、進入許可控制、服務品質
Admission Control, Resource Allocation, QoS
統計
Statistics
本論文已被瀏覽 5801 次,被下載 26
The thesis/dissertation has been browsed 5801 times, has been downloaded 26 times.
中文摘要
科技的進步帶動頻寬的增加,得以應付從純文字到多媒體增加的資料傳輸量,使得網路應用發展日新月異,更加多元化。近年來,無線網路的興起更是引人注目。與傳統網路相比,無線網路的便利性與延展性是其最大的優勢;但相對地,無線網路在頻寬及穩定性便無法與傳統網路相比。由於無線網路的頻寬資源是相當有限的,網路服務品質〈QoS,Quality of Service〉可以對頻寬資源做更有效的利用。網路服務品質是利用網路組合元件或技術來達成特定應用服務需求的保證能力。網路服務品質能夠區分不同等級的服務要求,讓系統資源做最有效的分配。
本研究採用報酬賠償架構,能夠區分不同的服務要求,以最大化系統收益作為資源分配的目標。主要是以報酬率〈reward rate〉、延遲賠償率〈delay penalty rate〉及拒絕賠償〈drop penalty〉,三種網路服務品質參數來決定。在報酬賠償架構中,是以最大化系統收益為目標,作為進入許可控制的判斷。本研究的目的在設計一有效率的動態資源配置機制,包括進入許可控制〈Admission Control〉與資源分配〈Resource Allocation〉兩個部分,使有限的系統資源達到最佳的使用效果,並以平滑式〈Smooth〉觀點來調整系統內使用者的系統資源,保證使用者服務品質需求。
在模擬實驗的結果中,可以發現本研究提出的Minimum Degradation Impact〈MDI〉綜合表現優於其他的演算法。在不同環境參數下,如到達率、要求頻寬急預期傳輸時間,MDI在不同的指標項目有較佳且穩定的表現。MDI在因應不同的系統目標,如低延遲或是低拒絕率等,可藉由改變不同的服務品質需求參數,報酬率、延遲賠償率及拒絕賠償,來達到預定的系統目標。由此可知,MDI不僅對系統資源做有效的使用,且能調整參數因應網路環境的變化,獲得較佳的效果。

Abstract
The progresses of technology bring up the bandwidth of the network, that can afford the increasing data amount from text to multimedia and make the network application development change with every passing day and become more varied. Recently, the rising of the wireless network attracts the public’s attention. Compared with the traditional network, the wireless network has the advantage in its convenience and extensibility, but it has shortcoming in its bandwidth and stability. Because of the limited resources of the wireless network, introducing QoS (Quality of Service) can use the resources more efficiently. QoS guarantee the ability to achieve the special network applications’ requests by using the network components or technology. QoS can differentiate between different classes of network services and allocate the system resources much better.

Our research adopts the reward-penalty model to differentiate between different kinds of service requests to maximize the system’s earning. It is decided by three QoS parameters, reward rate, delay penalty rate and drop penalty. In the reward-penalty model, the admission control’s goal is to maximize the system’s benefit. The purpose of our research is to design an efficient and dynamic resource allocation method, including admission control and resource allocation, to find the most efficient solution under the constraint of limited resources and smoothly adjust the resources of the existing users to promise the QoS.

The consequences of simulation experiments show that MDI, posed in our research, has a better performance than other algorithms. Under different network environments, e.g. arrival rate, request bandwidth, transmission time, MDI is better and more stable than other algorithms. MDI can adjust QoS parameters, e.g. reward rate, delay penalty rate, drop penalty, to achieve different system’s goal, like low delay rate or low drop rate. Thus it can be seen that MDI is able to not only make an efficient use of system resources but also adjust the QoS parameters to counter the change of the network environment in order to have a better performance.

目次 Table of Contents
第一章 緒論 1
1.1研究動機及目的 1
1.2研究流程 3
1.3 論文架構 4
第二章 文獻探討 5
第三章 系統架構 14
3.1 系統架構 15
3.2目標函數 18
第四章 資源配置演算法 20
4.1 Degradation Impact〈DI〉 20
4.2 Minimum Degradation Impact〈MDI〉 24
4.3 Contribution Based〈CB〉 27
第五章 模擬結果分析 29
5.1開發工具與系統環境介紹 29
5.2模擬參數 29
5.3對照組演算法 31
5.3.1 No Delay〈ND〉 31
5.3.2 Admit As Possible〈AAP〉 31
5.4 評估項目 32
5.5 系統模擬與評估比較 33
5.5.1到達率〈Arrival Rate〉 33
5.5.2要求頻寬(Request Bandwidth) 37
5.5.3預期傳輸時間(Transmission Time) 42
5.5.4 報酬率(Reward Rate) 47
5.5.5 延遲賠償率(Delay Penalty Rate) 49
5.5.6 拒絕賠償(Drop Penalty) 51
第六章 結論與未來展望 53
第七章 參考文獻 56

參考文獻 References
[1] H. M. Vin, P. Goyal, and A. Goyal. (1994) “A Statistical Admission Control Algorithm for Multimedia Servers.”, ACM Intl. Conference on Multimedia, San Francisco.
[2] A. Vogel, B. Kerherve, G. Bochmann, and J. Gecsei. (1995) Distributed Multimedia and QoS: A Survey. IEEE Multimedia, vol. 2, no. 2, Summer, pp. 10-19.
[3] H. M. Vin, A. Goyal, P. Goyal. (1995) Algorithms for designing multimedia servers, Computer Communications, 18 , pp. 192-203.
[4] H. M. Vin, A. Goyal, and P. Goyal. (1995) An Observation-based Admission Control Algorithms for Multimedia Servers, 1st IEEE Intl. conference on multimedia computing and systems, Boston.
[5] Andrew S. Tanenbaum (1996) Computer Networks Third Edition
[6] C. Bisdikian, K. Maruyama, D. I. Seidman, and D. N. Serpanos. (1996) “Cable Access Beyond the Hype: On Residential Broadband Data Services over HFC Networks.”, IEEE Communications Mag., vol. 34, no. 11, Nov. pp. 128-135
[7] E. Chang and A. Zakhor. (1996) “Cost analysis for VBR video servers.”, IEEE Multimedia, Winter, pp. 56-71.
[8] I. Chen and C. Chen. (1996) “Threshold-based admission control policies for multimedia servers.”, Computer Journal, 39(9), pp. 1-10.
[9] P. Goyal and H. M. Vin. (1996) Network Algorithms and Protocol for Multimedia Servers. Proceedings of the 1996 15th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1371-1379.
[10] S. Biswas and B. Sengupta. (1997) “Call Admissibility for Multirate Traffic in Wireless ATM Networks.”,IEEE INFOCOM’97, pp. 650-659.
[11] T. Kwon, Y. Choi, C. Bisdikian, M. Naghshineh. (1998) Call Admission Control for Adaptive Multimedia in Wireless/Mobile Networks. ACM Workshop on Wireless Mobile Multimedia, pp. 111-116
[12] D. Ayyagari, A. Ephremides, (1999) Admission Control with priorities: Approaches for multi-rate wireless systems, Mobile Networks and Applications, vol. 4, pp. 209-218.
[13] Anna Ha`c (2000) Multimedia Applications Support for Wireless ATM Networks
[14] S. Cheng, C. Chen and I. Chen. (2000) Dynamic Quota-based Admission Control with Sub-rating in Multimedia Servers, ACM / Springer Multimedia Systems Journal, vol. 8, no. 2, pp. 83-91.
[15] S. K. Das, R. Jayaram, N. K. Kakani, Sanjoy K. Sen (2000) “A Call admission and control scheme for quality-of-service (QoS) provisioning in next generation wireless networks.”, Wireless Network, vol. 6, pp.17-30
[16] S. T. Cheng, C. M. Chen (2000) Dynamic Round-based Resource Management for On-demand Multimedia Servers. Computer Science, vol. 43, pp. 386-395.
[17] Y. Xiao,C.L.Philip Chen,Y. Wang (2000) An Optimal Distributed Call Admission Control for Adaptive Multimedia in Wireless/Mobile Networks, Analysis and Simulation of Computer and Telecommunication Systems, pp. 477-482.
[18]羅哲峰〈2001〉無線網路下具服務品質需求的多媒體傳輸資源配置之研究
[19] Paul Richardson, Larrt Sieh, Aura Ganz, (2001) Quality of Service Support for Multimedia Applications in Third Generation Mobile Networks Using Adaptive Scheduling, Real Time Systems, 21, pp. 269-284
[20] Akshat Verma, Sugata Ghosal, (2002) On Admission Control for Profit Maximization of Networked Service Providers, ACM , Proceedings of the twelfth international conference on World Wide Web
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內公開,校外永不公開 restricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 18.227.114.125
論文開放下載的時間是 校外不公開

Your IP address is 18.227.114.125
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code