Suurballe-based cloud service embedding procedure in software-defined flexible-grid optical transport networks

Patent metadata

Field	Value
Publication number	US-9247327-B2
Application number	US-201414510163-A
Country	US
Kind code	B2
Filing date	Oct 9, 2014
Priority date	Oct 10, 2013
Publication date	Jan 26, 2016
Grant date	Jan 26, 2016

Abstract

We propose an efficient procedure, namely disjoint pair procedure based cloud service embedding procedure that first maps working and backup virtual nodes over physical nodes while balancing computational resources of different types, and finally, maps working and backup virtual links over physical routes while balancing network spectral resources using the disjoint pair procedure.

First claim

The invention claimed is:

1. A method comprising the steps of:
implementing by a computer a cloud service embedding in a software defined flexible grid optical transport network, the implementing comprising:
mapping working and backup virtual nodes over physical nodes;
mapping working and backup virtual links over physical routes which comprises:
finding two pairs of node-disjoint routes using a disjoint pair procedure on an auxiliary graph;
selecting a maximum number of virtual links whose node-disjoint routes are partitioned into two separate groups;
allocating spectrum at lowest available wavelength on a selected physical route for a virtual link; and
finding two pairs of node-disjoint routes using the disjoint pair procedure while modifying the auxiliary graph.

2. The method of claim 1 , wherein the disjoint pair procedure comprises Suurballe's procedure.

3. The method of claim 1 , wherein the mapping working and backup virtual nodes over physical nodes comprises arranging virtual nodes in a descending order of average requested computing resources.

4. The method of claim 3 , wherein the mapping working and backup virtual nodes over physical nodes comprises mapping working and backup virtual nodes to physical nodes with those having first and second largest average ration of available to offered computing resources of requested types.

5. The method of claim 1 , wherein the step of finding two pairs of node-disjoint routes using a disjoint pair procedure on an auxiliary graph comprises considering cost of a physical link as a single hop and its physical distance and selecting a pair of node disjoint routes that cumulatively minimizes a required spectrum while not requiring any modification to the auxiliary graph while carrying out the disjoint pair procedure.

6. The method of claim 1 , wherein the step of selecting a maximum number of virtual links comprises the routes in one group being also node disjoint to routes of other group.

7. The method of claim 1 wherein the step of allocating spectrum at lowest available wavelength on a selected physical route for a virtual link comprises minimizing fragmentation of spectrum and increasing probability of mapping virtual links over physical routes.

8. The method of claim 1 , wherein the step of finding two pairs of node-disjoint routes using the disjoint pair procedure while modifying the auxiliary graph comprises considering cost of a physical link as a single hop and its physical distance, and selecting a pair of node-disjoint routes that cumulatively minimizes the required spectrum while modifying the auxiliary graph while applying the disjoint pair procedure to ensure a survivable mapping of a virtual link with respect to already mapped virtual links.

9. The method of claim 1 , wherein the disjoint pair procedure comprises finding spectrum required for a modulation format along a route at a lowest available wavelength while observing the wavelength and spectrum continuity constraints and spectrum conflict constraint and provisioning working and backup virtual links on respective routes using respective modulation formats by allocating spectrum at found wavelengths respectively and provisioning virtual nodes by reserving computational resources of each type at selected physical nodes.

10. The method of claim 1 , wherein the step of selecting a maximum number of virtual links whose node-disjoint routes are partitioned into two separate groups comprises finding a first set A of virtual links wherein one of the node-disjoint routes of a virtual link within the first set A being in a second set W, the other node-disjoint route of the virtual link within the first set A being in a third set B, the routes in the second set W also being node-disjoint with the routes in the third set B, finding the first set A with maximum number of virtual links, the found node-disjoint routes of the virtual links in the first set A being considered as a solution or mapping virtual links over physical routes.

11. The method of claim 1 , wherein the step of selecting a maximum number of virtual links whose node-disjoint routes are partitioned into two separate groups comprises a shortest route among the node disjoint physical routes being considered as a mapping of working virtual links and the other route being considered as a mapping backup virtual links, the routes of working virtual links and backup virtual links being denoted as P ij W and P ij b , respectively, and modulation formats of the working virtual link and backup virtual link being denoted M ij W and M ij W , respectively, for each virtual link VL(i,j) within a first set.

12. A non-transitory storage medium configured with instructions for a computer to carry out the following steps:
implementing by a computer a cloud service embedding in a software defined flexible grid optical transport network, the implementing comprising:
mapping working and backup virtual nodes over physical nodes;
mapping working and backup virtual links over physical routes which comprises:
finding two pairs of node-disjoint routes using a disjoint pair procedure on an auxiliary graph;
selecting a maximum number of virtual links whose node-disjoint routes are partitioned into two separate groups;
allocating spectrum at lowest available wavelength on a selected physical route for a virtual link; and
finding two pairs of node-disjoint routes using the disjoint pair procedure while modifying the auxiliary graph.

13. The medium of claim 12 , wherein the mapping working and backup virtual nodes over physical nodes comprises arranging virtual nodes in a descending order of average requested computing resources.

14. The medium of claim 13 , wherein the mapping working and backup virtual nodes over physical nodes comprises mapping working and backup virtual nodes to physical nodes with those having first and second largest average ration of available to offered computing resources of requested types.

15. The medium of claim 12 , wherein the step of finding two pairs of node-disjoint routes using a disjoint pair procedure on an auxiliary graph comprises considering cost of a physical link as a single hop and its physical distance and selecting a pair of node disjoint routes that cumulatively minimizes a required spectrum while not requiring any modification to the auxiliary graph while carrying out the disjoint pair procedure.

16. The medium of claim 12 wherein the step of allocating spectrum at lowest available wavelength on a selected physical route for a virtual link comprises minimizing fragmentation of spectrum and increasing probability of mapping virtual links over physical routes.

17. The medium of claim 12 , wherein the step of finding two pairs of node-disjoint routes using the disjoint pair procedure while modifying the auxiliary graph comprises considering cost of a physical link as a single hop and its physical distance, and selecting a pair of node-disjoint routes that cumulatively minimizes the required spectrum while modifying the auxiliary graph while applying the disjoint pair procedure to ensure a survivable mapping of a virtual link with respect to already mapped virtual links.

18. The medium of claim 12 , wherein the disjoint pair procedure comprises finding spectrum required for a modulation format along a route at a lowest available wavelength while observing the wavelength and spectrum continuity constraints and spectrum conflict constraint and provisioning working and backup virtual links on respective routes using respective modulation formats by allocating spectru

Assignees

• Nec Lab America Inc

Inventors

• Patel Ankitkumar
• Ji Philip Nan

Classifications

• H04L45/22

  Alternate routing · CPC title

• H04Q11/0066 Primary

  Provisions for optical burst or packet networks · CPC title

• H04L45/128 Primary

  for finding disjoint paths · CPC title

• H04Q2011/0073

  Provisions for forwarding or routing, e.g. lookup tables · CPC title

• H04L45/62

  Wavelength based (optical switching H04Q11/0062) · CPC title