隨著網路科技的快速發展，人類的日常生活已經和網際網路緊密的結合在一起。加上無線網路技術的日趨成熟，未來利用行動通訊設備來傳輸多媒體(如影像)資訊必將成為下一波網際網路新趨勢。加上愈來愈多的影像、聲音等即時資料或大量資訊需要在網路上傳送，對即時性的要求也愈來愈高，網路頻寬早已不敷所需。因此，為了解決網路壅塞的問題，也許不只在硬體上的增加頻寬，而且在如何有效管理與分配這種有限且寶貴的資源的工作上更是不可少的。
本研究提出一個動態資源配置的方法，以reward-penalty(報酬─賠償)的觀念，找出在有限的資源下做最有效的分配的解決方案。使得真正需要使用資源的使用者可以確實地獲得所要求的資源，並得到服務品質保證。系統資源管理者或服務提供業者在有限資源的限制下，透過允入控制與資源配置兩個重要程序，將資源作最有效的管理與分配，並同時讓系統獲得最大的收益。而系統內的使用者為配合系統的資源分配，本身的資源調整也以平滑式(smooth)的調整為原則。因此本研究所提出之動態資源配置演算法在資源分配上除了對新提出要求的資源做最有效的配置外，對已存在的使用者提供使用者要求的資源和保證服務品質，同時系統更能獲得本身收益的最大化。
在模擬實驗的結果中，我們可以得知本研究所提出的reward-penalty(報酬─賠償)的觀念所建構出來之系統，顯著的優於所謂的考慮單一reward (報酬)的觀念所建構出來的系統，兩者模擬比較後可以發現，CB method在做允入控制時不僅考慮了要求者的報酬率(reward rate)，同時也對其賠償率(penalty rate)列為預測的重要參數之一，有效掌握此兩者資訊，便能表現出較佳的效能。

With the rapid development of Web-based technologies, our daily life has become intensely involved with Internet. Combined with the maturity of wireless network technologies, the transmission of multimedia data using mobile communication equipments will surely become the next step of Internet usage. More and more real-time data and massive amount of information are being transmitted on the Internet, making the bandwidth a scarce resource. To resolve the congestion of Internet, therefore, the efficient management and distribution of limited and valuable resource is more important than the enhancement of it.

Our research posed a dynamic resource allocation method, which exploited the reward-penalty concept in order to find the most efficient allocation solution under the constraint of limited resources. The method enabled the users who need to use resource to achieve the necessary resources and their guarantee of quality. The system resource managers or service providers could make the best arrangement of their constrained resources and gain the highest reward through two essential procedures: Admission Control and Resource Allocation. Users themselves, on the other hand, “smoothly” adjust the resource they had to match the resources they gained. Our algorithm provided existent users with what they requested while at the same time maximized the benefit of the system and made the most efficient arrangement of resources in regards to new requests.

The consequences of simulation experiments showed that our system, which was based on reward-penalty model, is apparently superior to the so-called one based on reward model. The results also showed that CB method took users’ reward rate as well as their penalty rate into account while maintaining admission control.

目錄
第一章 緒論..................................................1
1.1研究背景..................................................1
1.2 研究動機與目的...........................................3
1.3研究流程..................................................6
1.4論文架構..................................................7
第二章 文獻探討..............................................8
第三章 系統模式與資源配置設計................................17
3.1系統架構(SYSTEM MODEL) ....................................18
3.2目標函數...................................................21
3.3本研究之演算法─CONTRIBUTION-BASED METHOD..................22
第四章 系統模擬與實驗...........................................29
4.1開發工具與系統環境介紹.....................................29
4.2模擬的內容.................................................29
4.3對照組演算法之設計(REWARD-BASE METHOD).....................31
4.4系統模擬與評估比較.........................................32
4.4.1要求者到達率參數(arrival rate)..........................33
4.4.2要求者對系統的報酬率參數(reward rate)...................34
4.4.3系統對要求者的賠償率參數(penalty rate)..................35
4.4.4系統拒絕要求者的賠償率參數(drop penalty rate)...........36
第五章 結論與未來展望...........................................37
5.1結論.......................................................37
5.2未來展望...................................................39
參考文獻........................................................41

圖表目錄
圖1-1 研究流程圖................................................6
圖2-1 多媒體資料傳輸之特性......................................10
圖2-2 頻寬之壓縮前、後..........................................11
圖3-1 使用者要求系統資源........................................17
圖3-2 參與系統整體收益計算之使用者示意圖........................22
圖3-2 使用者I被犧牲頻寬前.......................................24
圖3-3 使用者I被犧牲頻寬後.......................................25
圖3-4 CB METHOD流程圖...........................................28
圖4-1改變要求者到達率參數之模擬結果.............................33
圖4-2改變要求者對系統的報酬率參數之模擬結果.....................34
圖4-3改變系統對要求者的賠償率參數之模擬結果.....................35
圖4-4 改變系統拒絕要求者的賠償參數之模擬結果....................36

參考文獻

[1].S. T. Cheng, C. M. Chen (2000) “Dynamic Round-based Resource Management for On-demand Multimedia Servers.”, Computer Science, vol. 43, pp. 386-395.
[2].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.
[3].D. Ayyagari, A. Ephremides, (1999) “Admission Control with priorities: Approaches for multi-rate wireless systems”, Mobile Networks and Applications, vol. 4, pp. 209-218.
[4].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.
[5].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
[6].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.
[7].K. Nahrstedt and J. M. Smith. (1995) “The QoS Broker.” IEEE Multimedia, vol. 2, no. 1, Spring, pp. 53-67.
[8].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.
[9].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.
[10].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.
[11].S. Ramanathan and P. V. Rangan. (1994) “Architecture for personalized multimedia.”, IEEE Multimedia, Spring, pp. 37-46.
[12].H. M. Vin, A. Goyal, P. Goyal. (1995) “Algorithms for designing multimedia servers.”, Computer Communications, 18, pp. 192-203.
[13].E. Chang and A. Zakhor. (1996) “Cost analysis for VBR video servers.”, IEEE Multimedia, Winter, pp. 56-71.
[14].P. Rangan and H. M. Vin. (1991) “Designing File Systems for Digital Video and Audio.”,12th ACM Symposium on Operating Systems.
[15].H. M. Vin, P. Goyal, and A. Goyal. (1994) “A Statistical Admission Control Algorithm for Multimedia Servers.”, ACM Intl. Conference on Multimedia, San Francisco.
[16].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.
[17].I. Chen and C. Chen. (1996) “Threshold-based admission control policies for multimedia servers.”, Computer Journal, 39(9), pp. 1-10.
[18].D I. Yoon and B. Lee. (1999) “A Distributed Dynamic Call admission Control that supports Mobility of Wireless Multimedia Users.”,ICC’99, pp. 1442-1446.
[19].S. Biswas and B. Sengupta. (1997) “Call Admissibility for Multirate Traffic in Wireless ATM Networks.”,IEEE INFOCOM’97, pp. 650-659.
[20].R. Ramjee, D. Towsley, and R. Nagarajan. (1997) “On Optimal call admission control in cellular networks”,Wireless Networks,3, pp. 29-41.
[21].C. Ho and C. Lea. (1999) “Improving call admission policies in wireless networks”, Wireless Networks, 5, pp. 257-265.
[22].S. Jordan and P.P. Varaiya, (1994) “Throughput in multiple service multiple resource communication networks.”, IEEE Trans. Communications 39, pp. 1216