Paper Info
Title
Achieving 90% Throughput in a Flow-Oriented Input-Queued Switching Router System
Abstract
Due to the head-of-line (HOL) blocking, the throughput limitation of an input-queued packet switching system with FIFO queues is (2-root 2) = 0.586 (Karol, 1986) (Karol, 1987). Previous results show that for all independent and identical arrival processes, or packets, the throughput can possibly achieve 100%, if some suitable queueing policy and scheduling strategy are used (Anderson, 1993) (Karol, 1992) (McKeown, 1998). However, in the real situation all arrival processes are absolutely not independently and identically distributed, they are flow-oriented. The main purpose of this paper is to study the throughput in a flow-oriented input-queued switching router system utilizing the characteristics of a flow, and to design three scheduling strategies - SFROCF, SFRF, and LFRF. They can achieve 100% throughput for all independent and identical arrival processes and obtain a better throughput than that of McKeown et al.'s OCF (McKeown, 1993)(McKeown, 1998) in real flow-oriented input-queued switching router system on future broadband Internet. Among them, SFRF can achieve 90% throughput approximately, the best one, in the situation. In addition, the three strategies do not lead to the permanent starvation of a non-empty queue, because the weight value of a cell will increase if its waiting time increases. In closing, McKeown et al.'s OCF is a special case of our proposed scheduling strategies when the flow has one cell.
Year
DOI
Venue
1998
10.1007/978-0-387-35388-3_40
HPN
Keywords
Field
DocType
flow-oriented input-queued switching router
Scheduling (computing),Computer science,Network packet,Queue,Computer network,Queueing theory,Independent and identically distributed random variables,Packet switching,Throughput,Router
Conference
Volume
ISSN
ISBN
8
1571-5736
0-412-84660-8
Citations 
PageRank 
References 
1
0.38
5
Authors
2
Name
Order
Citations
PageRank
Geng-Sheng Kuo130031.06
Po-Chang Ko2987.62