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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Somani, A., Gumaste, A.: Light-trails: Distributed optical grooming for emerging data-center, cloud computing, and enterprise applications. In: Opt. Fiber Commun. Conf. Expo. Natl. Fiber Opt. Eng. Conf., OFC/NFOEC (2011)
Gokhale, P., Kumar, R., Das, T., Gumaste, A.: Cloud computing over metropolitan area WDM networks: The light-trails approach. In: GLOBECOM IEEE Global Telecommun. Conf. (2010)
Gumaste, A., Zheng, S.Q.: Dual auction (and recourse) opportunistic protocol for light-trail network design. In: Int. Conf. Wireless Optic. Com. Netw. (2006)
Gumaste, A., Das, T., Mathew, A., Somani, A.: An autonomic virtual topology design and two-stage scheduling algorithm for light-trail WDM networks. J. of Opt. Comm. and Netw. 3, 372–389 (2011)
Tran, N., Vu, N., Tran, D., Park, J.: ART: A dynamic medium access protocol for closed light-trail networks. In: HUT-ICCE - Int. Conf. Commun. Electron, pp. 144–149 (2008)
Fukushima, Y., Tanaka, K., Yokohira, T.: Performance evaluation of medium access control methods in light trail networks. In: Int. Conf. Adv. Commun. Technol. ICACT, vol. 2, pp. 1421–1425 (2009)
Hsu, C.F., Hsu, K.K., Ku, C.H.: An efficient dynamic bandwidth allocation algorithm with two-round deliberation in light-trail networks. In: Proc. Int. Conf. Netw.-Based Inf. Syst., NbiS, pp. 260–264 (2010)
Gumaste, A., Jain, S., Somani, A.K.: An efficient superscheduler architecture and job migration algorithm for computational grids over light-trail WDM networks. In: Proc. Int. Conf. Broadband Commun., Netw. Syst., BROADNETS (2009)
Bafna, P., Gumaste, A., Ghani, N.: Delay sensitive smoothed round robin (DS2R2) scheduler for high-speed optical Networks. IEEE Commun. Lett. 11, 628–630 (2007)
Gumaste, A., Chandarana, J., Bafna, P., Ghani, N., Sharma, V.: On control plane for service provisioning in light-trail WDM optical ring networks. In: IEEE Int. Conf. Commun., pp. 2442–2449 (2007)
Reaz, A., Ramamurthi, V., Sarkar, S., Ghosal, D., Dixit, S., Mukherjee, B.: CaDAR: An efficient routing algorithm for wireless-optical broadband access network. In: IEEE Int. Conf. Commun., pp. 5191–5195 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, M., Zhuang, Y., He, M., Le, Z. (2012). Delay Aware Time Slot Allocation Algorithm in Light-Trail Network. In: Wang, Y., Zhang, X. (eds) Internet of Things. Communications in Computer and Information Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32427-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-32427-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32426-0
Online ISBN: 978-3-642-32427-7
eBook Packages: Computer ScienceComputer Science (R0)