Ahmed El-Mekkawi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ahmed El-Mekkawi has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- José Ramón Piney
Department of Network Engineering, Universitat Politècnica de Catalunya (UPC), 08860 Castelldefels, Spain
1 shared publication - Xavier Hesselbach
Department of Network Engineering, Universitat Politècnica de Catalunya (UPC), 08034 Barcelona, Spain
1 shared publication
Latest Publications
- Open Access
- 15 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 223041-223068
Novel NFV Aware Network Service for Intelligent Network Slicing Based on Squatting-Kicking Model
Future networks starting from 5G will depend on network slicing to meet a wide range of network services (NSs) with various quality of service (QoS) requirements. With the powerful Network Function Virtualization (NFV) technology available, network slices can be rapidly deployed and centrally managed, giving rise to simplified management, high resource utilization, and cost-efficiency. This is achieved by realizing NSs on general-purpose hardware, hence, replacing traditional middleboxes. However, realizing fast deployment of end-to-end network slices still requires intelligent resource allocation algorithms to efficiently use the network resources and ensure QoS among different slice categories during congestion cases. This is especially important at the links of the network because of the scarcity of their resources. Consequently, this paper proposes a paradigm based on NFV architecture aimed at providing the massive computational capacity required in the NSs and supporting the resource allocation strategy proposed for multiple slice networks based on resources utilization optimization using a proposed and analyzed Squatting-Kicking model (SKM). SKM is a suitable algorithm for dynamically allocating network resources to different priority slices along paths and improving resource utilization under congested scenarios. Simulation results show that the proposed service deployment algorithm achieves 100% in terms of both overall resource utilization and admission for higher priority slices in some scenarios in bandwidth-constrained contexts, which cannot be achieved by other existing schemes due to priority constraints.
- 15 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 223041-223068
Open AccessNovel NFV Aware Network Service for Intelligent Network Slicing Based on Squatting-Kicking Model
Future networks starting from 5G will depend on network slicing to meet a wide range of network services (NSs) with various quality of service (QoS) requirements. With the powerful Network Function Virtualization (NFV) technology available, network slices can be rapidly deployed and centrally managed, giving rise to simplified management, high resource utilization, and cost-efficiency. This is achieved by realizing NSs on general-purpose hardware, hence, replacing traditional middleboxes. However, realizing fast deployment of end-to-end network slices still requires intelligent resource allocation algorithms to efficiently use the network resources and ensure QoS among different slice categories during congestion cases. This is especially important at the links of the network because of the scarcity of their resources. Consequently, this paper proposes a paradigm based on NFV architecture aimed at providing the massive computational capacity required in the NSs and supporting the resource allocation strategy proposed for multiple slice networks based on resources utilization optimization using a proposed and analyzed Squatting-Kicking model (SKM). SKM is a suitable algorithm for dynamically allocating network resources to different priority slices along paths and improving resource utilization under congested scenarios. Simulation results show that the proposed service deployment algorithm achieves 100% in terms of both overall resource utilization and admission for higher priority slices in some scenarios in bandwidth-constrained contexts, which cannot be achieved by other existing schemes due to priority constraints.