Reservation-based media access controller and reservation-based optical network
First Claim
Patent Images
1. A method of reserving bandwidth in a network, said method comprising the steps of:
- providing a network having a plurality of nodes thereupon;
calculating a demand matrix for bandwidth requirements based upon communication needs among the plurality of nodes;
providing any integer number of time slots aligned around the network, in which alignment is provided through synchronization;
reserving bandwidth for node-to-node communication based upon the demand matrix, said reserving of bandwidth including reserving bandwidth between two nodes based on time-slot alignment; and
scheduling transmission between the two nodes by reservation of wavelengths and time slots through a reservation map based upon at least the demand matrix.
7 Assignments
0 Petitions
Accused Products
Abstract
A method and apparatus for reserving bandwidth in a network includes a series of elements. A demand matrix is calculated, for bandwidth requirements based upon communication needs among a plurality of nodes on the network. An integer number of time slots is provided, aligned around the network. Bandwidth is reserved for node-to-node communication based upon the demand matrix. The reserving of bandwidth reserves bandwidth between two nodes based upon time-slot alignment. Transmission is scheduled between the two nodes by reservation of wavelengths and time slots.
-
Citations
29 Claims
-
1. A method of reserving bandwidth in a network, said method comprising the steps of:
-
providing a network having a plurality of nodes thereupon;
calculating a demand matrix for bandwidth requirements based upon communication needs among the plurality of nodes;
providing any integer number of time slots aligned around the network, in which alignment is provided through synchronization;
reserving bandwidth for node-to-node communication based upon the demand matrix, said reserving of bandwidth including reserving bandwidth between two nodes based on time-slot alignment; and
scheduling transmission between the two nodes by reservation of wavelengths and time slots through a reservation map based upon at least the demand matrix. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 11, 12, 13)
-
-
9. A method of reserving bandwidth in a network, said method comprising the steps of:
-
providing a network having a plurality of nodes thereupon;
calculating a demand matrix for bandwidth requirements based upon communication needs among the plurality of nodes;
providing an integer number of time slots aligned around the network;
reserving bandwidth for node-to-node communication based upon the demand matrix, said reserving of bandwidth including reserving bandwidth between two nodes based on time-slot alignment; and
scheduling transmission between the two nodes by reservation of wavelengths and time slots;
wherein said step of reserving bandwidth comprises constructing a reservation map based upon the demand matrix and collision groups; and
wherein said step of constructing a reservation map comprises the steps of;
configuring a bipartite graph based upon the demand matrix and a series of collision groups;
selecting an unallocated time slot from a plurality of time slots in a reservation frame, said time slot having a maximum number of allocation constraints among the unallocated time slots;
modifying the bipartite graph based upon the allocation constraints of said time slot, wherein indications of said allocation constraints are removed from the bipartite graph;
creating a maximum matching set for the adjusted bipartite graph;
decrementing a weight of original graph edges included in the maximum matching set;
creating a reservation map time slot for the selected time slot based upon the maximum matching set; and
updating time slot constraint data according to the maximum matching set. - View Dependent Claims (10)
-
-
14. A method of creating a reservation map for communications, said method comprising the steps of:
-
creating a demand matrix based upon demand data from a plurality of nodes connected on a network;
configuring a bipartite graph based upon the demand matrix and a series of collision groups;
selecting an unallocated time slot from a plurality of time slots in a reservation frame, said time slot having a maximum number of allocation constraints among the unallocated time slots;
modifying the bipartite graph based upon the allocation constraints of said time slot, wherein indications of said allocation constraints are removed from the bipartite graph;
creating a maximum matching set for the adjusted bipartite graph;
decrementing a weight of original graph edges included in the maximum matching set;
creating a reservation map time slot for the selected time slot based upon the maximum matching set; and
updating time slot constraint data according to the maximum matching set. - View Dependent Claims (15)
-
-
16. A method of communicating data between nodes on an optical network, said method comprising the steps of:
-
generating demand data for each node of a plurality of nodes in an optical network;
creating a demand matrix in at least one node of said plurality of nodes, said demand matrix being based on said demand data, creating a reservation map for each wavelength and each time slot of a reservation frame comprising a plurality of time slots and a plurality of wavelengths, thereby reserving bandwidth on a per time slot and per wavelength basis;
wherein any integer number of time slots are aligned around the optical network, in which alignment is provided through synchronization. - View Dependent Claims (17)
-
-
18. A media access controller for a network, said media access controller comprising:
-
a demand matrix unit for generating a demand matrix based upon bandwidth requirements for node-to-node communication; and
a reservation map unit for creating a reservation map based upon the demand matrix, and based upon allocation constraints for time slots and wavelengths in a reservation frame, wherein the reservation map unit utilizes maximum matching data for communication among a plurality of nodes on the network and the media access controller enables any integer number of time slots to be aligned around the network, in which alignment is provided through synchronization. - View Dependent Claims (22, 23)
-
-
19. A communications node for an optical fiber network, said communications node comprising:
-
a fixed wavelength receiver for receiving optical data at a predetermined wavelength;
a tunable wavelength transmitter for transmitting optical data to destination nodes at a plurality of destination wavelengths; and
a media access controller which creates a reservation map for reserving time slots and wavelengths for transmitting data to the plurality of nodes based upon available time slots and wavelengths in the optical fiber ring, said reservation map being based upon a demand matrix wherein the media access controller enables any integer number of time slots to be aligned around the network, in which alignment is provided through synchronization. - View Dependent Claims (20, 21)
-
-
24. A media access controller for a network, said media access controller comprising:
-
a demand matrix unit for generating a demand matrix based upon bandwidth requirements for node-to-node communication;
a reservation map unit for creating a reservation map based upon the demand matrix, and based upon allocation constraints for time slots and wavelengths in a reservation frame, wherein the reservation map unit utilizes maximum matching data for communication among a plurality of nodes on the network; and
wherein said reservation map unit creates said reservation map by configuring a bipartite graph according to the demand matrix, by selecting a first time-slot from a plurality of unallocated time-slots, said first time slots being selected based upon a maximum number of allocation constraints, updating the bipartite graph based upon the selected first time slot, wherein allocation-constraint vertices, and edges connecting them, are removed, selecting a second time slot from the plurality of unallocated time slots, said second time slots having an updated maximum number of allocation constraints, updating the bipartite graph based upon the second time slot, determining a maximum matching set for the updated graph, and updating the reservation map based upon the maximum matching set.
-
-
25. A communications node for an optical fiber network, said communications node comprising:
-
a fixed wavelength receiver for receiving optical data at a predetermined wavelength;
a tunable wavelength transmitter for transmitting optical data to destination nodes at a plurality of destination wavelengths; and
a media access controller which creates a reservation map for reserving time slots and wavelengths for transmitting data to the plurality of nodes based upon available time slots and wavelengths in the optical fiber ring, said reservation map being based upon demand data from the plurality of nodes;
wherein said media access controller is configured to create said reservation map by configuring a bipartite graph according to the demand matrix, by selecting a first time-slot from a plurality of unallocated time-slots, said first time slots being selected based upon a maximum number of allocation constraints, updating the bipartite graph based upon the selected first time slot, wherein allocation-constraint vertices, and edges connecting them, are removed, selecting a second time slot from the plurality of unallocated time slots, said second time slots having an updated maximum number of allocation constraints, updating the bipartite graph based upon the second time slot, determining a maximum matching set for the updated graph, and updating the reservation map based upon the maximum matching set.
-
-
26. A system for reserving bandwidth in a network, said system comprising:
-
interface means for interfacing with a network having a plurality of nodes thereupon;
calculating means for calculating a demand matrix for bandwidth requirements based upon communication needs among the plurality of nodes;
providing means for providing any integer number of time slots aligned around the network, in which alignment is provided through synchronization;
reserving means for reserving bandwidth for node-to-node communication based upon the demand matrix, said reserving of bandwidth including reserving bandwidth between two nodes based on time-slot alignment;
scheduling means for scheduling transmission between the two nodes by reservation of wavelengths and time slots through a reservation map based upon at least the demand matrix.
-
-
27. A system for reserving bandwidth in a network, said system comprising:
-
interface means for interfacing with a network having a plurality of nodes thereupon;
calculating means for calculating a demand matrix for bandwidth requirements based upon communication needs among the plurality of nodes;
providing means for providing an integer number of time slots aligned around the network;
reserving means for reserving bandwidth for node-to-node communication based upon the demand matrix, said reserving of bandwidth including reserving bandwidth between two nodes based on time-slot alignment;
scheduling means for scheduling transmission between the two nodes by reservation of wavelengths and time slots;
further comprising;
creating means for creating the demand matrix based upon demand data from a plurality of nodes connected on a network;
configuring means for configuring a bipartite graph based upon the demand matrix and a series of collision groups;
selecting means for selecting an unallocated time slot from a plurality of time slots in a reservation frame, said time slot having a maximum number of allocation constraints among the unallocated time slots;
modifying means for modifying the bipartite graph based upon the allocation constraints of said time slot, wherein indications of said allocation constraints are removed from the bipartite graph;
creating means for creating a maximum matching set for the adjusted bipartite graph;
decrementing means for decrementing a weight of original graph edges included in the maximum matching set;
creating means for creating a reservation map time slot for the selected time slot based upon the maximum matching set; and
updating means for updating time slot constraint data according to the maximum matching set. - View Dependent Claims (28)
-
-
29. A system for creating a reservation map for communications, said system comprising:
-
creating means for creating a demand matrix based upon demand data from a plurality of nodes connected on a network;
configuring means for configuring a bipartite graph based upon the demand matrix and a series of collision groups;
selecting means for selecting an unallocated time slot from a plurality of time slots in a reservation frame, said time slot having a maximum number of allocation constraints among the unallocated time slots;
modifying means for modifying the bipartite graph based upon the allocation constraints of said time slot, wherein indications of said allocation constraints are removed from the bipartite graph;
creating means for creating a maximum matching set for the adjusted bipartite graph;
decrementing means for decrementing a weight of original graph edges included in the maximum matching set;
creating means for creating a reservation map time slot for the selected time slot based upon the maximum matching set; and
updating means for updating time slot constraint data according to the maximum matching set.
-
Specification