Achieving fair service with a hybrid scheduling scheme for CICQ switches

DOI10.1007/S11432-011-4435-0zbMATH Open1245.68037OpenAlexW2068694937MaRDI QIDQ439760FDOQ439760

Peng Yi, Julong Lan, Hongchao Hu, Yun-Fei Guo

Publication date: 17 August 2012

Published in: Science China Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4435-0

Recommendations

• A non-uniform traffic oriented scheduling algorithm in combined input-crosspoint-queued (CICQ) switches
• A fair service and dynamic round robin scheduling algorithm
• Scheduling policies for CIOQ switches
• Scheduling of an input-queued switch to achieve maximal throughput
• Packetized smooth switching for buffered crossbar switches

zbMATH Keywords

load balancingdynamical re-routingscheduling policyswitching fabric

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness
• Localized Independent Packet Scheduling for Buffered Crossbar Switches

Cited In (1)

• Scheduling policies for CIOQ switches

This page was built for publication: Achieving fair service with a hybrid scheduling scheme for CICQ switches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439760)