A method for scheduling data bursts from origin to destination nodes of a communication system involves selecting a yet-unscheduled, feasible node pair for scheduling of a burst therebetween; selecting a timeslot from a finite timeslot sequence; scheduling the burst for the selected timeslot; and repeating the preceding steps to exhaustion of unscheduled demand or of feasible node pairs. The feasibility of a node pair is conditioned on the avoidance of collisions with already-scheduled bursts, taking the various origin-to-destination propagation delays into account.

 
Web www.patentalert.com

> Distributed weighted fair arbitration and forwarding

~ 00384