Sudarshan deshmukh - Academia.edu (original) (raw)

Papers by Sudarshan deshmukh

2017 IEEE International Conference on Technological Innovations in Communication, Control and Automation (TICCA), 2017

Popularity of big data in cloud computing is growing tremendously nowadays. Data production rate ... more Popularity of big data in cloud computing is growing tremendously nowadays. Data production rate has become explosive. Many existing systems need to expand their service to support explosive data generation rate. NoSQL database are suitable to handle large volume of data. This paper proposes a data adapter which supports hybrid database systems, NoSQL databases and relational databases. Also, a seamless mechanism is provided for hybrid database system construction, which enables access to both databases at same time. This paper focuses on the automated transformation of multi-structured data hybrid systems. Hybrid database systems provide access to either relational database or NoSQL database, per data size. The proposed data adapter supports application queries and database transformation at same time, which in turn speed up the process. Three different approaches are proposed for queries on database. Blocking transformation mode, blocking truncation mode, direct access mode. This paper also discusses the integration of Pentaho business analytics tool with proposed data adapter, for big data predictive analytics. This integration focuses on empowering users to prepare, model and visualize and explore data sets stored in NoSQL databases. This paper describes the design of the data adapter in detail.

— Glusterfs is scalable distributed file system implemented in C language. Glusterfs is best exam... more — Glusterfs is scalable distributed file system implemented in C language. Glusterfs is best example to learn about distributed file system for students. Glusterfs is software based distributed file system, and As it is open source any one can use and extend its features. Its architecture is very simple to learn. It can be installed on commodity hardware that is personal computers. Glusterfs doesnot uses concept of metadata to store information about files stored on server. Client intelligence bases DHT algorithm is used in glusterfs which is alternative for metadata storage as client with the help of DHT, can calculate files address and access files easily. Concept of bricks and volumes isolates different users data on cluster of file system. Glusterfs can be useful for academic student to learn about distributed file system. Cluster can be implemented to store students data and utilized and demonstrated use of distributed file system.

— Distributed computing architectures utilize a set of computational elements (CEs) to achieve pe... more — Distributed computing architectures utilize a set of computational elements (CEs) to achieve performance that is not attainable on a single CE. Conventional load balancers have proven effective in increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. However, most of the existing load-balancing schemes ignore network resources, leaving an opportunity to improve the network resources like delay or effective bandwidth of networks running parallel applications.Load balancing becomes more challenging in interactive applications as load variation is very large and the load on each server may change dramatically over time, by the time when a server is to make the load migration decision, the collected load status from other servers may no longer be valid. This will affect the accuracy, and hence the performance, of the load balancing algorithms. All the existing methods neglect the effect of network delay among the servers on the accuracy of the...

In this paper, we present a game theoretic framework for different type of VANET system problem l... more In this paper, we present a game theoretic framework for different type of VANET system problem like broadcast storm problem, routing algorithm, robust to imperfect measurement. This type of problem give different result depends on environment of VANET systems. We analyze different game theory approaches and applying them with the mathematical model structure. Finally, the performance of each scheme is compared with that of other existing schemes. The main goal of our paper is to make literature survey study on existing game theoretic approaches so as to find the improvement points to consider it as an implementation issue in VANET message forwarding.

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, a... more Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Load balancing becomes more challenging as load variation is very large and the load on each server may change dramatically over time, by the time when a server is to make the load migration decision, the collected load status from other servers may no longer be valid. This will affect the accuracy, and hence the performance, of the load balancing algorithms. All the existing methods neglect the heterogeneity of nodes and contextual load balancing. In this paper, context based load balancing and task allocation with network proximity of heterogeneous nodes will be discussed.

Distributed computing architectures utilize a set of computational elements (CEs) to achieve perf... more Distributed computing architectures utilize a set of computational elements (CEs) to achieve performance that is not attainable on a single CE. Conventional load balancers have proven effective in increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. However, most of the existing load-balancing schemes ignore network resources, leaving an opportunity to improve the network resources like delay or effective bandwidth of networks running parallel applications.Load balancing becomes more challenging in interactive applications as load variation is very large and the load on each server may change dramatically over time, by the time when a server is to make the load migration decision, the collected load status from other servers may no longer be valid. This will affect the accuracy, and hence the performance, of the load balancing algorithms. All the existing methods neglect the effect of network delay among the servers on the accuracy of the l...

2015 4th International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions), 2015

