English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 64745/64745 (100%)
造訪人次 : 20424610      線上人數 : 294
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/8617


    題名: 以優先序為基礎的OBS通道排程之研究;Priority-based Channel Scheduling for Optical Burst Switching in DWDM Networks
    作者: 顏瑞祥;Jui-Hsiang Yan
    貢獻者: 資訊工程研究所
    關鍵詞: 優先序;最少可用未排程通道;高密度分波多工網路;光突發交換;服務品質;延遲線;Priority;LAUC-VF;Optical Burst Switching;DWDM;QoS;FDLs
    日期: 2002-07-11
    上傳時間: 2009-09-22 11:31:50 (UTC+8)
    出版者: 國立中央大學圖書館
    摘要: 光纖網路(Optical Network)是最近幾年骨幹網路所採取的趨勢,具有傳輸速度快且不易受到電子訊號干擾等特性。光突發交換主要是把多個封包組合成一個burst,再利用光纖網路頻寬大的特質,一次把burst送出。由於光纖網路傳輸速度極快,故其各個交換機所需設定時間極短,獨立的控制信號技術(Out of Band)也應運而生,獨立控制信號技術的控制通道與資料通道是分開的,且控制信號必須先行送出然後接著再送出實際傳輸的資料,所以資料通道使用的排程方式便會影響到整個網路的傳輸速度,也是網路的瓶頸所在。本論文提出一個改進式的通道排程演算法,改善了最少可用未排程通道配合填空(Latest Available Unscheduled Channel with Void Filling,簡稱LAUC-VF)演算法,原有LAUC-VF演算法未考慮已經進入排程的burst,若burst太小而填空的空間大於burst甚多,則此填空會浪費許多空間,造成後來的burst無法有效利用。因此本論文所提之演算法考慮此填空大小是否最適於目前進入排程的burst,再決定其所排入之資料通道,以達到充分利用資料通道的空間,並符合資料通道排程的目的。本文中加入burst優先序的概念,使得優先序高的burst可以有較高的機會進入排程。另外,延遲線亦加入優先序的概念,優先序高的burst可以獲得較多的延遲線圈數,因此當通道擁塞時,其可進入排程的機率也會較高,且保證當網路壅塞時重要的資料仍可送出,以符合網路服務品質(Quality of Service,簡稱QoS)的要求。 Optical Network has become a trend on backbone network. It comes with great constitution including high transmission speed and not to be affected by electronic interference. The idea of Optical burst switching is to combine multiple packets into a single burst, making use of the wide bandwidth of optical network, and send out the burst at one sweep. The control channels and data channels are separated on Out of Band control signaling, and the real data are sent only after the control signal is on its way. This means the schedule method used over data channels would influence the overall transmission speed, and even become a bottleneck on the network. This paper proposes a improved channel scheduling algorithm to refine the Latest Available Unscheduled Channel with Void Filling, LAUC-VF. If the burst length is too small and the empty slot is too big for the burst, then the burst would become a waste for space, lowering the utilization for future use. The algorithm proposed in this paper sees into every channel with empty slots to find the best fit scheduling resolution. In this paper, we induce the idea of prioritized burst. Bursts come with higher priority have higher probability to be scheduled in-line. In addition, the fiber delay lines used here are also prioritized. Higher prioritized bursts can obtain more delay lines. While channels are congested, those bursts would be scheduled with higher probability, and be guaranteed to forward out. This keeps the QoS, working.
    顯示於類別:[資訊工程研究所] 博碩士論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    0KbUnknown436檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋  - 隱私權政策聲明