簡易檢索 / 詳目顯示

研究生: 顏鴻聖
HORNG-SHENG YAN
論文名稱: 以可調變式光纖延遲線建構之漏失系統的佇列分析
Queueing Analysis of Loss Systems with Variable Optical Delay Lines
指導教授: 李端興
Duan-Shin Lee
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2007
畢業學年度: 95
語文別: 英文
論文頁數: 29
中文關鍵詞: 光緩衝器可調變式光纖延遲線最佳分配完整分享
外文關鍵詞: optical buffers, variable optical delay lines, optimal assignment, complete sharing
相關次數: 點閱:1下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 一個新式的光學裝置在最新的文獻被提出來,其名為「可調變式光纖延遲線(VODL)」。正如其名,一VODL 的延遲時間可以被動態的調變設定在一特定的延遲時間範圍之內。一旦被設定好延遲時間,VODL 就可運作如同傳統的光纖延遲線去接收相等延遲要求的封包。因而,一VODL 可以被視為一伺服器,其服務時間恰為需要的延遲時間。
    在這篇論文中,我們考慮的漏失系統由多條平行的VODL 所組成,其可以接收不同種類的封包。這樣的漏失系統跟傳統的漏失系統不同之處在於VODL 即使已被佔據,將仍可接收相同延遲時間的封包。在VODL 數目為無限多的情況下,我們證明了被多種不同種類的封包所佔用的VODL 數目仍然有著乘積型式的解。然而,對於有限數目的VODL 的分析就困難多了。對此,我們提出一基於狀態修截的求近似值的方法。我們驗證了用我們的求近似值的方法所計算出的封包漏失機率與實際模擬的結果非常相近。為了使此種漏失系統的封包漏失機率達到最小,我們也考慮了如何預先分配VODL 給各種類封包的方法。我們可以證明在網路流量低的時候,「完整分享」,也就是不預先分配任何的VODL 出去,為最佳的操作方式。在一般網路流量的情況下,我們提出一個貪婪搜尋演算法來找出絕佳的VODL 預先分配方式。模擬的結果證實了我們的貪婪搜尋演算法找出的解幾乎跟最佳解一樣出色。


    Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically set within a certain range. Once set, a VODL behaves like a traditional fiber delay line and can admit packets requiring the same delay as that set by the VODL. As in the queueing context, a VODL can thus be viewed as a
    server that serves packets with the service times equal to the required delays.
    In this thesis, we consider loss systems with parallel VODLs subject to various classes of packet arrivals. Such loss systems are different from the classical loss systems as a VODL, even occupied, can still admit new packets with the same delay. For the case with an infinite number of VODLs, we show that the number of VODLs occupied by different classes of packets still has a product form solution. However, the analysis for the case with a finite number of VODLs is much more difficult. For this, we propose an approximation method based on state truncation. We show that the packet loss probabilities derived from our approximation are very close to those generated from simulations. In order to minimize the packet loss probabilities in such loss systems, we also consider the problem of assigning dedicated VODLS to various classes of packets. We show under the light traffic condition, the complete sharing policy, i.e., the policy that does not assign any dedicated VODLs, is optimal. For the general traffic condition, we propose a greedy search algorithm to find a suboptimal assignment of dedicated VODLS. Simulation results show that our greedy algorithm yields very good assignments when comparing with the optimal ones.

    Contents 1 Introduction 1 2 Modelling and Analysis 4 2.1 Queueing model ......4 2.2 The Markov chain ......7 2.3 The case with an infinite number of VODLs ......8 2.4 The case with a finite number of VODLs ......10 2.5 An upper bound ......11 3 Optimal Assignment of Dedicated VODLs 13 3.1 Complete sharing in light traffic ......13 3.2 A greedy search algorithm ......13 4 Simulation and Numerical Results 15 5 Conclusion 25 List of Figures 1 A variable optical delay line ......2 2 A loss system with c variable optical delay lines and d classes of packets ......5 3 The search graph for c = 4 and d = 2 ......14 4 The arrival rates of all classes are equal ......16 5 The arrival rates of traffic classes are increasing ......17 6 The arrival rate of traffic classes are decreasing ......17 7 The relative frequency of the relative errors ......18 8 The packet loss probability of the solution obtained by the greedy search algorithm, the exhaustive algorithm, the complete sharing scheme and a hybrid proportional assignment scheme ......19 9 The optimality ranking of the greedy search algorithm, the exhaustive search algorithm, the complete sharing scheme and a hybrid proportional assignment scheme ......20 10 The optimality difference of the greedy search algorithm, the exhaustive search algorithm, the complete sharing scheme and a hybrid proportional assignment scheme ......21 11 Comparison of the approximation method and the upper bound in light traffic ......23

    [1] F. Callegati, "Optical buffers for variable length packets," IEEE Communications Letters, Vol. 4, No. 9, pp. 292-294, Sep. 2000.
    [2] C.-S. Chang, D.-S. Lee and C.-K. Tu, "Recursive construction of FIFO optical multiplexers with switched delay lines," IEEE Trans. on Information Theory, Vol. 50,
    No. 12, pp. 3221-3233, December 2004.
    [3] C.-S. Chang, Y.-T. Chen, D.-S. Lee, "Construction of Optical FIFO Queues," IEEE Trans. on Info. Theory, Vol. 52, No. 6, p. 2838-2843, June 2006.
    [4] C.-S. Chang, T.-H. Chao, J. Cheng, D.-S. Lee, "Constructions of Fault Tolerant Linear Compressors and Linear Decompressors," IEEE Infocom 2007.
    [5] C. J. Chang-Hasnain, P.C. Ku, J. Kim, and S.L. Chuang, "Variable optical buffer using slow light in semiconductor nanostructures." Proceedings OF The IEEE, vol.
    91, pp. 1884-1897, Nov. 2003.
    [6] Y.-T. Chen, C.-S. Chang, J. Cheng, D.-S. Lee, "Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts," IEEE
    Infocom 2007.
    [7] H.-C. Chiu, C.-S. Chang, J. Cheng, D.-S. Lee, "Using a Single Switch with O(M)
    Inputs/Outputs for the Construction of an Optical Priority Queue with O(M^3) Buffer," IEEE Infocom minisymposium 2007.
    [8] I. Chlamtac, A. Fumagalli, L. G. Kazovsky, P. Melman, W. H. Nelson, P. Poggiolini, M. Cerisola, A. N. M. M. Choudhury, T. K. Fong, R. T. Hofmeister, C. L. Lu, A.
    Mekkittikul, D. J. M. Sabido IX, C. J. Suh and E. W. M. Wong, "Cord: contention resolution by delay lines," IEEE Journal on Selected Areas in Communications, Vol. 14, pp. 1014-1029, 1996.
    [9] I. Chlamtac and A. Fumagalli, and C.-J. Suh, "Multibuffer delay line architectures
    for efficient contention resolution in optical switching nodes," IEEE Transactions on Communications, Vol. 48, pp. 2089-2098, 2000.
    [10] C.-C. Chou, C.-S. Chang, D.-S. Lee, J. Cheng, "A necessary and sufficient condition for the construction of 2-to-1 optical FIFO multiplexers by a single crossbar switch
    and fiber delay lines," IEEE Trans. on Info. Theory, vol. 52, no. 10, pp. 4519-4531, October 2006.
    [11] R. L. Cruz and J. T. Tsai, "COD: alternative architectures for high speed packet switching," IEEE/ACM Transactions on Networking, Vol. 4, pp. 11-20, February
    1996.
    [12] D. K. Hunter, M. C. Chia and I. Andonovic, "Buffering in optical packet switches," IEEE Journal of Lightwave Technology, Vol. 16, pp. 2081-2094, 1998.
    [13] D. K. Hunter, W. D. Cornwell, T. H. Gilfedder, A. Franzen and I. Andonovic, "SLOB: a switch with large optical bu□ers for packet switching," IEEE Journal of
    Lightwave Technology, Vol. 16, pp. 1725-1736, 1998.
    [14] D. K. Hunter, D. Cotter, R. B. Ahmad, D. Cornwell, T. H. Gilfedder, P. J. Legg and I. Andonovic, "2 * 2 buffered switch fabrics for traffic routing, merging and shaping in photonic cell networks," IEEE Journal of Lightwave Technology, Vol. 15, pp. 86-101, 1997.
    [15] P. C. Ku, C .J. Chang-Hasnain, and S. L. Chuang, "Variable semiconductor all optical buffers," Electron. Lett., vol. 38, pp.1581-1583, Nov. 2002.
    [16] K. Laevens and H. Bruneel, "Analysis of a single-wavelength optical buffer," IEEE
    Infocom 2003.
    [17] J. Liu and T. T. Lee, "Blocking and delay analysis of optical buffer with general packet length distribution," IEEE Infocom minisymposium 2007.
    [18] X. Lu and B. L. Mark, "Performance modeling of optical-burst switching with fiber delay lines," IEEE Trans. on Commun., vol. 52, no. 12, pp. 2175-2183, Dec. 2004.
    [19] J.P. Marangos, "Electromagnetically induced transparency," J. Modern Opt., 1998, 45, pp. 471-503.
    [20] R. Nelson, "Probability, Stochastic Processes, and Queueing Theory," Springer Verlag, 1995.
    [21] S.M. Ross, "Stochastic Processes," Wiley, 1983.
    [22] A.D. Sarwate and V. Anantharam, "Exact emulation of a priority queue with a switch and delay lines," Queueing Systems: Theory and Applications, vol. 53, pp. 115-125, July 2006.
    [23] J. T. Tsai, "COD: architectures for high speed time-based multiplexers and buffered packet switches," Ph.D. Dissertation, University of California, San Diego, 1995.
    [24] R. S. Tucker, P. C. Ju and C. J. Chang-Hasnain, "Slow-light optical buffers: capabilities and fundamental limitations," J. Lightw. Technol., vol. 23, no. 12, pp.
    4046-4066, Dec. 2005.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE