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

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.