博碩士論文 etd-0711101-040858 詳細資訊


[回到前頁查詢結果 | 重新搜尋]

姓名 石翔任(Hsiang-Ren Shih) 電子郵件信箱 shr@water.ee.nsysu.edu.tw
畢業系所 電機工程學系研究所(Electrical Engineering)
畢業學位 碩士(Master) 畢業時期 89學年第2學期
論文名稱(中) 一個簡易的利用排程器狀態資訊的動態網路流量調整機制
論文名稱(英) A dynamic regulation scheme with scheduler feedback information for multimedia network
檔案
  • etd-0711101-040858.pdf
  • 本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
    請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
    論文使用權限

    電子論文:校內校外完全公開

    論文語文/頁數 中文/48
    統計 本論文已被瀏覽 5061 次,被下載 3707 次
    摘要(中)   傳統的調整方法不考慮排程器的狀態,因此即使當排程器的貯列已接收過多細胞或已經空了時,欲被傳送的細胞仍然會在調整器內等待,造成較長或不必要的延遲,並浪費有限的資源。我們提出一種動態的調整機制,其調整的功能會隨著被調整的連線特徵及排程器的狀態而改變。對某一個連線來說,當有太多其他連線的細胞送入排程器時,會加速調整器的傳輸速度,藉由更準確地控制接鄰兩細胞由排程器送出的時間間隔,將網路的延遲降低下來,並且維持排程器該提供給某個連線的頻寬。而當排程器的貯列空了時,也會加速調整器的傳輸速度,藉以增加排程器的throughput。同時我們亦加入jitter的考慮,以符合使用者對即時網路的服務品質 (QoS) 需求。而由於我們的方法並不需經過大量複雜的計算,所以其可適用在高速網路上。經由模擬的結果顯示出我們的動態調整機制可以比其他方法達到較好的效能。
    摘要(英)  Most proposed regulation methods do not take advantage of the state information of the underlying scheduler, resulting in a waste of resources. We propose a dynamic regulation approach in which the regulation function is modulated by both the tagged stream's characteristics and the state information fed-back from the scheduler. The transmission speed of a regulator is accelerated when too much traffic has been sent to the scheduler by the other regulators or when the scheduler's queue is empty. As a result, the mean delay of the traffic can be reduced and the scheduler's throughput can be increased. Since no complicated computation is involved, our approach is suitable for the use in high-speed networks.
    關鍵字(中)
  • 調整器
  • 速率變動
  • 延遲
  • 排程器
  • ATM網路
  • probability mass function (PMF)
  • 關鍵字(英)
  • ATM networks
  • rate jitter
  • probability mass function (PMF)
  • scheduler
  • delay
  • regulator
  • 論文目次 摘要          i
    Abstract        ii
    第一章 簡介      1
    第二章 調整及排程機制 4
    2.0 概述         4
    2.1 調整機制      6
    2.2 排程機制      7
    2.3 系統架構      8
    2.4 RCSP       10
    2.5 Dynamic R&S    11
    第三章 我們的方法   14
    3.1 不考慮jitter   14
    3.2 考慮jitter    21
    第四章 數學分析    23
    第五章 模擬結果    29
    第六章 總結與未來展望 45
    參考文獻        46
    參考文獻 [1]. V. Anantharam and T. Konstantopoulos, “A methodology for the design of optimal traffic shapers in communication networks,” IEEE Transactions on Automatic Control, vol. 44, no. 3, pp583-586, 1999.
    [2]. R. Bolla, F. Davoli, P. Maryni and T. Parisini, “An adaptive neural network admission controller for dynamic bandwidth allocation,” IEEE Transactions on System, Man, and Cybernetics-Part B: Cybernetics, vol. 28, no. 4, pp. 592-601, 1998.
    [3]. R. S. Chang, K. J. Pai and C. L. Chen, “Design of multiple leaky buckets shaper,” Computer Communications, vol. 23, issue: 13, pp. 1307-1318, 2000.
    [4]. R. L. Cruz, “A calculus for network delay, part I: network elements in isolation,” IEEE Transactions on Information Theory, vol. 37, no. 1, pp. 114-131, 1991.
    [5]. M. Fontaine and D. G. Smith, “Bandwidth allocation and connection admission control in ATM networks,” Electronics & Communication Engineering Journal, vol. 8, issue: 4, pp. 156-164, 1996.
    [6]. L. Georgiadis, R. Guerin and A. Parekh, “Optimal multiplexing on a single link: delay and buffer requirements,” IEEE Transactions on Information Theory, vol. 43, no. 5, pp. 1518-1535, 1997.
    [7]. A. Hac, Multimedia Applications Support for Wireless ATM Networks, Prentice Hall PTR, Upper Saddle River, NJ, 2000.
    [8]. S. Iatrou and I. Stavrakakis, “A dynamic regulation and scheduling scheme for real-time traffic management,” IEEE/ACM Transactions on Networking, vol. 8, no. 1, pp. 60-70, 2000.
    [9]. S. Jordan and H. Jiang, “Connection establishment in high-speed networks,” IEEE Journal on selected areas in Communications, vol. 13, no. 7, pp. 1150-1161, 1995.
    [10]. G. Kesidis and T. Konstantopoulus, “Extremal shape-controlled traffic patterns in high-speed networks,” IEEE Transactions on Communications, vol. 48, no. 5, pp. 813-819, 2000.
    [11]. S. K. Kweon and K. G. Shin, “Providing deterministic delay guarantees in ATM networks,” IEEE/ACM Transactions on Networking, vol. 6, no. 6, pp. 838-850, 1998.
    [12]. T. Lizambri, F. Duran and S. Wakid, “Priority scheduling and buffer management for ATM traffic shaping,” Proceedings of 7th IEEE Workshop on Future Trends of Distributed Computing Systems, pp. 36-43, Cape Town, Source Africa, December 1999.
    [13]. N. M. Mitrou and K. Kavidopoulos, “Traffic engineering using a class of M/G/1 models,” Journal of Network and Computer Applications, vol. 21, no. 4, pp. 239-271, 1998.
    [14]. A. K. Parekh and R. G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks: The single-node case,” IEEE/ACM Transactions on Networking, vol. 1, issue: 3, pp. 344-357, 1993.
    [15]. B. V. Patel and C. C. Bisdikian, “End-station performance under leaky bucket traffic shaping,” IEEE Network, vol. 10, issue: 5, pp. 40-47, 1996.
    [16]. H. G. Perros and K. M. Elsayed, “Call admission control schemes: A review,” IEEE Communications Magazine, pp. 82-91, November 1996.
    [17]. D. Saha, S. Mukherjee and S. K. Tripathi, “Carry-over round robin: A simple cell scheduling mechanism for ATM networks,” IEEE/ACM Transactions on Networking, vol. 6, no. 6, pp. 779-796, 1998.
    [18]. J. Soldatos, E. Vayias and N. Mitrou, “CAC and traffic shaping for performance control in ATM: the two-class paradigm,” Computer Networks, vol. 34, issue: 1, pp. 65-83, 2000.
    [19]. H. Zhang and D. Ferrari, "Rate-controlled static-priority queuing," Proceedings of IEEE INFOCOM'93, vol. 1, pp. 227-236, San Francisco, CA, April 1993.
    [20]. ATM Forum, Traffic Management Specification Version 4.1, March 1999. ftp://ftp.atmforum.com/pub/approved-specs/af-tm-0121.000.pdf
    [21]. OPNET Technologies, Inc. OPNET Modeler 7.0.B. Bethesda, MD, June 2000. http://www.opnet.com
    口試委員
  • 許蒼嶺 - 召集委員
  • 吳志宏 - 委員
  • 黃蓮池 - 委員
  • 李錫智 - 指導教授
  • 口試日期 2001-06-27 繳交日期 2001-07-11

    [回到前頁查詢結果 | 重新搜尋]


    如有任何問題請與論文審查小組聯繫