Patent ID: 7489638

Claim:
A method of generating a schedule for two or more nodes of a network, the method comprising the steps of: (a) generating a network graph accounting for delay between each node of the network; (b) generating a set of network constraints for the network graph, one or more of the network constraints based on the schedule accounting for each delay; and (c) decomposing in accordance with a Birkhoff-Von Neumann decomposition, into a set of transmission matrices, a traffic matrix for the network graph based on the set of network constraints, the set of transmission matrices representing the schedule over a frame period, wherein step (c) decomposes the traffic matrix R in accordance with the Birkhoff-Von Neumann decomposition defined as: R ≤ ∑ k = 1 K ⁢ ϕ k ⁢ σ k , with ∑ k = 1 K ⁢ ϕ k = 1 ⁢ ⁢ and wherein the set (φ k ) 0≦k≦K is a set of positive rational numbers of denominator F and (σ k ) 0≦k≦K is a set of permutation matrices.