M. Dakshayini

M. Dakshayini

Auto-generated profile, based on publicly available information

M. Dakshayini

Dept. of Information Science and Eng., BMS College of Engineering, Bangalore, India

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 April 2014
Verified
Conference Paper
Closed access
RPRekha P.M.
Rekha P.M.
MDM. Dakshayini
M. Dakshayini
Cloud computing is the technology where, IT infrastructure and applications are provided as a service using data center to the end user as pay per use model. Cloud infrastructure has distributed applications that can be deployed in data centers situated at different geographic locations. These data centers are overloaded as more number of client applications is serviced in the same location. Distributed application impacts its performance for users that are far from the data center. Applications of different users may have different configuration, composition and deployment requirements. Measuring such user application workload, performance of various resources is tough to achieve. We propose a service broker policy to reduce overloading of the data center by redirecting the user requests to the next neighboring data center which is in off peak time resulting cost effectiveness. A quantitative performance estimate may guide the service provider in making decisions for right level of resource. In this paper, we consider the location of cloud infrastructures, application clients between data centers so as to optimize the waiting time and cost to the end users. The aim of this paper is to briefly discuss about various existing service broker policies and new proposed policy to minimize the cost and processing time of data center.


1 June 2015
Verified
Conference Paper
Closed access
BRB S Rajeshwari
B S Rajeshwari
MDM Dakshayini
M Dakshayini
The emerging technological demands of users call for expanding service model which avoids problem of purchasing and maintaining IT infrastructure and supports for computation-intensive services. This has directed to the development of a new computing model termed Cloud Computing. In cloud computing, the computing resources are distributed in various data centers worldwide and these resources are offered to the customers on demand on a pay as usage basis. Currently, due to the increased usage of cloud, there is a tremendous increase in workload. The uneven distribution of load among the servers results in server overloading and may lead to the server crash. This affects the performance. Cloud computing service providers can attract the customers and maximize their profit by providing Quality of Service (QoS). Providing both QoS and load balancing among the servers are the most challenging research issues. Hence, in this paper, a framework is designed to offer both QoS and balancing the load among the servers in cloud. This paper proposes a two stage scheduling algorithm. The servers with different processing power are grouped into different clusters. In the first stage, Service Level Agreement (SLA) based scheduling algorithm determines the priority of the tasks and assigns the tasks to the respective cluster. In the second stage, the Idle-Server Monitoring algorithm balances the load among the servers within each cluster. The proposed algorithm has used the response time as a QoS parameter and is implemented using CloudSim simulator. Experimental results shows that our algorithm provides better response time, waiting time, effective resource utilization and balancing load among the servers as compared to other existing algorithms.

1 December 2013
Verified
Conference Paper
Closed access
HAH.V Abhijith
H.V Abhijith
MDM Dakshayini
M Dakshayini
Wireless sensor network (WSN) is one of the most emerging technology which consists of large number of sensor nodes with each having the capacity to sense, compute and communicate the data. WSN has great deal of applications in various fields like military, agriculture, industry healthcare etc. Sensor nodes are randomly and densely deployed. This kind of deployment creates large number of redundant sensor data. Routing of such redundant data not only saturates network resources, but also consumes more energy. Data aggregation is the effective technique which reduces the number of transmissions to sink node by aggregating the similar packets in an energy efficient manner to enhance the lifetime of network. There exists different data aggregation techniques which perform aggregation in single level or two levels. In this paper we are proposing multilevel hierarchical data aggregation technique which handles the redundancy in sensor data very efficiently.

1 December 2014
Verified
Conference Paper
Closed access
PJP Jayarekha
P Jayarekha
MDM Dakshayini
M Dakshayini
Outcome-Based Education (OBE) is a student-centered learning method that focuses on empirically measuring student performance. OBE has become the standard of practice in the engineering education programme. The measurement of student performance is done using both direct and indirect assessment tools. The value obtained out of these tools are then transformed to a score and checked whether they meet the required attainment level of Course Outcome set for a particular Course. The scores of all the Course Outcomes collectively contribute towards the attainment of Programme Outcome. This process is recursively applied for four years until the student completes the Programme. This paper presents a direct assessment method used in measuring the Programme Outcomes (POs) via appropriate direct assessment tools. A sample assessment presented in this paper shows a process of attainment of graduate attributes stated by NBA which are in line with the Programme Outcomes of Washington Accord.

1 December 2007
Verified
Conference Paper
Closed access
MDM. Dakshayini
M. Dakshayini
HGH.S. Guruprasad
H.S. Guruprasad
HMH.D. Maheshappa
H.D. Maheshappa
AMA.S. Manjunath
A.S. Manjunath
In this paper, we propose a unique VoD architecture and implementation for efficient QoS. This scheme reduces the bandwidth demand between the centralized multimedia server (CMS) and the proxy servers by sharing the videos among the proxy servers of the local proxy servers group [LPSG], which are connected to each other and coordinated by a coordinating proxy server called tracker. This results in high QoS for the users, very low request rejection ratio, low storage redundancy among the proxy servers in LPSG by load balancing among the neighboring proxy servers and non neighboring proxy servers, reduction of load on the CMS. Our simulation results indicate acceptable waiting time for user requests in all conditions, load sharing among the proxy servers and between the CMS and proxy servers with the coordination of tracker.