search

MartinPJorge / vnfs-mapping

Work on VNFs mapping algorithms
1 stars 1 forks source link

Substitute placements as graph instead of link list #9

Closed MartinPJorge closed 7 years ago

MartinPJorge commented 7 years ago

This means refactoring NsMapper and the related classes.

MartinPJorge commented 7 years ago

Don't hurry!

The only thing needed is to create a graph equal to the NS chain, but having the real delays in the links between the VNFs. This graph can be created on search time within greedy(), and the tabu() method can make use of it to obtain efficiently new delays as it changes the placements.

MartinPJorge commented 7 years ago

With the NsMapping class, you have can track the delays between VNF nodes and know the total delay of a mapped NS chain.

Mappings can make use of this class to store the found paths to place each VNF. Something like a property:

self.__mappings = {
    (vnfA, vnfB): [(node1, node2), (node2, node3), ... ]
}
MartinPJorge commented 7 years ago

Commit 51b1227ad62a6877286113db426068cd1f4b8dae implements it.