DocumentCode :
1222947
Title :
Using constraint sets to achieve delay bounds in CIOQ switches
Author :
Iyer, Sundar ; McKeown, Nick
Author_Institution :
Comput. Syst. Lab., Stanford Univ., CA, USA
Volume :
7
Issue :
6
fYear :
2003
fDate :
6/1/2003 12:00:00 AM
Firstpage :
275
Lastpage :
277
Abstract :
We previously proposed constraint sets as a simple technique to analyze routers with a single stage of buffering. We extend the technique to analyze combined input and output (CIOQ) routers with two stages of buffering.
Keywords :
buffer storage; delays; packet switching; queueing theory; set theory; telecommunication network routing; CIOQ routers; CIOQ switches; FIFO-OQ router; combined input and output routers; constraint sets; delay bounds; first in first out OQ router; maximal matching algorithm; packets buffering; Algorithm design and analysis; Associate members; Communication switching; Delay; Packet switching; Queueing analysis; Scheduling algorithm; Switches; Throughput; Traffic control;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2003.812712
Filename :
1206820
Link To Document :
بازگشت