查詢結果分析
來源資料
相關文獻
- Performance Evaluations with Arbitrary Transceiver Tuning Latencies in Passive Star-coupled DWDM Networks
- ADSL高速網路架構
- 航空客運業知覺品質與其前因變項之分析
- 各種品質提昇活動的探討
- 百貨公司消費者購買行為及滿意度之研究--以桃園市遠東百貨為例
- 期望服務與服務績效影響服務品質評量之研究
- 臺北市產業工會服務品質之探討--以製造業、營造業及運輸、倉儲、通信業為調查對象
- 大樓管理業服務品質之研究
- 全面品質管理對顧客滿意經營與服務品質提升影響程度之實證研究--以銀行信用卡業務為例
- 非營利機構之服務品質研究--以國立歷史博物館展覽組義工運用為例
頁籤選單縮合
題名 | Performance Evaluations with Arbitrary Transceiver Tuning Latencies in Passive Star-coupled DWDM Networks=被動式星狀耦合器光纖網路中任意長度傳輸延遲之網路效能評估 |
---|---|
作者 | 黃依賢; 黃一峰; 顧凌峰; | 書刊名 | 康寧學報 |
卷期 | 5 2003.06[民92.06] |
頁次 | 頁89-114 |
分類號 | 448.6 |
關鍵詞 | 波長分割多工; 交換器延遲時間; 服務品質; 多重訊息排程演算法; 接收器-群組演算法; DWDM; Switching tuning latency; QoS; Multiple messages scheduling algorithm; Receiver-grouping algorithm; |
語文 | 英文(English) |
中文摘要 | 波長分割多工技術是一個提高網路頻寬的未來主流技術。為了能夠更有效率的使用這樣大的網路頻寬,學者們即研究波長分割多工技術中的網路傳輸協定。我們可以將這樣的傳輸協定分為兩類:先置傳輸方式和(Pre-allocation)動態配置傳輸方式(Reservation)。 當資料傳輸時,兩種通訊協定都會遇到同樣的問題,那就是調整更換所需要延遲的時間(tuning latency)。頻道更換在先置傳輸方式中比較少發生,並且已經被部份學者解決。在動態傳輸方式中,頻道更換的機率大,所以延遲時間對於整個系統的效能會有極大的影響。 這一部份的研究往往被忽略。而且就現有的雷射半導體技術來看,頻道更換延遲時間在最近的未來還是無法減少到一個可以接受並且合理的範圍。所以在這一篇論文中,我們將會針對目前光纖元件所產生最大最小範圍內的頻道更換延遲時間,觀察它對於系統效能的影響。此外,我們更提出一個新的方法-接收端分群(receiver grouping)-來消除接收端的頻道更換的延遲時間,改進封包的平均延遲時間和網路的效能。 經由模擬的結果發現,頻道更換延遲時間對於網路效能的確會有顯著的影響,而接收端分群的方法在頻道數目少以及使用者增加的情況下會明顯的增加網路的效能。 |
英文摘要 | DWDM (Dense Wavelength Division Multiplexing) is a highly promising solution to provide high bandwidth networks. In order to make more efficient use of large bandwidth, two types of DWDM transmission protocols have been designed: reservation-based protocols and pre-allocation protocols. A reservation-based protocol used at least one control channel to reserve access to the remaining data channels. A pre-allocation protocol uses all channels for data transmission. The reservation-based protocol is considered in this paper due to its more dynamic features, although the switching tuning latency is an inevitable physical limitation factor during data transmission between the different wavelengths (channels0. Currently, switching schemes in the range of microseconds or even hundreds of nanoseconds seem to be well within reach. Reducing the tuning time down to a reasonable range is unlikely to be possible in the near future. Unfortunately, the impacts of swithching tuning latency on QoS during data transmission have not been studied. Thus, in this paper, we explore the impact of arbitrary tuning latency on transmitting data of variable lengths. Two on-line scheduling algorithms are proposed: the first is multiple messages scheduling algorithm that performs best in mean packet delay and channel utilization. The multiple messages per node schedules with an EAT channel assignment algorithm under arbitrary tuning latency. The second is a receiver-grouping algorithm that divides the receivers into several smaller groups to reduce the tuning time on the receiver end. We evaluate these two methods by comparing their channel utilization and average packet delay. From the simulation results, the tuning latency indeed affects the system performance. The receiver grouping algorithm proposed in this paper has the shorter average delay when the tuning latency is greater than or equal to 0.3 μs. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。