Parameter search for network service mapping algorithm – finished

I have designed and implemented a greedy graph algorithm for mapping service graphs to network resources, customizable by many parameters. The mapping process can be influenced by the parameter setting. The goal of the parameter search is to optimize the output of the mapping algorithm for the given networking and computing resources of the substrate infrastructure. The parameter search uses significantly different, generated test request sequences to evaluate the mapping performance.

Project owner:
Németh Balázs (Távközlési és Médiainformatikai Tanszék)
Távközlési és Médiainformatikai Tanszék (VIK-TMIT)

UNIFY FP7-es projekt keretein belül több nemzetközi cég és egyetem
Projekt koordinátor: Ericsson Magyarország Kft.