CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Genetic Algorithm based Scheduling of an Input Queued Switch

by D. Raghupathikumar, K. Bommanna Raja
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Number 6
Year of Publication: 2012
Authors: D. Raghupathikumar, K. Bommanna Raja
10.5120/4826-7078

D. Raghupathikumar, K. Bommanna Raja . A Genetic Algorithm based Scheduling of an Input Queued Switch. International Journal of Computer Applications. 39, 6 ( February 2012), 37-42. DOI=10.5120/4826-7078

@article{ 10.5120/4826-7078,
author = { D. Raghupathikumar, K. Bommanna Raja },
title = { A Genetic Algorithm based Scheduling of an Input Queued Switch },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 39 },
number = { 6 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 37-42 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume39/number6/4826-7078/ },
doi = { 10.5120/4826-7078 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:26:14.811676+05:30
%A D. Raghupathikumar
%A K. Bommanna Raja
%T A Genetic Algorithm based Scheduling of an Input Queued Switch
%J International Journal of Computer Applications
%@ 0975-8887
%V 39
%N 6
%P 37-42
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper is concerned with a Genetic Algorithm based scheduling an Input-Queued Switch. This paper uses binary encoding of real parameter vectors as chromosomes, as genes and as alleles. In this paper we investigate that a scheduling of IQ with GA we obtain feasible solutions. Initial Population is generated by permutation method and fitness was calculated by weighted sum of the packet arrivals. The tournament method of parent’s selection and single point crossover point is adopted. It is tested with 4 X 4 Input Queued switch. The result shows that the GA has been successfully applied to scheduling of IQ switches. Experimental results are also shown that GA based scheduling of an IQ switches have better performance in throughput and low latency.

References
  1. A.Demers, S.Keshan, and Shenker, “Analysis and Simulation of a fair queueing algorithm,” in SIGCOMM ’89: Symposium proceedings on Communications architecture & protocols, 1989, pp 1-12.
  2. Abhay K.Parkeh and Robert G.Gallager,” A generalized processor sharing approach to flow control in integrated services networks: the single-node case,” IEEE/ACM Trans.Netw.,vol 1,no 3,pp 344-357,1993.
  3. M.Shreedhar and George Varghese,”Efficient fair queuing using deficit round robin,” in SIGCOMM’95: Proceedings of the conference on Applications technologies, architectures, and protocols for computer communication, 1995, pp.231-242.
  4. Ge Nong,Jogesh K.Muppala and Mounir Hamdi,” Analysis of Non Blocking ATM Switches with Multiple Input Queues”, IEEE/ACM Transactins on Networking vol 7,No1, Feb 1999 pp 60-74.
  5. Thomas E. Anderson, Susan S. Owicki, James B. Saxe, and Charles P. Thacker, “High Speed Switch Scheduling for Local Area Networks”, ACM Trans. Computer Systems, Vol.11 No. 4 , PP 319-352,Nov 1993.
  6. Nick Mckeown, Senior Member, IEEE,” The iSLIP Scheduling Algorithm for Input-Queued Switches”, IEEE/ACM Transactions on Networking, VOL 7, No.2 April 1999 pp 188-210.
  7. Neha Kumar,Rong,Pan,Devarat Singh,”Fair Scheduling in Input Queued switches under Inadmissible Traffic”, ACM SIGCOMM poster session ,August, 2005
  8. Dimitrios N.Serpanos and Panagiotis Antoniadis,”FIRM:A Class of Distributed Scheduling Algorithms for High-Speed ATM switches with Multiple Input Queues,”in Proc.IEEE INFOCOM,2000,pp,548-555.
  9. A. Mekkittikul and N. McKeown. “A starvation-free algorithm for achieving 100% throughput in an input-queued switch”. ICCCN, pages 226–231, Oct 1996.
  10. N.Mckeown,”Scheduling algorithms for input-queued cell switches”, Ph.D Thesis, University of California at Berkeley May 1995.
  11. A. Mekkittikul and N. McKeown. “A practical scheduling algorithm to achieve 100% throughput in input-queued switches”. INFOCOM, pages 792–799, Apr 1998.
  12. L.Tassisulas.”Linear complexity algorithms for maximum throughput in radio networks and input queued switches” INFOCOM, Mar 1998,533-539.
  13. Devavrat Shan,Palo Giaccone and D.Prabhakaran, ”An Efficient Randomized Algorithms for Input-Queued Switch Scheduling ”,IEEE, Micro Vol 22,No1,pp 10-18. [14 ] M.Marsan , A.Bianco , E.Leonardi & L.Milia, ” RPA : A Flexible Scheduling Algorithm for Input Buffered Switches” , IEEE Trans. Comm Vol 47, no 12, pp 1921- 1933 , Dec 1999.
  14. Haoran Duan , John W. Lockwood and Sung Mo Kang , Matrix Unit Cell Scheduler MUCS for Input-Buffered ATM Switches”, IEEE COMMUNICATIONS LETTERS, VOL2,No 1,PP 20-23, Jan 1998
  15. Gomes,M.C., Barbosa Povoa et al,”Optimal Scheduling for flexible job shop operations”, International Journal of Production Research”, Vol.11 No 43. Pp 2323-2353,2005.
  16. Bortjan Murovec, Peter Suhel,” A repairing technique for the local search of the job-shop problem”, European Journal of Operational Research, Vo1 1 No 153.
  17. Chakraborty, G.Hirano,Y , ”Genetic Algorithm for Broadcast Scheduling in Packet Radio Networks”, Proceedings of IEEE Evolutionary Computation(1998) 183-188
  18. Yaohui Jin, Jingling Zhang, and Weishen Hu,” A Genetic Algorithm of High-Throughput and Low-Jitter Scheduling For Input-Queued Switches”, Springer, Lecturer Notes in Computer Science, 2005,Vol 3612/2005.
Index Terms

Computer Science
Information Sciences

Keywords

Genetic Algorithm Input-Queued Switch Scheduling Tournament Selection Crossbar-fabric

Powered by PhDFocusTM