Rajdeep Niyogi

Prof. Dr. Rajdeep Niyogi

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
5 February 2019 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TKTarun Kulshrestha
Tarun Kulshrestha
DSDivya Saxena
Divya Saxena
RNRajdeep Niyogi
Rajdeep Niyogi
JCJiannong Cao
Jiannong Cao

20 October 2021 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
AKAvadh Kishor
Avadh Kishor
RNRajdeep Niyogi
Rajdeep Niyogi
ACAnthony Chronopoulos
Anthony Chronopoulos
Albert ZomayaAlbert Zomaya
Albert Zomaya
With the rapid surge in cloud services, cloud load balancing has become a paramount research issue. The major part of a cloud computing systems operational costs is attributed to energy consumption. Therefore, to provide better QoS, considering the energy minimization factor in load balancing is important. This paper addresses the latency and energy-aware load balancing problem in a cloud computing system. In this paper, two fundamental performance criteriaresponse time and energyfor the load balancing problem are considered. To solve this problem, first, the load balancing problem is formulated as an optimization problem. Then it is modeled as a cooperative game so that the solution of the game, called the Nash bargaining solution (NBS), can simultaneously optimize both criteria. The existence and computation of NBS is analyzed theoretically, and an efficient algorithm, called Latency and Energy aWare load balancIng Scheme (LEWIS), is proposed to compute the NBS. Further, to assess the efficacy of LEWIS, it is compared with three other approaches, i.e., Coop RT, Coop EN, and NCG on problem instances of various settings. The experimental results show that LEWIS not only provides less response time while consuming less energy, but also gauntness fairness to the end-user

11 December 2020 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
AKAvadh Kishor
Avadh Kishor
RNRajdeep Niyogi
Rajdeep Niyogi
BVBharadwaj Veeravalli
Bharadwaj Veeravalli
When a set of self-interested users shares multiple resources in a distributed system, we face the problem of allocating resources, called the load balancing problem. In particular, load balancing is defined as allocating the load to the servers of the distributed system such that jobs' response time is minimized, and the utilization of servers is improved. In this paper, the load balancing problem in a distributed system consists of a finite set of servers, and a finite set of users is studied. The load balancing problem considered here is a bi-objective problem with two highly probable conflicting objectives: (i) minimizing jobs' response time (ii) providing the fair utilization of servers. In order to satisfy these two objectives simultaneously, both the objectives are considered in an integrated manner. Next, the load balancing problem is formulated as a noncooperative game; and to solve the game (i.e., to find the Nash equilibrium), a distributed load balancing algorithm (DLBA) is proposed. An experimental study is carried out to ascertain the efficacy of the proposed DLBA. Further, we compare DBLA with three existing load balancing approaches to evaluate its comparative effectiveness. The experimental results validate the effectiveness of the DLBA over the existing approaches.

1 June 2015
Verified
Conference Paper
Closed access
ACAndrea Chiancone
Andrea Chiancone
Valentina FranzoniValentina Franzoni
Valentina Franzoni
RNRajdeep Niyogi
Rajdeep Niyogi
Alfredo MilaniAlfredo Milani
Alfredo Milani
Most of the best performing link prediction ranking measures evaluate the common neighbourhood of a pair of nodes in a network, in order to assess the likelihood of a new link. On the other hand, the same zero rank value is given to node pairs with no common neighbourhood, which usually are a large number of potentially new links, thus resulting in very low quality overall link ranking in terms of average edit distance to the optimal rank. In this paper we introduce a general technique for improving the quality of the ranking of common neighbours-based measures. The proposed method iteratively applies any given ranking measure to the quasi-common neighbours of the node pair. Experiments held on widely accepted datasets show that QCNAA, a quasi-common neighbourhood measure derived from the well know Adamic-Adar (AA), generates rankings which generally improve the ranking quality, while maintaining the prediction capability of the original AA measure.

13 November 2019 in International Journal of Intelligent Robotics and Applications
Verified
Journal Article
Closed access
PDF file
ANAmar Nath
Amar Nath
AAA. R. Arun
A. R. Arun
RNRajdeep Niyogi
Rajdeep Niyogi

14 March 2020 in Future Generation Computer Systems
Verified
Journal Article
Closed access
AKAvadh Kishor
Avadh Kishor
RNRajdeep Niyogi
Rajdeep Niyogi
BVBharadwaj Veeravalli
Bharadwaj Veeravalli