|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2010 13th International Conference on Network-Based Information Systems
An Efficient Dynamic Bandwidth Allocation Algorithm with Two-Round Deliberation in Light-Trail Networks
Takayama, Gifu Japan
September 14-September 16
ISBN: 978-0-7695-4167-9
| ASCII Text | x | ||
| Ching-Fang Hsu, Ko-Kuan Hsu, Cheng-Hung Ku, "An Efficient Dynamic Bandwidth Allocation Algorithm with Two-Round Deliberation in Light-Trail Networks," 2012 15th International Conference on Network-Based Information Systems, pp. 260-264, 2010 13th International Conference on Network-Based Information Systems, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/NBiS.2010.29, author = {Ching-Fang Hsu and Ko-Kuan Hsu and Cheng-Hung Ku}, title = {An Efficient Dynamic Bandwidth Allocation Algorithm with Two-Round Deliberation in Light-Trail Networks}, journal ={2012 15th International Conference on Network-Based Information Systems}, volume = {0}, year = {2010}, isbn = {978-0-7695-4167-9}, pages = {260-264}, doi = {http://doi.ieeecomputersociety.org/10.1109/NBiS.2010.29}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 15th International Conference on Network-Based Information Systems TI - An Efficient Dynamic Bandwidth Allocation Algorithm with Two-Round Deliberation in Light-Trail Networks SN - 978-0-7695-4167-9 SP260 EP264 A1 - Ching-Fang Hsu, A1 - Ko-Kuan Hsu, A1 - Cheng-Hung Ku, PY - 2010 KW - light-trail KW - dynamic bandwidth allocation (DBA) VL - 0 JA - 2012 15th International Conference on Network-Based Information Systems ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NBiS.2010.29
Light-trail is a new technique, which is generalized from the concept of light path. 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.
Index Terms:
light-trail, dynamic bandwidth allocation (DBA)
Citation:
Ching-Fang Hsu, Ko-Kuan Hsu, Cheng-Hung Ku, "An Efficient Dynamic Bandwidth Allocation Algorithm with Two-Round Deliberation in Light-Trail Networks," nbis, pp.260-264, 2010 13th International Conference on Network-Based Information Systems, 2010
Usage of this product signifies your acceptance of the Terms of Use.
