政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/32722
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113822/144841 (79%)
Visitors : 51824171      Online Users : 531
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/32722


    Title: 以超額允入法提升資源使用率
    Improving Resource Utilization by Over-Admission
    Authors: 黃國展
    Contributors: 連耀南
    Lien,Yao-Nan
    黃國展
    Keywords: 服務品質
    允入控制
    QoS
    Admission Control
    Date: 2005
    Issue Date: 2009-09-17 14:08:05 (UTC+8)
    Abstract: 通訊網路使用網路聚合(Network Convergence)的策略,以此提供一個開放的服務平台,ALL-IP網路,因ALL-IP網路是以封包交換網路承載各類服務[1],所以不容易保證服務品質。一個經常被採用的方式是使用資源保留(Resource Reservation)方式以保證服務品質,但服務可能會因失約或未依約沒有充分運用所保留之資源而導致資源閒置、降低網路資源使用率。為了要提高資源使用率,營運者必須要有解決的方法,以提高整體資源使用的效能。
    本研究提出一個有效使用資源的概念—超額允入(Over-Admission),超額允入的意義是讓允入控制機制允入比所擁有的資源量還要多的訊務量,以增加資源使用的效能。但是超額允入訊務之後,Admission Controller可能會允入過多訊務造成溢流(Overflow)。這會使系統效能下降,所以網路管理者必須要找出合適的允入量以提高系統整體效能。
    本研究建立分析模型係以供計算最佳允入量,並以模擬進行模型驗證與效能評估,經由實驗結果可以驗證本分析模型相當準確而超額允入的確可以大幅提高資源使用率。
    The telecommunication industry is moving toward a converged network, which uses a single global IP based packet-switched network, which uses a single global IP based packet-switched network to carry all types of network services, the quality of service cannot be fully guaranteed [1]. One of the popular methods to guarantee the quality of service is to use resource reservation. This kind of methods, however, might cause resource underutilization because the resource requesters may not show up or, even if does, it does not fully utilize the reserved resources. In order to enhance the efficiency of resource utilization, this study proposed an efficient resource utilization concept, that is, over-admission. Over-admission, in which the admission controller may admit more traffic volume than what it can allowed. Even though over-admission is effective, it has its own problems: the admission controller may admit too excessive traffic to impair the system performance. In order to maintain system performance, it is important for the network administrators to find out the appropriate admitted amount that does not cause excessive overflow.
    In this thesis, an analysis model is constructed to estimate the optimal admitted traffic amount under various traffic conditions. Then, simulation is conducted to verify this model and to evaluate the performance of our proposed method. The results reveal that this analysis model can improve the efficiency of resource utilization.
    Reference: [1] 3rd Generation Partnership Project, “Technical Specification Group Services and Systems Aspects: Architecture for an All IP network,” 3GPP TR 23.922 version 1.0.0., Oct. 1999.
    [2] AQUILA project, http://www-st.inf.tu-dresden.de/aquila/.
    [3] Brady, P., “a model for on-off speech patterns in two-way conversation,” Bell System Technical Journal, Sep. 1696.
    [4] D. Black, M. Carlson, E. Davies, Z. Wang, “An Architecture for Differentiated Services,” RFC 2475, Dec. 1998.
    [5] Coskun Cetinkaya, Vikram Kanodia, and Edward W. Knightly, “Scalable Services via Egress Admission Control,” IEEE Transactions on Multimedia, vol. 3, no. 1, Mar. 2001.
    [6] E. Crawley, Editor, L. Berger, S. Berson, “A Framework for Integrated Services and RSVP over ATM," RFC 2382, Aug. 1998.
    [7] D. Goderis, S. Van den Bosch, Y. T`Joens, P. Georgatsos, D. Griffin, G. Pavlou, P. Trimintzios, G. Memenios, E. Mykoniati, C. Jacquenet, “A service-centric IP quality of service architecture for next generation networks,” NOMS 2002 - IEEE/IFIP Network Operations and Management Symposium, no. 1, Apr. 2002 pp. 139-154.
    [8] Heinanen, J., F. Baker, W. Weiss, and J. Wroclawski, “Assured Forwarding PHB Group,” RFC 2597, Jun. 1999.
    [9] Leonard kleinrock, Queueing systems vol I: theory, pp. 347, 1974.
    [10] Dong Lin, “Constant-Time Dynamic ATM Bandwidth Scheduling for Guaranteed and Best Effort Services with Overbooking,” Proc. IEEE INFOCOM’97, 1997.
    [11] Pascal Lorenz, “Quality of service and new architectures for future telecommunications networks,” MILCOM 2000 - IEEE Military Communications Conference, no. 1, Oct. 2000 pp. 695-698.
    [12] Yao-Nan Lien, Chien-Tung Chen, Ming-Chih Chen, Tsung-Hsung Li and Yi-Min Chen, 2005, “QoS Management for All-IP Core Networks,“ Proceedings of The 11-th Mobile Computing Workshop, Mar. 31, 2005.
    [13] Yao-Nan Lien and Yi-Min Chen, 2005, “Forecasting Error Tolerable Resource Allocation for All-IP Networks,” 3rd International Conference on Information Technology: Research and Education, Jun. 27-30, 2005.
    [14] Miras, D., “Network QoS Needs of Advanced Internet Applications,” Internet2 - QoS Working Group, Nov. 2002.
    [15] Carlos Pazos and Mario Gerla, “Improving Internet Traffic Transport over ABR Backbones Through Bandwidth Overbooking,” Proc. IEEE Globecom `98, 1998.
    [16] TEQUILA project, http://www.ist-tequila.org/.
    [17] Bhuvan Urgaonkar, Prashant Shenoy, and Timothy Roscoe, “Resource Overbooking and Application Profiling in Shared Hosting Platforms,” Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI), Dec. 2002.
    [18] K., K. Varadhan, The ns2 Manual, http://www.isi.edu/nsnam/ns/, Jun. 2005.
    [19] Jacobson, V., K. Nichols, K. Poduri, “An Expedited Forwarding PHB,” RFC 2598, Jun. 1999.
    [20] Xiao, X., L. -M. Ni, “Internet QoS: A Big Picture,” IEEE Network, vol.13, pp.8-18, Mar.-Apr. 1999.
    Description: 碩士
    國立政治大學
    資訊科學學系
    92753019
    94
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0927530191
    Data Type: thesis
    Appears in Collections:[Department of Computer Science ] Theses

    Files in This Item:

    File Description SizeFormat
    53019101.pdf49KbAdobe PDF2775View/Open
    53019102.pdf74KbAdobe PDF2794View/Open
    53019103.pdf68KbAdobe PDF2788View/Open
    53019104.pdf64KbAdobe PDF2709View/Open
    53019105.pdf821KbAdobe PDF2880View/Open
    53019106.pdf53KbAdobe PDF2775View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback