direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Near optimal service function path instantiation in a multi-datacenter environment
Zitatschlüssel 7367379
Autor Hassan, Ahmed Mohamed Medhat and Carella, Giuseppe and Luck, Christian and Corici, Marius-Iulian and Magedanz, Thomas
Buchtitel Network and Service Management (CNSM), 2015 11th International Conference on
Seiten 336-341
Jahr 2015
DOI 10.1109/CNSM.2015.7367379
Monat Nov
Zusammenfassung Service Function Chaining (SFC) supports services/applications through linking an ordered list of service functions (such as firewalls, deep packet inspections and load balancers) in the network. Using Software Defined Networking (SDN) and Network Function Virtualization (NFV) provides a simpler and shorter SFC process. In order to provide high-availability on a multi-site SFC, it is required a flexible algorithm able to properly select Service Function instances while creating the Service Function Path (SFP). This paper presents a new service function selection algorithm providing a flexible tradeoff between the SFP distance and the loads per service function instances at the deployment stage. The flexible tradeoff provided in the algorithm can be adjusted by a parameter. This parameter value can differ among different types of SFCs based on the service/application (real time or non-real time) dedicated for its SFC. Matlab has been utilized for validating it with different scenarios. It is also compared to other existing algorithms such as, load balancing and shortest path. The results showed that the proposed algorithm could provide the best SFP end-to-end distance performance as the shortest path algorithm for the real time services/applications, and that will result a good Quality of Service (QoS) performance for real time services/applications. Furthermore, the proposed algorithm provides an acceptable load distribution over the available service functions instances better than shortest path algorithm and not far from and load balancing algorithms.
Download Bibtex Eintrag

Nach oben

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe

Office

Daniela Floroiu
Fakultät IV – Elektrotechnik und Informatik

Sekr. HFT 7
Raum 423
Einsteinufer 25
10587 Berlin
Tel: +49 30 314 21454
Fax: +49 30 314 26769