Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
13 results
Search Results
Item Multicasting in wireless mesh networks: Challenges and opportunities(2009) Kumar, K.K.S.; Hegde, S.Wireless Mesh Network (WMN) is a multi-hop wireless network with partial mesh topology, which can replace wired infrastructure backbone in a traditional wireless network, to wireless. It is an exciting new technology that has applications in defense, metro-area Internet access, and disaster management. WMNs are believed to be a highly promising technology and will play an increasingly important role in future generation wireless mobile networks. This paper presents a survey on multicast protocols in wireless mesh networks and factors to be addressed while designing a multicast protocol for wireless mesh networks, like availability of mesh router infrastructure, effect of multiple channels and channel assignment, load balancing, selection of multicast routing metric, effect of guaranteed Quality of Service, andcross layer optimization. © 2009 IEEE.Item Hierarchical DHT to efficiently load balancing in dynamic peer-to-peer environment(2011) Kakulte, B.S.; Santhi Thilagam, P.There has been tremendous interest in emerging Peer-to- Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution and applicationlevel multicast applications. P2P networks offer an efficient routing architecture that is massively scalable, self-organizing, and robust. It also provides fault tolerance. Structured peer-to-peer (P2P) such as Chord organizes peers into a flat overlay network and offer distributed hash table (DHT) functionality. Basically in this system, data is associated with keys and each peer is responsible for a subset of the keys. In Hierarchical DHTs peers are arranged into groups, and each group has its autonomous intra-group overlay network and lookup service. Compare to flat DHT systems, hierarchical systems can efficiently distribute the load among different peers. It is also observed that peers join and leave the P2P network frequently, which affect the structured network. In this paper, we are proposing the architecture which can efficiently balance the load among peers, also it can handle the frequent joining and leaving of peers in P2P system. © Springer-Verlag 2011.Item Load balancing in cloud computing using modified throttled algorithm(IEEE Computer Society help@computer.org, 2013) Domanal, S.G.; Guddeti, G.Load balancing is one of the critical components for efficient operations in the cloud computing environment. In recent years many clients from all over the world are demanding the various services at rapid rate. Many algorithms have been designed to carry out the client's request towards the cloud nodes. Accordingly the cloud computing platform will dynamically configure its servers and these servers may be present physically or virtually in the computing environment. Hence, selecting the virtual machines or servers has to be scheduled properly by using an appropriate load balancing approach. In the present work, a local optimized load balancing approach is proposed for distributing of incoming jobs uniformly among the servers or virtual machines. Further, the performance is analyzed using CloudAnalyst simulator and compared with existing Round Robin and Throttled algorithms. Simulation results have demonstrated that the proposed algorithm has distributed the load uniformly among virtual machines. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.Item Resource aware scheduling in Hadoop for heterogeneous workloads based on load estimation(2013) Kapil, B.S.; Kamath S․, S.S.Currently, most cloud based applications require large scale data processing capability. Data to be processed is growing at a rate much faster than available computing power. Hadoop is used to enable distributed processing on large clusters of commodity hardware. In large clusters, the workloads may be heterogeneous in nature, that is, I/O bound, CPU bound or network intensive jobs that demand different types of resources requirement so as to run simultaneously on large cluster. Hadoops job scheduling is based on FIFO where, parallelization based on types of job has not been taken into account for scheduling. In this paper, we propose a new scheduling algorithm for Hadoop based distributed system, based on the classification of workloads to assign a specific category to a particular cluster according to current load of the cluster. The proposed scheduler increases the performance of both CPU and I/O resources in a cluster under heterogeneous workloads, by approximately 12% when compared to Hadoops FIFO scheduler. © 2013 IEEE.Item Optimal load balancing in cloud computing by efficient utilization of virtual machines(2014) Domanal, S.G.; Guddeti, G.R.M.Load balancing is the major concern in the cloud computing environment. Cloud comprises of many hardware and software resources and managing these will play an important role in executing a client's request. Now a day's clients from different parts of the world are demanding for the various services in a rapid rate. In this present situation the load balancing algorithms built should be very efficient in allocating the request and also ensuring the usage of the resources in an intelligent way so that underutilization of the resources will not occur in the cloud environment. In the present work, a novel VM-assign load balance algorithm is proposed which allocates the incoming requests to the all available virtual machines in an efficient manner. Further, the performance is analyzed using Cloudsim simulator and compared with existing Active-VM load balance algorithm. Simulation results demonstrate that the proposed algorithm distributes the load on all available virtual machines without under/over utilization. © 2014 IEEE.Item Load balancing of MongoDB with tag aware sharding(Walter de Gruyter GmbH info@degruyter.com, 2015) Shegokar, P.; Thomas, M.V.; Chandrasekaran, K.In the era of Big Data, traditional databases face many problems to process data effectively. To solve problems we have NoSQL databases which can solve the problems and are becoming very popular. MongoDB is a document oriented NoSQL database which can process large data sets with the help of sharding mechanism. MongoDB supports range-based sharding, hash-based sharding and tag aware sharding. Problem with range-based method is that one of the shard will have more load. In case of hash-based method, we can distribute the load among shards but related data aren't together. Tag aware sharding method is better than the other two methods. But this method need to be enhanced as tagged data can belong to more shards and balancer have to migrate the data to most appropriate shard, hence we are enhancing the tag aware sharding in MongoDB. Improper distribution of data can't allow us to use all the benefits of sharding. Tag aware sharding is administrator based method in which tags are mentioned by the administrator. According to tags, data is migrated but we need to balance the load. To solve this problem, Weighted Round Robin (WRR) load balancing algorithm is used and it has improved the writing and querying performance.Item Load balancing strategy for optimal peak hour performance in cloud datacenters(Institute of Electrical and Electronics Engineers Inc., 2015) Kulkarni, A.K.; Annappa, B.Cloud computing is a growing computing model that is influencing every other entity in the global business industry. Efficient load balancing techniques plays a major role in cloud computing by allocating requests to computing resources efficiently to prevent under/over-allocation of Virtual Machines (VMs) and improve the response time to clients. It is observed that during peak hours when request frequency is high, active VM load balancer (packaged in cloudAnalyst) over-allocates initial VMs and under-allocates later ones creating load imbalance. In this paper we propose a novel VM load balancing algorithm that ensures uniform allocation of requests to virtual machines even during peak hours when frequency of requests received in data center is very high to ensure faster response times to users. The simulations results suggest that our algorithm allocates requests to VM uniformly even during peak traffic situations. © 2015 IEEE.Item Cost aware service broker algorithm for load balancing geo-distrubuted data centers in cloud(Institute of Electrical and Electronics Engineers Inc., 2017) Kulkarni, A.K.; Annappa, B.With increased cloud adoption globally, the cloud service providers are setting up their data centers in various geographical location to cater the needs of diverse range of users across the globe. The cost of managing data center includes not only hardware, software costs but also the electricity costs prevailing at that location. The cost of electricity varies from location to location and it is mainly because of the uneven production & availability of resources, infrastructure to generate electricity at that part of the globe. It is important for data center owners to reduce the data center management cost without affecting the agreed SLA of service to its users. The paper proposes an algorithm for routing service requests to geo-distributed datacenters considering the electricity cost and response times to optimize the cost of datacenter management. The experimental results using cloud analyst show that our approach reduces the cost of data center management without any increase in the response time for users. © 2017 IEEE.Item Memory-based load balancing algorithm in structured peer-to-peer system(Springer Verlag service@springer.de, 2018) Raghu, G.; Sharma, N.K.; Domanal, S.G.; Guddeti, G.There are several load balancing techniques which are popular used in Structured Peer-to-Peer (SPTP) systems to distribute the load among the systems. Most of the protocols are concentrating on load sharing in SPTP Systems that lead to the performance degeneration in terms of processing delay and processing time due to the lack of resources utilization. The proposed work is related to the sender-initiated load balancing algorithms which are based on the memory. Further to check the performance of the proposed load balancing algorithm, the experimental results carried out in the real-time environment with different type of network topologies in distributed environment. The proposed work performed better over existing load balancing algorithm such as Earliest Completion Load Balancing (ECLB) and First Come First Serve (FCFS) in terms of processing delay and execution time. © Springer Nature Singapore Pte Ltd. 2018.Item Construing microservice architectures: State-of-the-art algorithms and research issues(Springer Verlag service@springer.de, 2019) Nene, A.V.; Joseph, C.T.; Chandrasekaran, K.Cloud Computing is one of the leading paradigms in the IT industry. Earlier, cloud applications used to be built as single monolithic applications, and are now built using the Microservices Architectural Style. Along with several advantages, the microservices architecture also introduce challenges at the infrastructural level. Five such concerns are identified and analysed in this paper. The paper presents the state-of-art in different infrastructural concerns of microservices, namely, load balancing, scheduling, energy efficiency, security and resource management of microservices. The paper also suggests some future trends and research domains in the field of microservices. © Springer Nature Switzerland AG 2019.