Faculty Publications

Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736

Publications by NITK Faculty

Browse

Author: search.filters.author.Santhi Thilagam, P.Has files: No

Search Results

Now showing 1 - 10 of 27
  • No Thumbnail Available
    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.
  • No Thumbnail Available
    Item
    SQL injection attack mechanisms and prevention techniques
    (2012) Chandrashekhar, R.; Mardithaya, M.; Santhi Thilagam, P.; Saha, D.
    SQL Injection Attacks have been around for over a decade and yet most web applications being deployed today are vulnerable to it. The bottom line is that the web has made it easy for new developers to develop web applications without concerning themselves with the security flaws, and that SQL Injection is thought to be a simple problem with a very simple remedy. To truly bring security to the masses, we propose a classification that not only enumerates but also categorizes the various attack methodologies, and also the testing frameworks and prevention mechanisms. We intend our classification to help understand the state of the art on both sides of the fields to lay the groundwork for all future work in this area. © 2012 Springer-Verlag.
  • No Thumbnail Available
    Item
    Intrusion detection technique for wormhole and following jellyfish and byzantine attacks in wireless mesh network
    (2012) Karri, K.; Santhi Thilagam, P.
    Wireless Mesh Networks (WMNs) have emerging application because of its ad-hoc features, high internet bandwidth capability, and interoperable with various networks. However, all features of WMNs vulnerable due to their inadequate security services, and most of the existing techniques protect WMNs from single adversary node, but failed to protect colluding attacks. We proposed new Intrusion Detection (ID) technique, to protect the WMNs from wormhole attack (colluding attack) and following jellyfish and byzantine attacks. The proposed ID technique works based on different delays such as initial end-to-end packet delay, average end-to-end packet delay, and worst case end-to-end packet delay because wormhole attackers attract the network nodes by sending lower latency. Eventually, simulation results show that, our ID technique improves throughput of the network, when source and destination nodes detect and isolate (select new path which does not contain adversaries) the adversaries in wormhole attack and its following attacks. © 2012 Springer-Verlag.
  • No Thumbnail Available
    Item
    Taxonomy of network layer attacks in wireless mesh network
    (2012) Karri, K.; Santhi Thilagam, P.
    Wireless Mesh Networks (WMNs) have emerging application because of its ad-hoc features, high internet bandwidth capability, and interoperable with various networks. However, all features of WMNs vulnerable due to their inadequate security services, and most of the existing techniques protect WMNs only.from single adversary node, but these techniques are failed to protect against multiple colluding attacks, and also have same reputation value for all types of attacks. To overcome these problems for future solutions, we have done clear analytical survey on network layer attacks. Eventually, we have come up with taxonomy of network layer attack. © 2012 Springer-Verlag GmbH.
  • No Thumbnail Available
    Item
    Optimal scheduling of computational task in cloud using Virtual Machine Tree
    (2012) Achar, R.; Santhi Thilagam, P.; Shwetha, D.; Pooja, H.; Roshn; I Andrea
    The increasing demand in computing resources and widespread adaptation of Service Oriented Architecture (SOA) has made cloud as a new IT delivery mechanism. In cloud, computing resources are provided to the requester as a service, which include Software as a Service (SaaS), Platform as a Service (PaaS) and Infrastructure as a Service (IaaS). Cloud Computing is still in developing stage and faces many challenges. Out of the various issues, scheduling plays a very important role in determining the efficient execution of tasks in cloud environment. In this paper we present a scheduling algorithm which uses tree based data structure called Virtual Machine Tree (VMT) for efficient execution of tasks. The proposed algorithm is tested using CloudSim simulator and the results shows that algorithm gives better performance compared to other traditional scheduling algorithms. © 2012 IEEE.
  • No Thumbnail Available
    Item
    An empirical study of license violations in open source projects
    (2012) Mathur, A.; Choudhary, H.; Vashist, P.; Thies, W.; Santhi Thilagam, P.
    The use of Open Source Software (OSS) components in building applications has presented the challenge of integrating them in a way such that the licenses of the individual components do not conflict with each other and if applicable, the overall license of the application. These conflicts lead to violations, with many having far reaching legal consequences. While proprietary software firms are often plagued with the risks of not satisfying the clauses of OSS licenses, we hypothesize that a large degree of code reuse within the OSS community poses similar threats too. Through an analysis of 1423 projects, consisting of approximately 69 million non-blank lines of code from Google Code project hosting, we validate instances of code reuse between projects by comparing their licenses. Our results discover four violations, evaluated by searching for files that share similar content. Additionally, we present statistics on code reuse within the set of projects. © 2013 IEEE.
  • No Thumbnail Available
    Item
    Cross-layer IDS for rushing attack in wireless mesh networks
    (2012) Karri, K.; Santhi Thilagam, P.; Rao, B.N.
    Wireless Mesh Networks (WMNs) are a promising technology to provide the wireless internet connectivity. WMNs are becoming a popular choice for wireless internet service providers to offer internet connectivity as it allows a fast, easy and inexpensive network deployment. However, security in WMNs is still in its infancy. Security and privacy has been a major concern in WMNs. WMNs are susceptible to broad variety of attacks due to its open medium, dynamic topology and lack of physical security. WMNs are more vulnerable in Network layer. Several attacks are possible in the network layer. Some of the attacks have possible solutions but there is no solution for to detect Rushing attack which leads to the Denial of Service. In this paper, the authors proposed Cross- Layer Intrusion Detection System (CLIDS) for Rushing attack. We evaluated the performance of our technique using network simulator 2. Simulation results show that CLIDS has less false positive and false negative rates than single layer intrusion detection system. Copyright © 2012 ACM.
  • No Thumbnail Available
    Item
    Hierarchical homomorphic encryption based privacy preserving distributed association rule mining
    (Institute of Electrical and Electronics Engineers Inc., 2014) Rana, S.; Santhi Thilagam, P.
    Privacy is an important issue in the field of distributed association rule mining, where multiple parties collaborate to perform mining on the collective data. The parties do not want to reveal sensitive data to other parties. Most of the existing techniques for privacy preserving distributed association rule mining suffer from weak privacy guarantees and have a high computational cost involved. We propose a novel privacy preserving distributed association rule mining scheme based on Paillier additive homomorphic cryptosystem. The experimental results demonstrate that the proposed scheme is more efficient and scalable compared to the existing techniques based on homomorphic encryption. © 2014 IEEE.
  • No Thumbnail Available
    Item
    A broker based approach for cloud provider selection
    (Institute of Electrical and Electronics Engineers Inc., 2014) Achar, R.; Santhi Thilagam, P.
    Rapid growth of internet technology made many IaaS providers arise across the globe to meet the needs of small IT companies. Number of IT companies started using resources of IaaS provider due to elastic and pay as you go nature. Increasing number of cloud providers results in difficulty for requester to select suitable cloud provider based on requirements. In this paper we present a broker based architecture for selecting suitable cloud provider from multiple providers. The broker measure the quality of each cloud provider and prioritize them based on the needs of the requester. The experiment is conducted using cloudsim simulator shows that proposed architecture selects suitable cloud provider. © 2014 IEEE.
  • No Thumbnail Available
    Item
    Time stamp based set covering greedy algorithm
    (Association for Computing Machinery acmhelp@acm.org, 2015) Vasanthi, P.; Tejaswi, V.; Santhi Thilagam, P.
    Influence maximization deals with finding a small set of target nodes that can be initially activated, such that the influence spread beginning with this causes maximum number of expected activated nodes in the network. Most of the existing algorithms for choosing the seed set concentrate only on the structural properties of the network. We would like to emphasize that it is equally important that a user should be actively involved with his neighbours in order to successfully influence them. Hence a novel measure termed as 'Activeness' of a user which is based on timestamp of the user's recent communication with his neighbours is considered. On the same lines, we propose time stamp based set covering greedy (TSCG) algorithm for seed set selection and a Time stamp based threshold model to map the information diffusion in the network. As a part of our experiments, we compare and analyse the results with degree centrality measure and set covering greedy(SCG) algorithm and cite that the spread achieved by our proposed algorithm though lesser in some cases, is more accurate. © 2015 ACM.