Folgen
Sadoon Azizi
Sadoon Azizi
Department of Computer Engineering and IT, Faculty of Engineering, University of Kurdistan, Sanandaj
Bestätigte E-Mail-Adresse bei uok.ac.ir - Startseite
Titel
Zitiert von
Zitiert von
Jahr
An energy-efficient algorithm for virtual machine placement optimization in cloud data centers
S Azizi, M Zandsalimi, D Li
Cluster Computing 23 (4), 3421-3434, 2020
372020
Priority, Network and Energy-aware Placement of IoT-based Application Services in Fog-Cloud Environments
H Omer Hassan, S Azizi, M Shojafar
IET Communications 14 (13), 2117-2129, 2020
342020
Grvmp: A greedy randomized algorithm for virtual machine placement in cloud data centers
S Azizi, M Shojafar, J Abawajy, R Buyya
IEEE Systems Journal 15 (2), 2571 - 2582, 2021
232021
A priority, power and traffic-aware virtual machine placement of IoT applications in cloud data centers
S Omer, S Azizi, M Shojafar, R Tafazolli
Journal of Systems Architecture, 101996, 2021
162021
Joint QoS-aware and Cost-efficient Task Scheduling for Fog-Cloud Resources in a Volunteer Computing System
F Hoseiny, S Azizi, M Shojafar, R Tafazolli
ACM Transactions on Internet Technology 21 (4), 1-21, 2021
152021
A priority-based service placement policy for fog-cloud computing systems
S Azizi, F Khosroabadi, M Shojafar
Computational Methods for Differential Equations 7 (4 (Special Issue)), 521-534, 2019
152019
PGA: A Priority-aware Genetic Algorithm for Task Scheduling in Heterogeneous Fog-Cloud Computing
F Hoseiny, S Azizi, M Shojafar, F Ahmadizar, R Tafazolli
IEEE INFOCOM WKSHPS: ICCN 2021, 2021
102021
HHS: an efficient network topology for large-scale data centers
S Azizi, SN Hashemi, A Khonsari
The Journal of Supercomputing 72 (3), 874-899, 2016
102016
Deadline-aware and energy-efficient IoT task scheduling in fog computing systems: A semi-greedy approach
S Azizi, M Shojafar, J Abawajy, R Buyya
Journal of network and computer applications 201, 103333, 2022
92022
An energy-efficient routing protocol for the Internet of Things networks based on geographical location and link quality
R Yarinezhad, S Azizi
Computer Networks 193, 108116, 2021
92021
A flexible and high-performance data center network topology
S Azizi, SN Hashemi, A Khonsari
The Journal of Supercomputing 73 (4), 1484-1503, 2017
92017
On the topological properties of HyperX
S Azizi, F Safaei, SN Hashemi
The Journal of Supercomputing 66 (1), 572-593, 2013
82013
LPWAN-Based Hybrid Backhaul Communication for Intelligent Transportation Systems: Architecture and Performance Evaluation
T Shahgholi, A Sheikhahmadi, K Khamforoosh, S Azizi
EURASIP Journal on Wireless Communications and Networking 35, 1-17, 2021
62021
A fuzzy approach for optimal placement of IoT applications in fog-cloud computing
F Tavousi, S Azizi, A Ghaderzadeh
Cluster Computing 25, 303-320, 2022
52022
Using the power of two choices for real-time task scheduling in fog-cloud computing
F Hoseiny, S Azizi, S Dabiri
2020 4th International Conference on Smart City, Internet of Things and …, 2020
52020
Towards optimal system deployment for edge computing: a preliminary study
D Li, C Asikaburu, B Dong, H Zhou, S Azizi
2020 29th International Conference on Computer Communications and Networks …, 2020
42020
A QoS-aware Service Placement Algorithm for Fog-Cloud Computing Environments
S Azizi, F Khosroabadi
4th International Conference on Natural Sciences (ICNS2019) - Mathematics …, 2019
32019
Comparison between topological properties of hyperX and generalized hypercube for interconnection networks
S Azizi, SN Hashemi, MA Zarandi
Journal of Mathematics and Computer Science (JMCS) 9 (2), 111-122, 2013
22013
FLEX: A Platform for Scalable Service Placement in Multi-Fog and Multi-Cloud Environments
P Farzin, S Azizi, M Shojafar, O Rana, M Singhal
20th Australian Symposium on Parallel and Distributed Computing (AusPDC 2022), 2022
12022
BSFS: A Bidirectional Search Algorithm for Flow Scheduling in Cloud Data Centers
H Naseri, S Azizi, A Abdollahpouri
Information Systems & Telecommunication 7 (3), 175-183, 2019
12019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20