Abstract
This paper presents a novel genetic algorithm (GA) for the scheduling problem of input-Queued switch, which can be applied in various networks besides the design of high speed routers. The scheduler should satisfy quality of service (QoS) constraints such as throughput and jitter. Solving the scheduling problem for the input-Queued switches can be divided into two steps: Firstly, decomposing the given rate matrix into a sum of permutation matrices with their corresponding weights; secondly, allocating the permutation matrices in one scheduling period based on their weights. It has been proved that scheduling problem in input-Queued switch with throughput and jitter constraints is NP-complete. The main contribution of this paper is a GA based algorithm to solve this NP-complete problem. We devise chromosome codes, fitness function, crossover and mutation operations for this specific problem. Experimental results show that our GA provides better performances in terms of throughput and jitter than a greedy heuristic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Li, S., Ansari, N.: Scheduling Input-queued ATM Switches with QoS Features. In: Proceedings of the 7th International Conference on Computer Communications and Networks, pp. 107–112 (1998)
Balas, E., Landweer, P.R.: Traffic Assignment in Communication Satellites. Operations Research Letters 2, 141–147 (1983)
Jin, Y., Su, Y., Zhang, J., Hu, W., et al.: Scheduling in a Packet-switched WDM PON with Reduced Delay and Low-Jitter Performance. In: ECOC, p. 140 (2004)
Jelger, C.S., Elmirghani, J.M.H.: Photonic Packet WDM Ring Networks Architecture and Performance. IEEE communication magazine 40(11), 110–115 (2002)
Kumar, S., Kumar, A.: On Implementation of Scheduling Algorithms in High Speed Input Queuing Cell Switches. In: Proceedings of IEEE ICC, vol. 1, pp. 152–157 (2003)
Spencer, M.J., Summerfield, M.A.: WRAP: A Medium Access Control Protocol for Wavelength-Routed Passive Optical Networks. Journal of Lightwave Technology 18, 1657–1675 (2000)
Kim, Y.H., Chao, J.: Performance of Exhaustive Matching Algorithms for Input-Queued Switches. In: Proceedings of IEEE ICC, vol. 3, pp. 1817–1822 (2003)
Keslassy, I., Kodialam, M., Lakshman, T.V., Stiliadis, D.: On Guaranteed Smooth Scheduling For Input-Queued Switches. In: Proceedings of IEEE INFOCOM, vol. 2, pp. 1384–1394 (2003)
Chang, C.S., Chen, J.W., Huang, H.Y.: Birkhoff-Von Neumann Input Buffered Crossbar Switches. In: Proceedings of IEEE INFOCOM, pp. 1614–1623 (2000)
Rendl, F.: On the Complexity of Decomposing Matrices Arising in Satellite Communication. Operations Research Letters 4, 5–8 (1985)
Jensen, M.T.: Generating Robust and Flexible Job Shop Schedules Using Genetic Algorithms. IEEE Transactions on Evolutionary Computation 7, 275–288 (2003)
Chakraborty, G., Hirano, Y.: Genetic Algorithm for Broadcast Scheduling in Packet Radio Networks. In: Proceedings of IEEE Evolutionary Computation, pp. 183–188 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, Y., Zhang, J., Hu, W. (2005). A Genetic Algorithm of High-Throughput and Low-Jitter Scheduling for Input-Queued Switches. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_12
Download citation
DOI: https://doi.org/10.1007/11539902_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)