Load balancing in a distributed file system is becoming essential as a distributed file system is... more Load balancing in a distributed file system is becoming essential as a distributed file system is gaining more popularity both in use and research. Resource utilization is very much important as it affects the cost of the system, response time, performance etc. Now a days dynamic load balancer is adopted by most of distributed file systems. Adaptive loading data migration and Self acting load balancing proves better performance, which behaves centralized and distributed way respectively. A Modified approach to create new distributed, dynamic load balancer for distributed file system is adopted. In which, the algorithm considers constraints as network load, disk IO load, Disk capacity, load which was not considered in earlier approaches. The load balancing problem is solved based on constraint satisfaction theory, which sets the optimum level so that system throughput, response time is improved. Experimental results show that overall performance is improved by 8 to 9%.

International Journal of Computer Applications, 2015

Distributed Systems are useful for computation and storage of large scale data at dispersed locat... more Distributed Systems are useful for computation and storage of large scale data at dispersed location. Distributed File System (DFS) is a subsystem of Distributed System. DFS is a means of sharing of storage space and data. Servers, Storage devices and Clients are on dispersed location in DFS. Fault tolerance and Scalability are two main features of distributed file system. Performance of DFS is measured by response time. Apart from response time there are also other dimensions such as transparency in which performance of DFS is viewed. DFS provides file services with scalability, fault tolerance, availability, minimum response time. The truth behind the minimum response time is good design of load balance algorithm. To improve the minimum response time and utilization of all nodes in DFS cluster it is found static as well as dynamic load balance strategies. In this survey paper Self acting, load balancing for parallel file system, Adaptive loading data migration in distributed file system, Load balancing in distributed multi agent computing systems, Self organizing storage clusters for data intensive applications, User centric data migration in networked storage systems are discussed to study the different load balancing schemes. Adaptive loading data migration is one of the latest solution found in literature survey. Self acting, load balancing (SALB) for parallel file system is for load balancing uses online load prediction methods and is distributed architecture.

IOSR Journal of Computer Engineering, 2014

Cloud computing is an essential ingredient of modern computing systemsCloud computing provides an... more Cloud computing is an essential ingredient of modern computing systemsCloud computing provides an on demand service because it offers dynamic resource allocation for reliable and highly available services in pay as-you-consume manner to public. In Cloud computing environment multiple cloud users can request number of cloud services in parallel. So there must be a provision that all resources which are made available to requesting user in efficient manner to satisfy their need. In this Survey paper a review of various strategies for dynamic resource allocation in cloud computing is shown based on Linear Scheduling Strategy for Resource Allocation, Topology Aware Resource Allocation (TARA) and Dynamic Resource Allocation for Parallel Data Processing. Moreover limitations significance and advantages of using Resource Allocation in Cloud computing systems is also discussed.

2013 World Congress on Computer and Information Technology (WCCIT), 2013

For the past few years, number of accidents have occurred due to the rapid usage of vehicles in t... more For the past few years, number of accidents have occurred due to the rapid usage of vehicles in the road and the lack of emergency alerts provisioning to the vehicle user during natural disasters. VANETs provide an environment to communicate between vehicles to avoid such accidents. Vulnerabilities in the network layer of VANET delays timely traffic data dissemination to the vehicle user. Ensuring Security in VANET is very essential for the construction of a robust network for transmission of data. In this paper the game theoretic approaches like cooperative and Non-Cooperative Games for handling security issues in VANET are discussed.

International Journal of Computer Applications, 2013

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, a... more Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Those schemes follow the technique of self owned resource based load balancing. But load balancing involves more challenges due to lack of sources for some of the tasks. Hence it is not always possible the task get all required resources on a single node. Consider node conditions i. e. the other nodes situated in its context. The task which lack with some of the resources will try to negotiate those resources with these contextual nodes. Then a task can complete and the resources utilized will be released. Doing this we are able to reduce load migrations. This proposed scheme not only works well with heterogeneous nodes but also considers proximity in them. Our result shows more than 20% reduction in communication costs than the previous methods based on self-owned resource distribution of nodes.

2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009

... Pooja S. Sawalkar Sachin S. Lecturer, Dept. Of Computer Engg. Programmer Analyst, Asst.Prof. ... more ... Pooja S. Sawalkar Sachin S. Lecturer, Dept. Of Computer Engg. Programmer Analyst, Asst.Prof. Dept. of Computer Engg. PCCOE, Cognizant Technology Solutions. PCCOE,Pune Pune, India. Pune,India. India. deshmukh.sudarshan@gmail.com pooja.gunjal@cognizant.com ...

International Journal of Computer Applications, 2013

