2003 · 48 citations · 13 references
ComputingComputer EngineeringComputer ScienceComputer NetworksInterconnection NetworksQueuing TheoryNetwork SwitchingPacket SwitchingQueueing NetworksQueueing SystemsQueueing TheorySlot AllocationFrame MatchingHeuristicsInput-queued SwitchingMatching AlgorithmsPacket BufferingSwitch ArchitectureSwitch SchedulingSwitching Algorithms
We focus on input-buffered packet switches, which are traditionally controlled slot-by-slot with heuristic approximations (such as iSLIP) of maximum weight or size matching algorithms. We consider instead a frame-based control strategy, in which f slots are grouped in a frame, and contentions are solved only at frame boundaries. A number of frame-based heuristics is described, and simulation is used to show that our approach provides performance advantages over a slot-by-slot control in a number of traffic scenarios.
13
Achieving 100% throughput in an input-queued switch
Nick McKeown, A. Mekkittikul, V. Anantharam et al. · IEEE Transactions on Communications · 1999 · 855 citations
The throughput of data switches with and without speedup
J. G. Dai, Balaji Prabhakar · 2002 · 471 citations