Jogesh K. Muppala
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jogesh K. Muppala has a total of 98 co-authors. Here are the top co-authors by number of shared publications:
Kishor S. Trivedi
Department of Electrical and Computer Engineering, Duke University, Durham, United States
9 shared publications- Mounir Hamdi
Hamad Bin Khalifa University
9 shared publications Dong Lin
6 shared publicationsXiaoLin Chang
6 shared publicationsXiaolin Chang
Beijing Jiaotong University, Beijing, China
6 shared publicationsYang Liu
Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong
6 shared publications
Latest Publications
- Open Access
- 7 November 2022
- Published by MDPI AG in Electronics
- Vol. 11  (21) , 3639
Cost-Effective and Energy-Aware Resource Allocation in Cloud Data Centers
Cloud computing supports the fast expansion of data and computer centers; therefore, energy and load balancing are vital concerns. The growing popularity of cloud computing has raised power usage and network costs. Frequent calls for computational resources may cause system instability; further, load balancing in the host requires migrating virtual machines (VM) from overloaded to underloaded hosts, which affects energy usage. The proposed cost-efficient whale optimization algorithm for virtual machine (CEWOAVM) technique helps to more effectively place migrating virtual machines. CEWOAVM optimizes system resources such as CPU, storage, and memory. This study proposes energy-aware virtual machine migration with the use of the WOA algorithm for dynamic, cost-effective cloud data centers in order to solve this problem. The experimental results showed that the proposed algorithm saved 18.6%, 27.08%, and 36.3% energy when compared with the PSOCM, RAPSO-VMP, and DTH-MF algorithms, respectively. It also showed 12.68%, 18.7%, and 27.9% improvements for the number of virtual machine migrations and 14.4%, 17.8%, and 23.8% reduction in SLA violation, respectively.
- 7 November 2022
- Published by MDPI AG in Electronics
- Vol. 11  (21) , 3639
Open AccessCost-Effective and Energy-Aware Resource Allocation in Cloud Data Centers
Cloud computing supports the fast expansion of data and computer centers; therefore, energy and load balancing are vital concerns. The growing popularity of cloud computing has raised power usage and network costs. Frequent calls for computational resources may cause system instability; further, load balancing in the host requires migrating virtual machines (VM) from overloaded to underloaded hosts, which affects energy usage. The proposed cost-efficient whale optimization algorithm for virtual machine (CEWOAVM) technique helps to more effectively place migrating virtual machines. CEWOAVM optimizes system resources such as CPU, storage, and memory. This study proposes energy-aware virtual machine migration with the use of the WOA algorithm for dynamic, cost-effective cloud data centers in order to solve this problem. The experimental results showed that the proposed algorithm saved 18.6%, 27.08%, and 36.3% energy when compared with the PSOCM, RAPSO-VMP, and DTH-MF algorithms, respectively. It also showed 12.68%, 18.7%, and 27.9% improvements for the number of virtual machine migrations and 14.4%, 17.8%, and 23.8% reduction in SLA violation, respectively.
- Open Access
- 1 July 2016
- Published by MDPI AG in Electronics
- Vol. 5  (3) , 37
Virtual Machine Replication on Achieving Energy-Efficiency in a Cloud
The rapid growth in cloud service demand has led to the establishment of large-scale virtualized data centers in which virtual machines (VMs) are used to handle user requests for service. A user’s request cannot be completed if the VM fails. Replication mechanisms can be used to mitigate the impact of failures. Further, data centers consume a large amount of energy resulting in high operating costs and contributing to significant greenhouse gas (GHG) emissions. In this paper, we focus on Infrastructure as a Service (IaaS) cloud where user job requests are processed by VMs and analyze the effectiveness of VM replications in terms of job completion time performance as well as energy consumption. Three different schemes: cold, warm, and hot replications are considered. The trade-offs between job completion time and energy consumption in different replication schemes are characterized through comprehensive analytical models which capture VM state transitions and associated power consumption patterns. The effectiveness of replication schemes are demonstrated through experimental results. To verify the validity of the proposed analytical models, we extend the widely used cloud simulator CloudSim and compare the simulation results with analytical solutions.
- 1 July 2016
- Published by MDPI AG in Electronics
- Vol. 5  (3) , 37
Open AccessVirtual Machine Replication on Achieving Energy-Efficiency in a Cloud
The rapid growth in cloud service demand has led to the establishment of large-scale virtualized data centers in which virtual machines (VMs) are used to handle user requests for service. A user’s request cannot be completed if the VM fails. Replication mechanisms can be used to mitigate the impact of failures. Further, data centers consume a large amount of energy resulting in high operating costs and contributing to significant greenhouse gas (GHG) emissions. In this paper, we focus on Infrastructure as a Service (IaaS) cloud where user job requests are processed by VMs and analyze the effectiveness of VM replications in terms of job completion time performance as well as energy consumption. Three different schemes: cold, warm, and hot replications are considered. The trade-offs between job completion time and energy consumption in different replication schemes are characterized through comprehensive analytical models which capture VM state transitions and associated power consumption patterns. The effectiveness of replication schemes are demonstrated through experimental results. To verify the validity of the proposed analytical models, we extend the widely used cloud simulator CloudSim and compare the simulation results with analytical solutions.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4005-4010
SprintNet: A high performance server-centric network architecture for data centers
This paper presents the design, implementation and evaluation of SprintNet, a novel network architecture for data centers. SprintNet achieves high performance in network capacity, fault tolerance, and network latency. SprintNet is also a scalable, yet low-diameter network architecture where the maximum shortest distance between any pair of servers can be limited by no more than four and is independent of the number of layers. The specially designed routing schemes for SprintNet strengthen its merits. Both theoretical analysis and simulation experiments are conducted to evaluate its overall performance with respect to average path length, aggregate bottleneck throughput, and fault tolerance.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4005-4010
SprintNet: A high performance server-centric network architecture for data centers
This paper presents the design, implementation and evaluation of SprintNet, a novel network architecture for data centers. SprintNet achieves high performance in network capacity, fault tolerance, and network latency. SprintNet is also a scalable, yet low-diameter network architecture where the maximum shortest distance between any pair of servers can be limited by no more than four and is independent of the number of layers. The specially designed routing schemes for SprintNet strengthen its merits. Both theoretical analysis and simulation experiments are conducted to evaluate its overall performance with respect to average path length, aggregate bottleneck throughput, and fault tolerance.
- 20 November 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 8  (1) , 32-46
Defects per Million Computation in Service-Oriented Environments
Traditional system-oriented dependability metrics like reliability and availability do not fully reflect the impact of system failure-repair behavior in service-oriented environments. The telecommunication systems community prefers to use Defects Per Million (DPM), defined as the number of calls dropped out of a million calls due to failures, as a user-perceived dependability metric. In this paper, we provide new formulation for the computation of the DPM metric for a system supporting Voice over IP functionality using the Session Initiation Protocol (SIP). We evaluate different replication schemes that can be used at the SIP application server. They include the effects of software failure, failure detection, recovery mechanisms, and imperfect coverage for recovery mechanisms. We derive closed-form expressions for the DPM taking into account the transient behavior of recovery after a failure. Our approach and underlying models can be readily extended to other types of service-oriented environments.
- 20 November 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 8  (1) , 32-46
Defects per Million Computation in Service-Oriented Environments
Traditional system-oriented dependability metrics like reliability and availability do not fully reflect the impact of system failure-repair behavior in service-oriented environments. The telecommunication systems community prefers to use Defects Per Million (DPM), defined as the number of calls dropped out of a million calls due to failures, as a user-perceived dependability metric. In this paper, we provide new formulation for the computation of the DPM metric for a system supporting Voice over IP functionality using the Session Initiation Protocol (SIP). We evaluate different replication schemes that can be used at the SIP application server. They include the effects of software failure, failure detection, recovery mechanisms, and imperfect coverage for recovery mechanisms. We derive closed-form expressions for the DPM taking into account the transient behavior of recovery after a failure. Our approach and underlying models can be readily extended to other types of service-oriented environments.
- 1 November 2013
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 26  (10) , 2540-2550
Performance evaluation of artificial intelligence algorithms for virtual network embedding
- 1 November 2013
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 26  (10) , 2540-2550
Performance evaluation of artificial intelligence algorithms for virtual network embedding
- Open Access
- 6 July 2013
- Published by Association for Computing Machinery (ACM)
- p. 1553-1560
Green cloud virtual network provisioning based ant colony optimization
Network virtualization is being regarded as a promising technology to create an ecosystem for cloud computing applications. One critical issue in network virtualization technology is power-efficient virtual network embedding (PEVNE), which deals with the physical resource allocation to virtual nodes and links of a virtual network while minimizing the energy consumption in the cloud data center. When the node and link constraints (including CPU, memory, network bandwidth, and network delay) are both taken into account, the VN embedding problem is NP-hard, even in the offline case. This paper aims to investigate the ability of the Ant-Colony-Optimization (ACO) technique in handling PE-VNE problem. We propose an ACObased heuristic PE-VNE algorithm, called E-ACO. E-ACO minimizes the energy consumption by considering the embedding power consumption in the node mapping phase and by making an implicit coordination between the node and link mapping phases. Extensive simulations are conducted to evaluate the performance of the proposed algorithm and investigate different energy-aware link embedding algorithms on the ability of E-ACO
- 6 July 2013
- Published by Association for Computing Machinery (ACM)
- p. 1553-1560
Open AccessGreen cloud virtual network provisioning based ant colony optimization
Network virtualization is being regarded as a promising technology to create an ecosystem for cloud computing applications. One critical issue in network virtualization technology is power-efficient virtual network embedding (PEVNE), which deals with the physical resource allocation to virtual nodes and links of a virtual network while minimizing the energy consumption in the cloud data center. When the node and link constraints (including CPU, memory, network bandwidth, and network delay) are both taken into account, the VN embedding problem is NP-hard, even in the offline case. This paper aims to investigate the ability of the Ant-Colony-Optimization (ACO) technique in handling PE-VNE problem. We propose an ACObased heuristic PE-VNE algorithm, called E-ACO. E-ACO minimizes the energy consumption by considering the embedding power consumption in the node mapping phase and by making an implicit coordination between the node and link mapping phases. Extensive simulations are conducted to evaluate the performance of the proposed algorithm and investigate different energy-aware link embedding algorithms on the ability of E-ACO
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15450678,p. 214-219
DCNSim: A Data Center Network Simulator
Large-scale data centers form the infrastructure backbone for supporting cloud computing. The network interconnecting the servers in the data center plays a crucial role in the performance and dependability characteristics of the data centres. With the plethora of data center network (DCN) topologies that have been proposed in the literature, there is a sore need for a standardized method for evaluating and comparing various alternate DCN architectures. Considering these needs, we designed DCNSim, a general purpose DCN simulator that supports most well-known DCN topologies proposed in the literature. Our simulator can generate various metrics for the topologies, including static metrics like average path length, aggregated bottleneck throughput, routing failure rate; and dynamic metrics like packet loss rate, average buffer size and link utilization. The modular and flexible architecture of the simulator permits easy extension to support any future proposed topologies and compute new metrics.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15450678,p. 214-219
DCNSim: A Data Center Network Simulator
Large-scale data centers form the infrastructure backbone for supporting cloud computing. The network interconnecting the servers in the data center plays a crucial role in the performance and dependability characteristics of the data centres. With the plethora of data center network (DCN) topologies that have been proposed in the literature, there is a sore need for a standardized method for evaluating and comparing various alternate DCN architectures. Considering these needs, we designed DCNSim, a general purpose DCN simulator that supports most well-known DCN topologies proposed in the literature. Our simulator can generate various metrics for the topologies, including static metrics like average path length, aggregated bottleneck throughput, routing failure rate; and dynamic metrics like packet loss rate, average buffer size and link utilization. The modular and flexible architecture of the simulator permits easy extension to support any future proposed topologies and compute new metrics.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
The Third International Workshop on Dependability of Clouds, Data Centers and Virtual Machine Technology DCDV 2013
The Third International Workshop on Dependability of Clouds, Data Centers, and Virtual Machine Technology (DCDV 2013) features papers covering various aspects of dependability and security in Clouds and Data Centers. Four sessions covering Cloud and Data Center Networking, Dependability Evaluation, Mobile and Cloud Computing, and Virtualization and Cloud include eleven papers.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
The Third International Workshop on Dependability of Clouds, Data Centers and Virtual Machine Technology DCDV 2013
The Third International Workshop on Dependability of Clouds, Data Centers, and Virtual Machine Technology (DCDV 2013) features papers covering various aspects of dependability and security in Clouds and Data Centers. Four sessions covering Cloud and Data Center Networking, Dependability Evaluation, Mobile and Cloud Computing, and Virtualization and Cloud include eleven papers.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15300889,p. 1-6
Fault-tolerance characteristics of data center network topologies using fault regions
Data center networks (DCNs) are inherently failure-prone owing to the existence of many links, switches and servers. Many times the failures of the components may be correlated resulting a set of connected components failing together. This correlated failure behaviour could be captured through the use of fault regions [1]. This paper explores the effect of such failures in DCNs, using four topologies, viz., Fat Tree, DCell, FlatNet and BCube. We used two categories of metrics for evaluation: connection-oriented metrics, including aggregated bottleneck throughput (ABT), average path length (APL) and routing failure rate (RFR); and network size-oriented metrics, including Component Decomposition Number (CDN) and Smallest/Largest Component Size (SCS/LCS).
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15300889,p. 1-6
Fault-tolerance characteristics of data center network topologies using fault regions
Data center networks (DCNs) are inherently failure-prone owing to the existence of many links, switches and servers. Many times the failures of the components may be correlated resulting a set of connected components failing together. This correlated failure behaviour could be captured through the use of fault regions [1]. This paper explores the effect of such failures in DCNs, using four topologies, viz., Fat Tree, DCell, FlatNet and BCube. We used two categories of metrics for evaluation: connection-oriented metrics, including aggregated bottleneck throughput (ABT), average path length (APL) and routing failure rate (RFR); and network size-oriented metrics, including Component Decomposition Number (CDN) and Smallest/Largest Component Size (SCS/LCS).