跳到主要內容

臺灣博碩士論文加值系統

(54.172.135.8) 您好!臺灣時間:2022/01/18 15:17
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:藍珈鷰
研究生(外文):Jia-Yan Lan
論文名稱:在具非精確到達時間之預先保留連線的環境下立即保留之允入控制
論文名稱(外文):Admission control for immediate reservation calls in the environment where advance reservation calls with inexact connection arriving times
指導教授:賴源正賴源正引用關係
指導教授(外文):Yuan-Cheng Lai
學位類別:碩士
校院名稱:國立成功大學
系所名稱:資訊工程學系碩博士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:中文
論文頁數:59
中文關鍵詞:允入控制立即式保留預先式保留中斷機率阻擋機率
外文關鍵詞:blocking probabilityinterrupt probabilityadvance reservationadmission controlimmediate reservation
相關次數:
  • 被引用被引用:0
  • 點閱點閱:173
  • 評分評分:
  • 下載下載:12
  • 收藏至我的研究室書目清單書目收藏:0
  為了提供許多新的多媒體網路應用的需求,立即式保留(immediate reservations)及預先式保留(advance reservations)機置相繼被提出。當使用者事先知道其連線起始時間、連線結束時間、以及使用頻寬等資訊,即可透過預先保留機置做預留的動作,以避免在要求建立連線時因資源不足而被允入控制(admission control)所拒絕。預留頻寬的作法可使系統管理者更有效的安排其資源,讓系統的頻寬使用效能提昇。然而在此種機置下,由於立即性保留連線的優先權比預先保留連線低,因此當已保留頻寬的預留連線真正啟動卻遭遇頻寬不足時,一些立即性保留連線會被中斷,失去其原有的服務保證(Quality of Service, QoS),改採盡力式服務。
  以往研究計算立即性保留連線之中斷機率,皆假設預先保留連線皆會在預定的時間準時建立連線,但一般使用者的行為習性並不是如此;使用者可能提早或延遲建立其預定的連線,因此本論文在允許提前或延後建立連線時間的環境下,提出一個更準確地評估其立即保留連線的中斷機率,實驗結果也證實我們所提出的方法可更精準的計算出連線中斷機率,如此可減低實際中斷的情況發生,確保其所要求的服務品質。
  To satiety the QoS requirements of many new multimedia applications, the mechanisms of immediate reservations and advance reservations were proposed. Users make reservations in advance when they can provide the connection information, including its starting time, duration, and required bandwidth, in order to avoid being rejected by the admission control because of the insufficient available resource at connection establishment. The advance reservation can provide the network message to control network resources efficiency, increasing the resource utilization. Because, immediate reservation calls (IR calls) have a lower priority than advance reservation calls (BA calls), and some of them would be interrupted if no enough bandwidth to be available at the establishment of a BA call. The IR call will be interrupted, and thus lose its QoS guarantee.
  In many previous studies, the interrupt probability of IR calls is under the assumption that BA calls start their connections at the instant they reserved. However, user’s common behavior makes this assumption be not true. Users may establish ahead or behind their connections. Thus, we present a more accurate way to estimate the interrupt probability of IR calls in the environment where BA calls with inexact connection arriving times. The results show that our calculation really gets a higher and more correct interrupt probability of a IR call so that its actual blocking probability is higher and its actual interrupt probability is lower.
1. 簡介 1
2. 背景 3
  2.1 相關研究 3
  2.2 IR calls 之允入控制 3
3. 新的允入控制機置 6
  3.1 基本概念 6
  3.2 允入控制演算法 10
4. 模擬結果 19
5. 多類預先保留環境下立即保留之允入控制 24
  5.1 允入控制演算法 24
  5.2 模擬結果 26
6. 模擬環境的探討30
  6.1 每一BA call 有各自提前或延後的standard deviation(d ) 30
  6.2 BA calls 提前或延後的時間分佈為uniform distribution 32
