Switch Architecture

2010 ◽  
pp. 33-66
Author(s):  
Giorgos Dimitrakopoulos ◽  
Davide Bertozzi
Keyword(s):  
Switch Architecture

An ethernet switch architecture for bandwidth provision of broadband access networks

2008 ◽  
Vol 46 (4) ◽  
pp. 160-167 ◽  
Author(s):  
Jonghoon Lee ◽  
Chul-ki Lee ◽  
Jiho Han ◽  
Hanku Chi ◽  
Taesik Na ◽  
...  
Keyword(s):  
Access Networks ◽  
Broadband Access ◽  
Broadband Access Networks ◽  
Switch Architecture ◽  
Ethernet Switch

A Scalable $1\times N$ Optical MEMS Switch Architecture Utilizing a Microassembled Rotating Micromirror

2007 ◽  
Vol 13 (2) ◽  
pp. 336-347 ◽  
Author(s):  
Mohamed A. Basha ◽  
Nikolai Dechev ◽  
Safieddin Safavi-Naeini ◽  
Sujeet K. Chaudhuri
Keyword(s):  
Optical Mems ◽  
Mems Switch ◽  
Switch Architecture

scholarly journals Randomized scheduling algorithm for virtual output queuing switch at the presence of non-uniform traffic

2019 ◽  
Vol 8 (1) ◽  
pp. 50
Author(s):  
Ali Ghiasian ◽  
Majid Jamali
Keyword(s):  
Randomized Algorithms ◽  
High Speed ◽  
Time Slot ◽  
Scheduling Algorithm ◽  
Superior Performance ◽  
High Complexity ◽  
Maximum Weight ◽  
Switch Architecture ◽  
Simulation Results ◽  
Maximum Weight Matching

<span>Virtual Output Queuing (VOQ) is a well-known queuing discipline in data switch architecture that eliminates Head Of Line (HOL) blocking issue. In VOQ scheme, for each output port, a separate FIFO is maintained by each input port. Consequently, a scheduling algorithm is required to determine the order of service to virtual queues at each time slot. Maximum Weight Matching (MWM) is a well-known scheduling algorithm that achieves the entire throughput region. Despite of outstanding attainable throughput, high complexity of MWM makes it an impractical algorithm for implementation in high-speed switches. To overcome this challenge, a number of randomized algorithms have been proposed in the literature. But they commonly perform poorly when input traffic does not uniformly select output ports. In this paper, we propose two randomized algorithms that outperform the well-known formerly proposed solutions. We exploit a method to keep a parametric number of heavy edges from the last time matching and mix it by randomly generated matching to produce a new schedule. Simulation results confirm the superior performance of the proposed algorithms.</span>

Sign in / Sign up

Export Citation Format

Share Document