Gridless optical routing and spectrum assignment

1. A method implemented by a processing device in an optical network, the method comprising:

responsive to one or more new channel requests for the optical network comprising a plurality of links and a plurality nodes that utilize gridless optical routing and spectrum assignment, performing a path computation utilizing frequency markers to determine feasibility of the one or more new channel requests, wherein optical spectrum on the plurality of links is represented as a real line with the frequency markers indicative of used optical spectrum to support the gridless optical routing and spectrum assignment, wherein the frequency markers are maintained in a data store associated with the processing device, wherein the processing device is in communication with one or more of the nodes;

configuring nodes in the optical network associated with the one or more new channel requests on one or more links to utilize associated optical spectrum thereon based on the path computation, the frequency markers, and allocation criteria; and

responsive to the configuring of the one or more new channel requests, updating the associated frequency markers on the real line in the data store for the one or more links.

2. The method of claim 1 , wherein the allocating utilizes a modified graph and the allocating, which is one or more of grouped and interleaved based on varying Guard Bands and Dead Bands, is based on a minimal Hamiltonian path through the modified graph.

3. The method of claim 1 , further comprising:

flooding updates via a control plane subsequent to the updating.

4. The method of claim 1 , wherein the new channel request comprises a media channel or a super channel.

5. The method of claim 1 , wherein the representing further comprises utilizing a grid vector in addition to the frequency markers, wherein the grid vector delineates the optical spectrum into finely granular grids for management thereof.

6. The method of claim 1 , wherein the path computation is performed via a Finite State Machine using the frequency markers to determine the feasibility for each link.

7. The method of claim 1 , further comprising:

utilizing a bipartite graph for bin packing to assign non-contiguous optical channels of the one or more new channel requests.

8. The method of claim 1 , wherein the allocating comprises an expansion factor enabling the one or more new channel requests to support additional capacity.

9. The method of claim 1 , wherein the allocating comprises first attempting to assign the one or more new channel requests to gaps in existing media channels.

10. A system comprising:

circuitry adapted to perform a path computation utilizing frequency markers, to determine feasibility of the one or more new channel requests responsive to one or more new channel requests for an optical network comprising nodes interconnected by a plurality of links that utilize gridless optical routing and spectrum assignment, wherein optical spectrum on the plurality of links is represented as a real line with the frequency markers indicative of used optical spectrum to support the gridless optical routing and spectrum assignment, wherein the frequency markers are maintained in a data store associated with the processing device;

circuitry adapted to cause allocation, through configuration of a plurality of nodes in the optical network, of the one or more new channel requests on one or more links to utilize associated optical spectrum thereon based on the path computation, the frequency markers, and allocation criteria; and

circuitry adapted to update the associated frequency markers on the real line for the one or more links responsive to the allocation of the one or more new channel requests in the data store that is communicatively coupled to the plurality of nodes.

11. The system of claim 10 , wherein the circuitry adapted to allocate utilizes a modified graph and the allocating, which is one or more of grouped and interleaved based on varying Guard Bands and Dead Bands, is based on a minimal Hamiltonian path through the modified graph.

12. The system of claim 10 , further comprising:

circuitry adapted to flood updates via a control plane subsequent to updates.

13. The system of claim 10 , wherein the new channel request comprises a media channel or a super channel.

14. The system of claim 10 , wherein the circuitry adapted to represent further utilizes a grid vector in addition to the frequency markers, wherein the grid vector delineates the optical spectrum into finely granular grids for management thereof.

15. The system of claim 10 , wherein the path computation is performed via a Finite State Machine using the frequency markers to determine the feasibility for each link.

16. The system of claim 10 , further comprising:

circuitry adapted to utilize a bipartite graph for bin packing to assign non-contiguous optical channels of the one or more new channel requests.

17. The system of claim 10 , wherein the circuitry adapted to allocate utilizes an expansion factor enabling the one or more new channel requests to support additional capacity.

18. The system of claim 10 , wherein the circuitry adapted to allocate first attempts to assign the one or more new channel requests to gaps in existing media channels.

19. A processing device comprising:

a network interface communicatively coupled to an optical network;

a processor communicatively coupled to a data store and the network interface; and

memory storing instructions that, when executed, cause the processor to

responsive to one or more new channel requests for the optical network that includes a plurality of links that utilize gridless optical routing and spectrum assignment, perform a path computation utilizing frequency markers to determine feasibility of the one or more new channel requests on corresponding links of the plurality of links, wherein optical spectrum on the plurality of links is represented as a real line with the frequency markers indicative of used optical spectrum to support the gridless optical routing and spectrum assignment, wherein the frequency markers are maintained in the data store,

cause allocation of the one or more new channel requests on one or more links to utilize associated optical spectrum thereon based on the path computation, the frequency markers, and allocation criteria, and

responsive to the allocation of the one or more new channel requests, update the associated frequency markers on the real line in the data store for the one or more links.

20. The processing device of claim 19 , wherein the one or more new channel requests are allocated using a modified graph and based on a minimal Hamiltonian path through the modified graph, wherein the allocation is one or more of grouped and interleaved based on varying Guard Bands and Dead Bands.