Scheduling with delayed graphs for communication networks
First Claim
Patent Images
1. 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, 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.
9 Assignments
0 Petitions
Accused Products
Abstract
A network of nodes interconnected by links, such as a wavelength division multiplexing (WDM) ring network, is modeled by a delayed graph in which propagation delay between nodes is accounted for. Given the delayed graph, a traffic matrix for an admissible traffic pattern is scheduled over a frame period. Scheduling of the traffic matrix formulates a set of scheduling constraints based on the delays and decomposes the traffic matrix into a set of transmission matrices. Each of the set of transmission matrices is scheduled over the frame period.
57 Citations
22 Claims
-
1. 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, 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A network of nodes interconnected by links including a processor comprising:
-
first means for generating a network graph accounting for delay between each node of the network;
second means for 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
third means for decomposing, 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.
-
-
22. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to implement a method for 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, 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.
-
Specification