direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Giuseppe Carella

Lupe [1]

Research fellow

Kaiserin-Augusta-Allee 31
10589 Berlin
Phone +49 30 3463-7387
giuseppe.a.carella [at] tu-berlin.de [2]
http://www.av.tu-berlin.de/carella [3]

 

Graduated:
2011, Alma Mater Studiorum University of Bologna, M.Sc.

Master Thesis:
Giuseppe Carella, QoS-aware brokering support for IMS Infrastructures in cloud, 2011.

Curriculum Vitae

Giuseppe Carella received his M.Sc. in Engineering of Computer Science from the Alma Mater Studiorum University of Bologna in 2011. During his studies he focalised on next generation network infrastructure, especially in IMS services, like presence and messaging. He realised his Master thesis, “QoS-aware brokering support for IMS Infrastructures in cloud”, working at Fraunhofer FOKUS focusing on IMS and cloud computing, as one of the first work realised in the context of Network Function Virtualization (NFV). In 2012 he joined the Next Generation Networks (AV) team at the Technical University Berlin, where he started working on Future Internet projects like OpenLab and BonFIRE. He is mainly interested in new network architectures, like the IP Multimedia Subsystem (IMS) and the Evolved Packet Core (EPC), and he has a strong background in cloud computing technologies. He is currently involved as Software Engineer in the development of the OpenSDNCore platform, and involved in different European projects. 

Projects

Since the beginning he has been involved in many EU Projects part of the FP7: OpenLab, BonFIRE (EU BonFIRE project), Mobile Cloud Networking (https://mobile-cloud-networking.eu/) and NUBOMEDIA (https://www.nubomedia.eu/).

In the Mobile Cloud Networking project he is currently leading the activities related to the virtualisation and cloudification of the IMS platform, while in NUBOMEDIA he is bringing his expertise for realising an elastic cloud platform for Multimedia content. 

The BonFIRE Project supports experimentation and testing of innovative scenarios from the Internet of Services research community, specifically focused on the convergence of services and networks. In this project he is providing his expertise for enabling elasticity as a service.  

He was previously involved in OpenLab (EU OpenLab project [4]). In this project he was designing and developing the Slice Federation Architecture (SFA) extension for the FITeagle framework. FITeagle (www.fiteagle.org) is a framework for the interoperability of different testbeds. Furthermore SFA will increase the number of federated testbeds, allowing teagle experimenters to interoperate with an high number of heterogeneous resources. 

In parallel he coordinates the development of the OpenSDNCore platform, a software toolkit for realising research related to Network Function Virtualization and Software Defined Networks. 

 

 

Publications

Near optimal service function path instantiation in a multi-datacenter environment
Citation key 7367379
Author Hassan, Ahmed Mohamed Medhat and Carella, Giuseppe and Luck, Christian and Corici, Marius-Iulian and Magedanz, Thomas
Title of Book Network and Service Management (CNSM), 2015 11th International Conference on
Pages 336-341
Year 2015
DOI 10.1109/CNSM.2015.7367379
Month Nov
Abstract 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 entry [5]

Presentations and demos

"OpenSDNCore: a Framework for prototyping virtualized Network Function Orchestration in emerging SDN-based 5G Infrastructures", Carrier Network Virtualization 2014, Palo Alto

"Mobile Cloud Networking - end-to-end deployment of a virtualized Mobile Core Network", GlobeCom 2015, Austin

"Smart Communication Platforms for OTT and Telco-integrated Communication Services", Giuseppe Carella and Thomas Magedanz, 9th SDP Global Summit – ”Service Delivery Virtualization“ September 17th, 2013, Rome

"SDP and Core Network Virtualization", Giuseppe Carella and Thomas Magedanz, 9th SDP Global Summit – ”Service Delivery Virtualization“ September 17th, 2013, Rome

"Mobile Cloud Networking", Orchestration of a Mobile Core Network on top of an OpenStack Cloud, EUCNC 2014 and FIA 2014 

Tutorials

"5G Foundations and Core Network Evolution: Radio, Convergence Core, Cognitive Management and Virtualisation (SDN/NFV)", FUSECO Forum 2014, Berlin

Office

Daniela Floroiu
Faculty IV – Elektrotechnik und Informatik

sec. HFT 7
Room 423
Einsteinufer 25
10587 Berlin
Tel: +49 30 314 21454
Fax: +49 30 314 26769
d.floroiu [at] tu-berlin.de [7]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008