Delay aware time slot allocation algorithm in light-trail network

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Light trail (LT) is a generalization of lightpath with ability to provision emerging IT applications such as data center, clod computing, etc. The time slot allocation (TSA) problem is addressed with respect to delay aware ability. In addition, a delay aware TSA algorithm is given on the basis of bidding policy. The bid value is composed of two parts: the delay bid and the buffer bid. The node which sends the highest bid will get the transmission right of the light trail for the next time slot. Simulation results concerning the traffic and delay in a 5 and 6 nodes light trail network show that: by means of adopting the delay aware TSA algorithm, higher loads which usually need longer delay are allocated the time slots preferentially. Hence, the delay aware TSA algorithm can improve the LT network throughput when assures the transmitting delay less than the maximum-tolerant delay. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Fu, M., Zhuang, Y., He, M., & Le, Z. (2012). Delay aware time slot allocation algorithm in light-trail network. In Communications in Computer and Information Science (Vol. 312 CCIS, pp. 41–48). https://doi.org/10.1007/978-3-642-32427-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free