R
Rashid Mijumbi
Researcher at Bell Labs
Publications - 48
Citations - 3757
Rashid Mijumbi is an academic researcher from Bell Labs. The author has contributed to research in topics: Virtualization & Virtual network. The author has an hindex of 20, co-authored 48 publications receiving 2929 citations. Previous affiliations of Rashid Mijumbi include Polytechnic University of Catalonia & Waterford Institute of Technology.
Papers
More filters
Journal ArticleDOI
Network Function Virtualization: State-of-the-Art and Research Challenges
TL;DR: In this article, the authors survey the state-of-the-art in NFV and identify promising research directions in this area, and also overview key NFV projects, standardization efforts, early implementations, use cases, and commercial products.
Journal ArticleDOI
5G network slicing using SDN and NFV: A survey of taxonomy, architectures and future challenges
TL;DR: A comprehensive review and updated solutions related to 5G network slicing using SDN and NFV, and a discussion on various open source orchestrators and proof of concepts representing industrial contribution are provided.
Proceedings ArticleDOI
Design and evaluation of algorithms for mapping and scheduling of virtual network functions
TL;DR: This paper formulates the online virtual function mapping and scheduling problem and proposes a set of algorithms for solving it and proposes three greedy algorithms and a tabu search-based heuristic.
Journal ArticleDOI
Management and orchestration challenges in network functions virtualization
Rashid Mijumbi,Joan Serrat,Juan-Luis Gorricho,Steven Latre,Marinos Charalambides,Diego R. Lopez +5 more
TL;DR: This article introduces NFV and gives an overview of the MANO framework that has been proposed by ETSI, and presents representative projects and vendor products that focus on MANO, and discusses their features and relationship with the framework.
Journal ArticleDOI
Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection
TL;DR: Connor is a novel graph encryption scheme that enables approximate CSD querying over encrypted graphs and is built based on an efficient, tree-based ciphertext comparison protocol, and makes use of symmetric-key primitives and the somewhat homomorphic encryption, making it computationally efficient.