Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
EARLIEST DUE DATE FIRST MATCHING FOR INPUTQUEUED CELL SWITCHES
 

Summary: EARLIEST DUE DATE FIRST MATCHING
FOR INPUT­QUEUED CELL SWITCHES
Shizhao Li 1 Jinhui Li 1 Nirwan Ansari 2 \Lambda
1 Elect. & Comp. Engrng. Dept., New Jersey Inst. of Technology, University Heights, Newark, NJ 07102, U.S.A.
2 Information Engrng. Dept., Chinese Univ. of Hong Kong, Sha Tin, Hong Kong (on leave from NJIT)
ABSTRACT
The input­queued switching architecture is becoming an
attractive alternative for high speed switches owing to its
scalability. Tremendous efforts have been made to over­
come the throughput problem caused by the contentions
occurred at input and output sides of a switch. Existing in­
put queueing algorithms mostly aim at improving through­
put without considering QoS features. In this paper, a new
algorithm, referred to as earliest due date first matching
(EDDFM), is introduced to improve upon existing algo­
rithms in term of probability of cell delay overdue. It is
shown both analytically and by simulations that EDDFM
is stable and non­starving. Simulations also demonstrate
that it has lower cell delay overdue probability than previ­
ously proposed algorithms.

  

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

 

Collections: Engineering