Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
2000 Conference on Information Sciences and Systems, Princeton University, March 1517, 2000 Practical Scheduling Algorithms for InputQueued Switches
 

Summary: 2000 Conference on Information Sciences and Systems, Princeton University, March 15­17, 2000
Practical Scheduling Algorithms for Input­Queued Switches
Jinhui Li and Nirwan Ansari
Center for Communications and
Signal Processing Research
Department of Electrical and
Computer Engineering
New Jersey Institute of Technology
University Heights, Newark,
NJ 07102, U.S.A.
Abstract --- The input­queued (IQ) switching ar­
chitecture is becoming an attractive alternative for
high speed switches owing to its scalability. In this
paper, two new algorithms, referred to as maximum
credit first (MCF) algorithm and iterative maximum
credit first (IMCF) algorithm, are introduced. Theo­
retic analysis shows that the credits of an IQ switch
using MCF are bounded for all admissible rate reser­
vations. Simulations show that both MCF and IMCF
have similar performance as the Birkhoff­von Neu­

  

Source: Ansari, Nirwan - Department of Electrical and Computer Engineering, New Jersey Institute of Technology

 

Collections: Engineering