Ibrahim Sorkhoh

Ibrahim Sorkhoh

Auto-generated profile, based on publicly available information

Ibrahim Sorkhoh

Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, Canada

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 July 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ISIbrahim Sorkhoh
Ibrahim Sorkhoh
Dariush EbrahimiDariush Ebrahimi
Dariush Ebrahimi
RARibal Atallah
Ribal Atallah
CAChadi Assi
Chadi Assi
In order to support the development of 5G technologies, researchers are actively engaged in addressing the challenges accompanying the emerging 5G applications. Unquestionably, an eminent technology, which is recently gaining significant research attention is mobile edge computing. Vehicular Edge Computing, an extension of cloud computing, brings capabilities to deploy data storage, computing and communication, as well as a host of support applications for emerging vehicular services (such as traffic control and safety, coordinated and automated driving, connected cars, intersection management) as well as emerging applications which require intensive computation and demand low-delay data processing, (e.g., video analytics with real-time interaction, image-aided navigation, content caching and sharing, natural language processing, etc.) to the edge closer to the vehicles, reducing response times and increasing reliability, therefore achieving the holistic vision of the tactile Internet. In this context, this paper considers a vehicular network with VEC capabilities deployed at road side units, RSUs, and addresses the problem of workload offloading as well as scheduling of computation tasks on the computing resources available at the edge. The challenge here is related to the high mobility of the vehicles and hence their short residence time within the coverage range of the RSU hosting the VEC. A joint problem considering the communication and computation resources, as well as the latency requirements of the workload is formulated and the scheduling is shown to be NP-Hard. Subsequently, efficient polynomial time solutions based on Lagrangian relaxation are derived and presented. We evaluate numerically the proposed methods and show their closeness to the optimal solutions obtained by a derived ILP.

3 March 2021 in IEEE Transactions on Intelligent Vehicles
Verified
Journal Article
Closed access
MKMohammad Ekramul Kabir
Mohammad Ekramul Kabir
ISIbrahim Sorkhoh
Ibrahim Sorkhoh
BMBassam Moussa
Bassam Moussa
CAChadi Assi
Chadi Assi
An adequate charging infrastructure advocates to ameliorate the range anxiety to propel the disparaged electric vehicle (EV) market. But, the high initial installation cost, requirement of suitable places and the anticipated immense load on the grid during peak times hinder to elongate the charging station network, especially in urban areas. Fortunately, the bidirectional energy transferring capability between vehicles (i.e., V2V) may act as an auxiliary solution to charge an EV at any place and at any time without leaning on a stationary charging infrastructure. In this work, we assume a market where charging providers each has a number of charging trucks equipped with a larger battery and a fast charger to charge a number of EVs at some particular parking lots. A provider intends to maximize the served number of EVs using its limited number of charging trucks, when an EV should be considered as served only if it would be fully charged during its declared charging window. All charging requests are assumed to be received by an agent which provisions a route and schedule for each charging truck and all trucks should return to the depot after serving EVs. We formulate this combinatorially hard problem as an integer linear program (ILP) to maximize the number of served EVs by determining the optimal trajectory of each truck. Owing to its complexity, we present a solution methodology by decomposing the problem using Dantzig-Wolfe decomposition approach; we divide the problem into one master problem and a set of pricing problems (one for each EV) and achieve the solution iteratively. Though the solution achieved from the decomposition might not be optimal, it is faster to be applicable in practice. We also compare the performance with two heuristic algorithms and report on the collected results.

2 November 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
ISIbrahim Sorkhoh
Ibrahim Sorkhoh
CAChadi Assi
Chadi Assi
Dariush EbrahimiDariush Ebrahimi
Dariush Ebrahimi
SSSanaa Sharafeddine
Sanaa Sharafeddine
Fully automated vehicles deployed with high computational/perceptive capabilities will soon become a reality. Such capabilities enable the cooperation among vehicles and the realization of interacting autonomous driving systems. Edge computing has emerged to provide a plethora of computational services to reduce network latency. Applications at the edge that apply analytics on the sensory data are therefore indispensable for self-driving vehicles. We consider in this paper a network that interconnects vehicles to an edge server at a roadside unit. Each vehicle extracts multiple information by sampling multiple processes and sends them to the corresponding edge application. To make timely decisions, “fresh” information needs to be offloaded, processed, and delivered back to vehicles; in this context, we adopt a new metric called Age of Information (AoI) that has been lately used to measure the freshness of information. We seek to jointly schedule vehicles’ transmission of information and schedule information processing at the edge to minimize the AoI of all processes. We mathematically formulate the problem and prove its NP-Hardness. To overcome this hardness, we propose a logic-based Benders decomposition to divide the problem into a master and several subproblems. Then, we present an exact polynomial-time solution for the subproblems, a scalable heuristic for the master, and devise a valid yet efficient Benders cut. We implement the system simulation on the well-known traffic simulator SUMO and compare the decomposition with CPLEX branch-and-cut; Although the problem is highly intricate, our method finds a near-optimal solution (maximum deviation is 7% from optimal solution) with a speedup that reaches 95%. We study the system performance by varying different system parameters.