7. 對於延遲BA calls 探討 37
8. IR calls 中斷機率計算之逼近方式 41
9. 考慮i T 時間點變動的方式(MINT)  52
10. 結論 57
[1]L. C. Wolf, “Resource Management for Distributed Distributed Multimedia Systems”, Kluwer,1996.
[2]R. Braden, D. Clark, and S. Shenker, “Integrated Services in the Internet Architecture: an Overview,” IETF RFC 1633, June 1994.
[3]J. Wroclawski, “Specification of the Controlled-Load Network Element Service,” IETF RFC 2211, Sept. 1997.
[4]S. Shenker, C. Partridge, and R. Guerin, “Specification of Guaranteed Quality of Services,” Internet RFC 2212, Sept. 1997.
[5]S. Shenker and W. Wroclawski, “General Characterization Parameters for Integrated Service Network Elements,” IETF RFC 2215, Sept. 1997.
[6]K. Nichols, S. Blake, F. Baker, and D. Black, “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers,” IEFT RFC 2474, Dec. 1998.
[7]S. Blake, D. Black, M. Carlson, Z. Wang, and W. Weiss, “An Architecture for Differentiated Services,” IETF RFC 2475, Dec. 1998.
[8]B. Teitelbaum, S. Hares, L. Dunn, R. Neilson, V. Narayan, and F. Reichmeyer, “Internet2 Qbone: Building a Testbed for Differentiated Services,” IEEE Network Magazine, pp.8-16, Sept.-Oct. 1999.
[9]R. Bless and K. Wehrle, “Evaluation of differentiated services using an implementation under Linux,” IWQoS '99, 1999.
[10]S. Jamin, D. Clark, S. Shenker, and L. Zhang, “Admission Control Algorithm for Predictive Real-time Service,” In Proceedings 3rd International Workshop on Network and Operating System Support for Digital Audio and Video, pp. 349-356, Berlin, Nov. 1993.
[11]M. Degermark, T. Kohler, S. Pink, and O. Schelen, “Advance Reservations for Predictive Service,” Computer Science, pp. 3-14, Durham, New Hampshire, April 1995.
[12]S. Jamin, P. Danzig, S. Shenker, and L. Zhang, “A Measurement-based Admission Control Algorithm for Integrated Services Packet Networks,” Computer Communication Review, 24(4):2-13, Oct. 1995.
[13]D. D. Clark and W. Fang, “Explicit Allocation of Best Effort Packet Delivery Service,” Techical report, MIT Lab for Computer Science, Boston, Massachusetts, Nov. 1997.
[14]R. A. Guerin and A. Orda, “Networks With Advance Reservations: The Routing Perspective,” IEEE INFOCOM, 2000.
[15]D. Wischik and A. Greenberg, “Admission Control for Booking Ahead Shared Resources,” INFOCOM’98, pp. 873-882.
[16]A. G. Greenberg, R. Srikant, and W. Whitt, “Resource Sharing for Book-Ahead and Instantaneous-Request Calls,” IEEE/ACM Transactions on Networking, vol. 7, no. 1, February 1999.
[17]O. Schelen and S. Pink, “An Agent-based Architecture for Advance Reservations,” In IEEE 22nd Annual Conference on Computer Networks (LCN’97), Minneapolis, Minnesota, Nov. 1997.
[18]O. Schelen and S. Pink, “Aggregating Resource Reservations over Multiple Routing Domains,” In Proceedings of IFIP Sixth International Workshop on Quality of Service (IWQoS’98), Napa Valley, California, May 1998.
[19]Lars C. Wolf and R. Steinmetz, "Concepts for Resource Reservation in Advance," in: Borko Furht (Ed.) Multimedia Technologies and Applications for the 21st Century - Visions of World Experts, Chapter 9, pp. 217-239, Kluwer Academic Publishers, Boston, USA, 1998, ISBN 0-7923-8074-6.
[20]D. Ferrari and A. Gupta, "Resource Partitioning in Real-Time Communication," Proc. IEEE Symposium on Global Data Networking, pp. 128-135, Cairo, Egypt, December 1993.
[21]A. Gupta and D. Ferrari, "Resource Partitioning for Multi-Party Real-Time Communication," Technical Report TR-94-061, International Computer Science Institute, Berkeley, California, November 1994.
[22]O. Schel n and S. Pink, "Resource Sharing in Advance Reservation Agents," In Journal of High Speed Networks, Special issue on Multimedia Networking, Vol 7, No 3-4, 1998.
[23]A. G. Greenberg, R. Srikant, and W. Whitt, " Resource Sharing for Book-Ahead and Instantaneous-Request calls," IEEE/ACM Transactions on Networking, 1999.
[24]R. Srikant and W. Whitt, "Resource Sharing for Book-Ahead and Instantaneous-Request calls using a CLT Approximation," http://citeseer.nj.nec.com/ 73384.html.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top