Sandra Essays

In this thesis, the opportunities of bringing NFV to the network edge are identified. The results of this work demonstrate that GNF’s real-world vNF examples can be created and hosted on a variety of hosting devices, including VMs from public clouds and low-cost edge devices typically found at the customer’s premises. Al-Raweshidy, H Li, M. To cope with these challenges, service providers are exploiting softwarised, cost-effective, and flexible service provisioning, known as Network Function Virtualisation NFV. By simulation, the positive effects of the proposed routing and aggregation strategy and the usefulness of the algorithm. This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London. Site tools A-Z Lists.

The proposed algorithm is a fixed-point system of equations that iteratively evaluates routing — aggregation — delay until an equilibrium point is found. By simulation, the positive effects of the proposed routing and aggregation strategy and the usefulness of the algorithm. PhD thesis, University of Glasgow. We will also touch upon how the audience in the room can leverage these technologies and help move these forward. D degree in computer science from National University of Singapore, in To cope with these challenges, service providers are exploiting softwarised, cost-effective, and flexible service provisioning, known as Network Function Virtualisation NFV.

The results of this work demonstrate that GNF’s real-world vNF examples can be created and hosted on a variety of hosting devices, including VMs from public clouds and low-cost edge devices typically found at the customer’s premises. Skip to main content Accessibility information. This thesis was tehsis for the award of Doctor of Philosophy and was awarded by Brunel University London. The study is about the congestion control in broadband communication networks.

His background in Wireless mobile systems spans long stints as system architect, product manager, and network applications engineer.

We mathematically formulate the problem and propose a two-step placement heuristic to solve the problem efficiently.

  CURRICULUM VITAE COSA SCRIVERE IN OCCUPAZIONE DESIDERATA

Tutorials – IEEE Conference on Network Function Virtualization and Software Defined Networks

There are different ways to mitigate the effects of congestion, by rerouting, by aggregation to take advantage of statistical multiplexing, and by discarding too demanding traffic, which is known as admission control. On the algorithmic side, a key challenge is to identify the number and location of the NFVO and VNFM functional blocks since they have a thesix impact on the overall system cost and performance, among others.

PhD thesis, Concordia University. Tuesday, November 27, — It showcases Brunel’s research outputs. He is certified in Next-generation Datacenter Networking, Openstack and Nnfv container technologies.

The first wave of NFV was about taking a network function and running it as-is in a virtual environment.

nfv phd thesis

Aside from work his hobbies and interests include public speaking, fitness, and DIY. PhD thesis, University of Glasgow. Please use this identifier to cite or link to this item: We will talk about how 5G applications can meet these requirements and about the Network Transformation technologies that help meet these goals.

She has a passion for technology and likes sharing knowledge at technical meet ups.

We also propose a late acceptance hill-climbing heuristic to solve the problem in a reasonable time frame. Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

Towards lightweight, low-latency network function virtualisation at the network edge

However, the heavy footprint of today’s NFV platforms and their lack of dynamic, latency-optimal orchestration prevents them from being used at the edge of the network. The optimisation being studied both with respect to total end-to-end delay and maximum end-to-end delay. Assumes that node controls can be expressed in commands supported by OpenFlow v1. His current research interests are in the areas of wireless and mobile 5G communication networks, mobile phone programming, network coding, cross-layer as well as energy efficient protocol design and cooperative networking.

  DESINSTALAR HUNTERSTONE THESIS

Finally, we investigate the same problem in the context of single- and multi-orchestrator systems providing a comparative study of the worst-case delay in both scenarios. Towards lightweight, low-latency network function virtualisation at the network edge.

nfv phd thesis

The thesis presents a powerful formalisation for the latency-optimal placement of edge vNFs and provides an exact solution using Integer Linear Programming, along with a nffv scheduler that relies on Optimal Stopping Theory to efficiently re-calculate the placement following roaming users and temporal changes in latency characteristics.

This allows implementation of a centralised control that takes the state of the entire network into account and configures nodes dynamically to avoid congestion. Contact us The University of Glasgow is a registered Scottish charity: He co-founded several start-up companies starting with acticom GmbH in Berlin in Site tools A-Z Lists.

Towards lightweight, low-latency network function virtualisation at the network edge

Software Defined Networking SDN and Network Function Virtualization NFV are concepts that allow for dynamic configuration phdd network resources by decoupling control from payload data and allocation of network functions to the most suitable physical node.

Fabrizio Granelli is Associate Professor at the Dept.

nfv phd thesis

He is author or co-author of more than papers published in international journals, books, and conferences in networking, with particular reference to performance modeling, cross-layering, wireless networks, cognitive radios and networks, green networking and smart grid communications. He was an advisor of more than 80 B. Owing to its complexity, we propose a tabu search heuristic and numerically show that it is faster than the mathematical formulation by many orders of magnitude.