Package org.unifi.mecvirtualresourceallocation.algorithm

Class LocalSearchStrategy

java.lang.Object

org.unifi.mecvirtualresourceallocation.algorithm.LocalSearchStrategy

All Implemented Interfaces:

AllocationStrategy

public class LocalSearchStrategy
extends Object
implements AllocationStrategy

The LocalSearchStrategy class implements an allocation strategy based on the (M*)-Perfect Matching algorithm described in the paper "Virtual Resource Allocation for Mobile Edge Computing: A Hypergraph Matching Approach".

Constructor Summary

Constructors

Constructor	Description
LocalSearchStrategy()

Method Summary

Modifier and Type	Method	Description
Set<Vertex>	allocate(HyperGraph hyperGraph)	Allocates resources based on the local search strategy with a default delta (δ) value of 3.
Set<Vertex>	allocate(HyperGraph hyperGraph, int delta)	Allocates resources based on the local search strategy.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface org.unifi.mecvirtualresourceallocation.algorithm.AllocationStrategy

getHyperEdges

Constructor Details

LocalSearchStrategy

public LocalSearchStrategy()

Method Details

allocate

public Set<Vertex> allocate(HyperGraph hyperGraph)

Allocates resources based on the local search strategy with a default delta (δ) value of 3.

Specified by:

allocate in interface AllocationStrategy

Parameters:

hyperGraph - the hypergraph used to allocate resources

Returns:

a set of vertices in the conflict graph selected by the allocation strategy

allocate

public Set<Vertex> allocate(HyperGraph hyperGraph,
 int delta)

Allocates resources based on the local search strategy.

Parameters:

hyperGraph - the hypergraph used to allocate resources

delta - the delta (δ) value used

Returns:

a set of vertices in the conflict graph selected by the allocation strategy