Please use this identifier to cite or link to this item:
標題: 一個在光封包交換器上具遲延時間認知能力之封包排程方法
Latency-Aware Packet Scheduling for Output-Buffered Optical Switch
作者: 林偉 
關鍵字: 資訊工程--硬體工程;Optical packet switching;光封包交換;packet scheduling;fiber delay line;PIFO queue management;packet latency;封包排程;光纖延遲線;插入先出行列管理;封包遲延時間;基礎研究
This proposal addresses the problem of optimizing packet scheduling for an output-buffered optical switch to minimize end-to-end delay and packet loss. We consider accumulated packet latency as the primary factor for determining system performance of optical switches using fiber delay lines (FDLs). Effective control over accumulated packet latency can not only reduce end-to-end delay, but also lower packet loss rate. For this reason, we devise a priority function for ranking packets in an output buffer with FDLs. The priority function gives preference to packets with high accumulated latency and low residual distance. Packets of this sort are accelerated for the destinations, and the closer, the faster. The proposed research work is divided into three main tasks. First, we propose to design a latency-aware scheduling algorithm that manages a Push-In-First-Out (PIFO) queue for storing delayed packets, and schedules packets for departure based on the priority of latency. Secondly, we plan to develop a new Markovian model to approximate the performance of the latency-aware packet scheduling algorithm with the PIFO queue. We will adopt an iterative computation scheme to compute packet state distribution for convergence, and derive equations for calculating probabilities of end-to-end delay and packet loss. Finally, we will construct a packet-level simulator. The simulator is intended to verify the correctness of the analytical model to be developed. Through simulation, we are also interested in performance comparison of the latency-aware scheduling algorithm with other scheduling disciplines.

其他識別: NSC98-2221-E005-054
Appears in Collections:資訊科學與工程學系所

Show full item record
TAIR Related Article

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.