30 December 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
AMAli Muhammad
Ali Muhammad
ISIbrahim Sorkhoh
Ibrahim Sorkhoh
MSMoataz Samir
Moataz Samir
Dariush EbrahimiDariush Ebrahimi
Dariush Ebrahimi
CAChadi Assi
Chadi Assi
Internet of Things (IoT) applications, such as augmented/virtual reality, tactile Internet, immersive gaming, etc., are currently experiencing an unprecedented growth in their demand. IoT devices are constrained by limited computation and power features and might experience excessive computational latency to support resource-intensive tasks. Multiaccess edge computing (MEC) appears to be a promising solution in this regard to expedite the computations of resource-intensive tasks by offloading them to the edge of the network. This article considers a scenario where a base station (BS) serves traffic streams from multiple IoT devices. The packets from each stream arrive at the BS (following a stochastic process) and then forwarded to their respective destinations after they are processed by the MEC node. The scheduling decisions are aimed to keep the information fresh at the destination. The information freshness is captured by Age of Information (AoI) metric. We aim to minimize the expected sum AoI for the MEC-assisted IoT network and provide mathematically traceable expressions for the AoI. First, an optimization problem is formulated to find the optimal scheduling policy in order to minimize the expected sum AoI. The optimization problem is an integer linear programming (LP) problem, which is generally difficult to solve. Hence, we provide a simpler formulation of the problem and derive a more traceable expression for the expected sum AoI. With this approach, the joint impact of stochastic arrivals, scheduling policy, and unreliable channel conditions on the AoI is assessed. We also propose low-complexity algorithms to obtain results for larger networks. Finally, through extensive simulations, we demonstrate the effectiveness of our proposed methods as compared to other existing strategies in terms of achievable AoI.

20 February 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ISIbrahim Sorkhoh
Ibrahim Sorkhoh
Dariush EbrahimiDariush Ebrahimi
Dariush Ebrahimi
CAChadi Assi
Chadi Assi
SSSanaa Sharafeddine
Sanaa Sharafeddine
MKMaurice Khabbaz
Maurice Khabbaz
The Vehicle-as-a-Resource is an emerging concept that allows the exploitation of the vehicles' computational resources for the purpose of executing tasks offloaded by passengers, vehicles, or even an Internet-of-Things devices. This article revolves around a scenario where a roadside unit located at the edge of a hierarchical multitier edge computing subnetwork resorts to the utilization of idle vehicles computational resources through a fog-enabled substructure yielding a cost-effective computational task offloading solution. In this context, scheduling the offload of these tasks to the appropriate vehicles is a challenging problem that is subject to the interaction of major role-playing parameters. Among these parameters are the variability of vehicles availability and their computational power, the individual tasks' weighted priorities and their deadlines, the tasks required computational power as well as the required data to upload/download. This article proposes an infrastructure-assisted task scheduling scheme where the roadside unit receives computational tasks from different sources and schedules these tasks over a computationally capable vehicle residing within the roadside unit's range. The aim is to maximize the weighted number of admitted tasks while considering the constraints mentioned above. Compared to other works, this article broaches a more realistic scenario by considering a more accurate computational task and system model. Our system considers both the latency and throughput of task accomplishments by maximizing the weighted number of admitted tasks while at the same time respecting the tasks accompanied deadlines. Both radio and computational resources are part of the optimization problem. After proving the NP-hardness of the scheduling problem, we formulated the problem as a mixed-integer linear program. A Dantzig-Wolfe decomposition algorithm is proposed which yields to a master program solvable by the Barrier algorithm and subproblems solved optimally with a polynomial-time dynamic programming approach. Thorough numerical analysis and simulations are conducted in order to verify and assert the validity, correctness, and effectiveness of our approach compared to branch and bound and greedy algorithms.

6 January 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
AMAli Muhammad
Ali Muhammad
ISIbrahim Sorkhoh
Ibrahim Sorkhoh
LQLong Qu
Long Qu
CAChadi Assi
Chadi Assi
Telecommunication networks are currently realizing more-huge-than-ever data demands from subscribers all over the world. Due to the ongoing pandemic, nearly all businesses have adapted working models with remote operations. People engaged with major industries, e.g., academia, health and municipalities are utilizing online platforms to carryout their routine tasks. This indeed shifts the attention from one-to-one (unicast) communication to one-to-many (multicast) and many-to-many (multi-source multi-destination) communications. Network operators are facing increased pressure to provide quick responses in order to satisfy the bandwidth hungry and time sensitive user demands. This can only be done by enhancing deployability as well as manageability of the services. Network Function Virtualization (NFV) provides a transformation of traditional proprietary network designs to a more agile and software based environment in order to achieve flexible deployments, reduced setup costs and less-time-to-market for the new services which is very much needed in the current scenarios. Previous studies on NFV-enabled multicast problem either proposed Integer Linear Program (ILP) models, that are pretty unscalable, or heuristic-based techniques that do not guarantee good quality of the solutions obtained. In this article, we propose an NFV multicast resource optimization model exploiting the use of multiple sources and considering the end-to-end delay and bandwidth requirements. Herein, we propose a novel Dantzig-Wolfe (DW) decomposition model that tackles the complexity of the problem by breaking it down into a master problem and several pricing problems. We compare the DW approach with the ILP and heuristic methods and demonstrate that our approach achieves near to optimal solution (in comparison to heuristic based methods) much faster than ILP. We also study the dynamic admission of NFV-enabled multicast requests by solving the problem in an online manner using the batch processing of requests. We then evaluate the performance of the proposed algorithms through extensive simulations and demonstrate that proposed algorithms are promising and outperform existing solutions.