Distributed interactive applications (DIA) are becoming popular in the recent years. Examples of ... more Distributed interactive applications (DIA) are becoming popular in the recent years. Examples of DIAs include shared workspaces, networked games, distributed whiteboards, distributed architectural design, virtual classrooms, telemedicine and simulation. The essential aspect of DIAs is that sufficient information is communicated between participants so that the state of the application remains consistent for all participants at all times. Consistent refers to the state of all the systems. If nodes have inaccurate information about the state of other nodes, due to communication delays between nodes, this could result in unnecessary periodic exchange of loads among them, due to which, certain nodes may become idle while loads are in transit, this would result in the prolonged total completion time of a load. Hence load balancing becomes more challenging in interactive applications as load variation is very large and the load on each server may change continuously over time, when the server takes the load migration decision, the load status collected from other servers may not be valid. This will affect the performance, of the load balancing algorithms. All the existing methods neglect the effect of network delay among the servers on the load balancing solutions. In this paper, due to the change in the load of the server, network delay would affect the performance of the load balancing algorithm. A new priority packet scheduling scheme is proposed in which load requesting Interactive application packets are placed in the highest priority queue and the processing of packets at other queue. Simulation results show that the proposed buffered priority packet scheduling scheme outperforms AODV with single queue for the load requesting messages of Interactive application in term of end-to-end data transmission delay.

2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009

We design and evaluate a hybrid load balancing policy, which selects effective node sets in the s... more We design and evaluate a hybrid load balancing policy, which selects effective node sets in the stage of static load balancing to lower the odds of selecting ineffective nodes and makes use of the stage of dynamic load balancing. When a node status changes, a new substitute can be located in the shortest time to maintain the execution performance of the system. The algorithm deals with an effective methodology to generate an optimum output by making efficient use of available resources in MIMD architectures.

2013 International Conference on Control, Computing, Communication and Materials (ICCCCM), 2013

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, a... more Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Those schemes follow the technique of self-owned resource based load balancing. But load balancing involves more challenges due to lack of sources for some of the tasks. Hence it is not always possible the task get all required resources on a single node. Here we have to consider node conditions i. e. the other nodes situated in its context. The task which lack with some of the resources will try to negotiate those resources with these contextual nodes. Then a task can complete and the resources utilized will be released. Doing this we are able to reduce load migrations. This proposed scheme not only works well with heterogeneous nodes but also considers proximity in them. Our result shows more than 20% reduction in communication costs than the previous methods based on self-owned resource distribution of nodes.

Format Research Objectives: 1. <A: To develop load balancing scheme considering contextual inform... more Format Research Objectives: 1. <A: To develop load balancing scheme considering contextual information of nodes in heterogeneous environment> 2. <B: Proximity information is used to guide virtual server reassignments such that virtual servers are reassigned and transferred between physically close heavily loaded nodes and lightly loaded nodes, thereby minimizing the load movement cost and allowing load balancing to perform efficiently > Expected Research Outcome: 1. <A: The communication costs between agents to execute the allocated task are reduced so the total execution time of tasks can also be reduced accordingly > 2. <B: Execution of Task allocation and load balancing activities by considering the resources together with computable functions. >

2017 IEEE International Conference on Technological Innovations in Communication, Control and Automation (TICCA), 2017

2015 4th International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions), 2015

International Journal of Computer Applications, 2015

IOSR Journal of Computer Engineering, 2014

2013 World Congress on Computer and Information Technology (WCCIT), 2013

International Journal of Computer Applications, 2013

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, a... more Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Those schemes follow the technique of self owned resource based load balancing. But load balancing involves more challenges due to lack of sources for some of the tasks. Hence it is not always possible the task get all required resources on a single node. Consider node conditions i. e. the other nodes situated in its context. The task which lack with some of the resources will try to negotiate those resources with these contextual nodes. Then a task can complete and the resources utilized will be released. Doing this we are able to reduce load migrations. This proposed scheme not only works well with heterogeneous nodes but also considers proximity in them. Our result shows more than 20% reduction in communication costs than the previous methods based on self-owned resource distribution of nodes.

2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009

International Journal of Computer Applications, 2013

2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009

2013 International Conference on Control, Computing, Communication and Materials (ICCCCM), 2013

Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, a... more Conventional load balancing schemes are efficient at increasing the utilization of CPU, memory, and disk I/O resources in a Distributed environment. Most of the existing load-balancing schemes ignore network proximity and heterogeneity of nodes. Those schemes follow the technique of self-owned resource based load balancing. But load balancing involves more challenges due to lack of sources for some of the tasks. Hence it is not always possible the task get all required resources on a single node. Here we have to consider node conditions i. e. the other nodes situated in its context. The task which lack with some of the resources will try to negotiate those resources with these contextual nodes. Then a task can complete and the resources utilized will be released. Doing this we are able to reduce load migrations. This proposed scheme not only works well with heterogeneous nodes but also considers proximity in them. Our result shows more than 20% reduction in communication costs than the previous methods based on self-owned resource distribution of nodes.