English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 110944/141864 (78%)
Visitors : 47829822      Online Users : 781
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/113847


    Title: 連線允諾控制中利用平行演算法求最小延遲
    Authors: 黃蓮池
    王三元
    郭家旭
    Keywords: 服務品質;連線允諾控制;片段線函數;到達程序外封;序列演算法;平行演算法
    Quality of service;connection admission control;piecewise linear function;envelope of arrival process;series algorithm;parallel algorithm
    Date: 2006
    Issue Date: 2017-10-19 09:37:30 (UTC+8)
    Abstract: 本文提出一個簡單，但卻很有效率的演算法，用在連線允諾控制上。連線允諾控制是未來多媒體網際網路提供服務品質的第一道控制機制。服務品質使用服務曲線來描述是一個有效的方式，因而Sariowan提出了SCED的排程機制用來保證連線要求的服務曲線。SCED也是屬於EDF，而Firoiu針對EDF的連線允諾控制提出了一種低複雜度的演算法。這種演算法複雜度雖低，但因計算過程是使用序列進行方式，所以比較耗時。因此本文將提出一種演算法，利用平行計算的方式來加速最低延遲的計算。平行演算法不僅保有序列演算法之低複雜度，且可在較短的時間內完成連線允諾控制。除了提出平行演算法外，本文亦修正Firoiu文中的一些錯誤。
    This paper proposed a simple but efficient algorithm, which is applied to the connection admission controls. Connection admission controls are the first gate of control mechanisms for provision of quality of service in the future multimedia Internet. Utilizing a service curve to describe the quality of service is an effective method. Therefore, Sariowan proposed the SCED scheduling mechanism to guarantee the service curves required by connections. The SCED is also a kind of EDF scheduling and Firoiu proposed an algorithm with low complexity for the connection admission control of EDF. Although the complexity of the algorithm is low, it is time-consuming because it processes the calculation in series. Therefore, this paper proposed a new algorithm that accelerates the calculation of the lowest delay by a method of parallel calculation. The parallel algorithm keeps the low complexity of the series algorithm and completes the connection admission control in a shorter time. Except proposing the parallel algorithm, this paper also modified some mistakes in the Firoiu`s paper.
    Relation: TANET 2006 台灣網際網路研討會論文集
    網際網路技術
    Data Type: conference
    Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

    Files in This Item:

    File Description SizeFormat
    600.pdf423KbAdobe PDF2153View/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