Frame-based matching algorithms for input-queued switches

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.