An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks

Ching-Fang Hsu, Ko Kuan Hsu, Cheng Hung Ku

研究成果: Conference contribution

7 引文 斯高帕斯(Scopus)

摘要

Light-trail is a new technique, which is generalized from the concept of lightpath. It possesses two major advantages; one is bandwidth sharing and the other one is efficient bandwidth utilization. While a lot of literature investigate the design of routing algorithms, however, the performance of light-trail networks relies on the efficiency of dynamic bandwidth allocation schemes. In this paper, we proposed an efficient dynamic bandwidth allocation scheme named Demand and Delay latency-aware with Two-round Evaluation (DDTE). With a double-check mechanism, DDTE can allocate bandwidth more accurately and efficiently in light-trail networks. In addition to the bandwidth allocation scheme, we proposed a setup/release scheme as well. To demonstrate the superiority of DDTE, we developed a simulation suite composed of four topologies with four scenarios and gathered comparisons between DDTE and the previously proposed Dual Auction algorithm. From simulation results we can observe the significant improvement achieved by DDTE and the setup/release mechanism in both of blocking and delay performance.

原文English
主出版物標題Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010
頁面260-264
頁數5
DOIs
出版狀態Published - 2010 十二月 28
事件13th International Conference on Network-Based Information Systems, NBiS 2010 - Gifu, Japan
持續時間: 2010 九月 142010 九月 16

出版系列

名字Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010

Other

Other13th International Conference on Network-Based Information Systems, NBiS 2010
國家/地區Japan
城市Gifu
期間10-09-1410-09-16

All Science Journal Classification (ASJC) codes

  • 電腦網路與通信
  • 資訊系統

指紋

深入研究「An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks」主題。共同形成了獨特的指紋。

引用此