Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An Immune Clonal Selection Scheduling Algorithm for Input-Queued Switches

  • Conference paper
Simulated Evolution and Learning (SEAL 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4247))

Included in the following conference series:

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gospodinov, M., Gospodinova, E.: Analysis of iSLIP scheduling algorithm for input-queuing switches. In: International Conference on Computer Systems and Technologies-CompSysTech (2004)

    Google Scholar 

  2. McKoewn, N.: iSLIP: A Scheduling Algorithm for Input-Queued Switches. IEEE Transactions on Networking 7(2) (April 1999)

    Google Scholar 

  3. Chao, H.J.: Saturn: a terabit packet switch using Dual Round-Robin. IEEE Communication Magazine 38(12), 78–84 (2000)

    Article  Google Scholar 

  4. 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)

    Google Scholar 

  5. McKeown, N.: Scheduling Algorithms forInput-Queued Cell Switches, doctoral dissertation, Dept. of EECS, Univ. of California, Berkeley (1995)

    Google Scholar 

  6. Ajmone, M.M., et al.: RPA: A Flexible Scheduling Algorithm for Input Buffered Switches. IEEE Trans. Communications 47(12), 1921–1933 (1999)

    Article  Google Scholar 

  7. 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)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. Dai, J., Prabhakar, B.: The Throughput of Data Switches with and without Speedup. In: IEEE Infocom 2000, pp. 556–564. IEEE Press, Piscataway (2000)

    Google Scholar 

  10. Licheng, J., Lei, W.: A novel genetic algorithm based on immune. IEEE Trans. on System, Man, and Cybernetics—Part A 30, 552–561 (2000)

    Article  Google Scholar 

  11. 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)

    Article  Google Scholar 

  12. 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)

    Article  Google Scholar 

  13. 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)

    Google Scholar 

  14. Licheng, J., Haifeng, D.: An Artificial Immune System: Pogress and Prospect. Acta Electronica Sinica 31(10), 1540–1549 (2003)

    Google Scholar 

  15. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Xidian University, Xi’ an, 710071, China

    Liu Fang & Zhao Jing

Authors
  1. Liu Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhao Jing
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Management, Cheng Shiu University, Kaohsiung County Taiwan, ROC

    Tzai-Der Wang

  2. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  3. AI-ECON Research Center, Department of Economics, National Chengchi University, 11623, Taipei, Taiwan

    Shu-Heng Chen

  4. Department of Computer Science and Technology, University of Sci. & Tech. of China, 230026, Hefei, Anhui, P.R. China

    Xufa Wang

  5. School of Information Technology and Electrical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, Australia

    Hussein Abbass

  6. The Univertity of Tokyo, Japan

    Hitoshi Iba

  7. Department of Computer, University of Science and Technology of China, 230027, Hefei, China

    Guo-Liang Chen

  8. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation