Abstract
Immune Clonal Selection Algorithm (ICSA) is a new intelligent algorithm that can effectively overcome the prematurity and has fast conver-gence speed. An Immune Clonal Selection Scheduling Algorithm (ICSSA) is proposed by applying ICSA to the input-queued packet switch scheduling in this paper. ICSSA is compared with other previous algorithms about two performance measures: the average delay and the maximum throughput of the switch. Closed-form expressions for these measures are derived under uniform i.i.d. Bernoulli, diagonal and bursty traffic model. The experimental results show that better performances can be obtained by ICSSA, and 100% throughput can be guaranteed for these traffic models.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gospodinov, M., Gospodinova, E.: Analysis of iSLIP scheduling algorithm for input-queuing switches. In: International Conference on Computer Systems and Technologies-CompSysTech (2004)
McKoewn, N.: iSLIP: A Scheduling Algorithm for Input-Queued Switches. IEEE Transactions on Networking 7(2) (April 1999)
Chao, H.J.: Saturn: a terabit packet switch using Dual Round-Robin. IEEE Communication Magazine 38(12), 78–84 (2000)
Li, Y., Panwar, S., Chao, H.J.: The dual Round-Robin matching switch with exhaustive service. In: Gunner, C. (ed.) Proc. of the IEEE Workshop on High Performance Switching and Routing, pp. 58–63. IEEE Communications Society, Kobe (2002)
McKeown, N.: Scheduling Algorithms forInput-Queued Cell Switches, doctoral dissertation, Dept. of EECS, Univ. of California, Berkeley (1995)
Ajmone, M.M., et al.: RPA: A Flexible Scheduling Algorithm for Input Buffered Switches. IEEE Trans. Communications 47(12), 1921–1933 (1999)
Duan, H., et al.: A High Performance OC12/ OC48 Queue Design Prototype for Input Buffered ATM Switches. In: INFOCOM 1997: 16th Ann. Joint Conf. of the IEEE Computer and Comm. Societies (Infocom 1997), pp. 20–28. IEEE CS Press, Los Alamitos (1997)
McKeown, N., Anantharan, V., Walrand, J.: Achieving 100% Throughput in an Input-Queued Switch. In: Proc. 15th Ann. Joint Conf. of the IEEE Computer and Comm. Societies (Infocom 1996), pp. 296–302. IEEE CS Press, Los Alamitos (1996)
Dai, J., Prabhakar, B.: The Throughput of Data Switches with and without Speedup. In: IEEE Infocom 2000, pp. 556–564. IEEE Press, Piscataway (2000)
Licheng, J., Lei, W.: A novel genetic algorithm based on immune. IEEE Trans. on System, Man, and Cybernetics—Part A 30, 552–561 (2000)
Wei-Cai, Z., Jing, L., Ming-Zhi, X., Li-Cheng, J.: A Multi-Agent Genetic Algorithm for Global Numerical Optimization. IEEE Trans.System,Man and Cybernetics—Part B 34(2), 1128–1141 (2004)
Jing, L., Wei-Cai, Z., Li-Cheng, J.: A multiagent evolutionary algorithm for cons-traint satisfaction problems. IEEE Trans. Syst., Man, and Cybern. B 36(1), 54–73 (2006)
Du, H., Jiao, L., Wang, S.: Clonal Operator and Antibody Clone Algorithms. In: Proceedings of the First International Conference on Machine Learning and Cybernetics, Beijing, pp. 506–510 (2002)
Licheng, J., Haifeng, D.: An Artificial Immune System: Pogress and Prospect. Acta Electronica Sinica 31(10), 1540–1549 (2003)
Leland, W.E., Willinger, W., Taqqu, M., Wilson, D.: On the self-similar nature of Ethernet traffic. In: Poc. of Sigcomm, San Francisco, pp. 183–193 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fang, L., Jing, Z. (2006). An Immune Clonal Selection Scheduling Algorithm for Input-Queued Switches. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_99
Download citation
DOI: https://doi.org/10.1007/11903697_99
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47331-2
Online ISBN: 978-3-540-47332-9
eBook Packages: Computer ScienceComputer Science (R0)