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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010
Pages260-264
Number of pages5
DOIs
Publication statusPublished - 2010 Dec 28
Event13th International Conference on Network-Based Information Systems, NBiS 2010 - Gifu, Japan
Duration: 2010 Sep 142010 Sep 16

Publication series

NameProceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010

Other

Other13th International Conference on Network-Based Information Systems, NBiS 2010
CountryJapan
CityGifu
Period10-09-1410-09-16

Fingerprint

Frequency allocation
Bandwidth
Routing algorithms
Topology

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Cite this

Hsu, C-F., Hsu, K. K., & Ku, C. H. (2010). An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks. In Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010 (pp. 260-264). [5636006] (Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010). https://doi.org/10.1109/NBiS.2010.29
Hsu, Ching-Fang ; Hsu, Ko Kuan ; Ku, Cheng Hung. / An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks. Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. pp. 260-264 (Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010).
@inproceedings{067f34f27edb4bc9a665905543f17ad8,
title = "An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks",
abstract = "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.",
author = "Ching-Fang Hsu and Hsu, {Ko Kuan} and Ku, {Cheng Hung}",
year = "2010",
month = "12",
day = "28",
doi = "10.1109/NBiS.2010.29",
language = "English",
isbn = "9780769541679",
series = "Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010",
pages = "260--264",
booktitle = "Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010",

}

Hsu, C-F, Hsu, KK & Ku, CH 2010, An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks. in Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010., 5636006, Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010, pp. 260-264, 13th International Conference on Network-Based Information Systems, NBiS 2010, Gifu, Japan, 10-09-14. https://doi.org/10.1109/NBiS.2010.29

An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks. / Hsu, Ching-Fang; Hsu, Ko Kuan; Ku, Cheng Hung.

Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. p. 260-264 5636006 (Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

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

AU - Hsu, Ching-Fang

AU - Hsu, Ko Kuan

AU - Ku, Cheng Hung

PY - 2010/12/28

Y1 - 2010/12/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78650464674&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650464674&partnerID=8YFLogxK

U2 - 10.1109/NBiS.2010.29

DO - 10.1109/NBiS.2010.29

M3 - Conference contribution

SN - 9780769541679

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

SP - 260

EP - 264

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

ER -

Hsu C-F, Hsu KK, Ku CH. An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks. In Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. p. 260-264. 5636006. (Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010). https://doi.org/10.1109/NBiS.2010.29