V. P. Arunachalam

SNS College of Technology, Coimbatore, State of Tamil Nadu, India

Are you V. P. Arunachalam?

Claim your profile

Publications (9)0 Total impact

  • Source
    S.Karthik, V.P.Arunachalam, T.Ravichandran
    [Show abstract] [Hide abstract]
    ABSTRACT: DoS / DDoS(Distributed Denial of Service) attacks denyregular, internet services accessed by legitimate users,either by blocking the services completely, or by disturbingit completely, so as to cause customer baulking. Severaltraceback schemes are available to mitigate these attacks.The simulation approach also can be used to test theperforming effects of different marking schemes in largescaleDDoS attacks. Based on the simulation andevaluation results, more efficient and effective algorithms,techniques and procedures to combat these attacks may bedeveloped. DGT8, directional geographical trackbackscheme, with 8 directions is one of them. Having a limitedset of 8 directions, DGT8 may not work for routers withmore than 8 interfaces. In this paper, we propose M-DGTi.e DGT 16, a 16 directional geographical tracebackscheme having all the advantages of DGT. The 16directions, though not having exactly equal interface, havenearly equal measures, and are identified using a novelscheme of Segment Direction Ratios (SDR). The SDRconcept and the associated marking scheme allow thevictim to defend against DDoS attacks independent of itsISP and also the generalization to DGT2n, having 2ndirections (n>4).
    International Journal of Computer Applications. 01/2010;
  • [Show abstract] [Hide abstract]
    ABSTRACT: DoS / DDoS(Distributed Denial of Service) attacks deny regular, internet services accessed by legitimate users, either by blocking the services completely, or by disturbing it completely, so as to cause customer baulking. Several traceback schemes are available to mitigate these attacks. The simulation approach also can be used to test the performing effects of different marking schemes in large-scale DDoS attacks. Based on the simulation and evaluation results, more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed. DGT8, directional geographical trackback scheme, with 8 directions is one of them. Having a limited set of 8 directions, DGT8 may not work for routers with more than 8 interfaces. In this paper, we propose M-DGT i.e DGT 16, a 16 directional geographical traceback scheme having all the advantages of DGT. The 16 directions, though not having exactly equal interface, have nearly equal measures, and are identified using a novel scheme of Segment Direction Ratios (SDR). The SDR concept and the associated marking scheme allow the victim to defend against DDoS attacks independent of its ISP and also the generalization to DGT2n, having 2n directions (n>4).
    Information and Communication Technologies - International Conference, ICT 2010, Kochi, Kerala, India, September 7-9, 2010. Proceedings; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Mobile Ad-hoc networks are self-organizing and self-configuring multihop wireless networks where, the structure of the network changes dynamically. This is mainly due to the mobility of nodes. The Nodes in the network not only acts as hosts but also as routers that route data to or from other nodes in network. In mobile ad-hoc networks a routing procedure is always needed to find a path so as to forward the packets appropriately between the source and the destination. The main aim of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an efficient communication path between any two nodes with minimum routing overhead and bandwidth consumption. The design problem of such a routing protocol is not simple since an ad hoc environment introduces new challenges that are not present in fixed networks. A number of routing protocols have been proposed for this purpose like Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination- Sequenced Distance Vector (DSDV). In this paper, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV.
    International Journal of Computer Science Issues. 01/2010;
  • Source
    S. Karthik, R.M. Bhavadharini, V.P. Arunachalam
    [Show abstract] [Hide abstract]
    ABSTRACT: Denial of Service (DoS) attacks constitutes one of the major threats and among the hardest security problems in today's Internet. Of particular concern are Distributed Denial of Service (DDoS) attacks, whose impact can be proportionally severe. With little or no advance warning, a DDoS attack can easily exhaust the computing and communication resources of its victim within a short period of time. Because of the seriousness of the problem many defense mechanisms have been proposed to combat these attacks. This paper aims to provide an understanding of the existing attack methods, tools and defense mechanisms, so that a better understanding of DDoS attacks can be achieved. The goal of the paper is to simulate an environment by extending NS2, setting attacking topology and traffic, which can be used to evaluate and compare the methods of DDoS attacks and tools. Based on the simulation and evaluation results, more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed.
    Computing, Communication and Networking, 2008. ICCCn 2008. International Conference on; 01/2009
  • S Karthik, V.P.Arunachalam, T.Ravichandran
    [Show abstract] [Hide abstract]
    ABSTRACT: An important and challenging problem is that of tracing DOS/DDOS attack source. Among many IP Traceback schemes, a recent development is DGT (Directed Geographical Traceback). Though multidirectional two dimensional DGT schemes are available, in the real scenario, three dimensional, Multidirectional DGT has potential applications. The direction ratio algorithm[DRA] has the limitation of the impossibility of ensuring sufficient unused space in the packet header for the complete DRL (Direction Ratio List) especially when the length of the path is not known apriori. In this paper that limitation is overcome using DRSA(Direction Ratio Sampling Algorithm) which works well for Three dimensional, Multi-Directional, Geographical IP traceback. This approach enables the attack path reconstruction easily possible. In conclusion, DRSA is a robust scheme of attack path reconstruction in geographical traceback.
    International Journal of Computer Science and Security. 01/2009;
  • Source
    Karthik.S, Dr.V.P.Arunachalam, Dr.T.Ravichandran
    [Show abstract] [Hide abstract]
    ABSTRACT: An important and challenging problem is that of tracing DOS/DDOS attack source. Among many IP Traceback schemes, a recent development is DGT (Directed Geographical Traceback). Though multidirectional two dimensional DGT schemes are available, in the real scenario, three dimensional, Multidirectional DGT has potential applications. The direction ratio algorithm[DRA] has the limitation of the impossibility of ensuring sufficient unused space in the packet header for the complete DRL (Direction Ratio List) especially when the length of the path is not known apriori. In this paper that limitation is overcome using DRSA(Direction Ratio Sampling Algorithm) which works well for Three dimensional, Multi-Directional, Geographical IP traceback. This approach enables the attack path reconstruction easily possible. In conclusion, DRSA is a robust scheme of attack path reconstruction in geographical traceback.
    International Journal of Computer Science and Security. 01/2009;
  • Karthik S, Arunachalam V.P, Ravichandran T
    [Show abstract] [Hide abstract]
    ABSTRACT: Problem Statement: Denial of Service/Distributed Denial of Service (DoS/DDoS) attacks deny regular, internet services from being accessed by legitimate users, either by blocking the servicescompletely, or by disturbing it completely, so as to cause customer baulking. Approach: Several traceback schemes were available to mitigate these attacks. Directional geographical traceback8(DGT8), directional geographical trackback scheme, with 8 directions was one of them. Having a limited set of 8 directions, DGT8 may not work for routers with more than 8 interfaces. In this study, we had proposed Multi-DGT (DGT-16), a 16 directional geographical traceback scheme having all the advantages of DGT. The 16 directions, though not having exactly equal interface, had nearly equal measures and were identified using a novel scheme of Segment Direction Ratios (SDR). Results: The scheme of DGT16 SDR in directions D1-D16 in quadrant I-IV and DGT32 SDR in directions D1-D9in quadrant I were examined. Conclusion: The implementation of DGT16, when a packet arrives at the victim, the geographical location of the attack router can be obtained from the data in the SDR subfields, regardless of the source IP address which may be incorrect or compromised.
    Journal of Computer Science. 01/2008;
  • Source
    S Nandagopal, V P Arunachalam, S Karthik
    [Show abstract] [Hide abstract]
    ABSTRACT: Aim: To address the problem of inter-transaction association rule mining, where the frequent occurrence of a large number of items results in a combinatorial explosion that limits the practical application of the existing mining algorithms. Methodology: We propose an efficient algorithm called IAR Miner (Inter-transaction Association Rule Miner), for mining inter-transaction itemsets. Our proposed algorithm consists of two phases. First, we scan the database once to find the frequent items. For each frequent item found, the IAR Miner converts the original transaction database into a set of domain attributes, called a dataset. Then, it enumerates inter-transaction itemsets using an Itemset-Dataset tree, called an ID-tree. By using the ID-tree and datasets to mine inter-transaction itemsets, the IAR Miner can embed effective pruning strategies to avoid costly candidate generation and repeated support counting. Results: Our proposed algorithm can efficiently mine inter-transaction patterns. The performance study on the synthetic datasets shows that the IAR Miner algorithm is more efficient than the EH-Apriori, FITI, ClosedPROWL and ITP-Miner algorithms in most cases. Conclusion: The IAR Miner algorithm can efficiently mine the inter-transaction patterns. In the future work, we will address a number of research issues related to the IAR Miner algorithm.
  • Source
    S. Karthik, V. P. Arunachalam, T. Ravichandran
    [Show abstract] [Hide abstract]
    ABSTRACT: Summary Distributed denial-of-service (DDoS) is a rapidly growing problem. The multitude and variety of both the attacks and the defense approaches is overwhelming. IP traceback - the ability to trace IP packets from source to destination - is a significant step toward identifying and, thus, stopping, attackers. The IP traceback is an important mechanism in defending against distributed denial- of-service (DDoS) attacks. This paper constructs a simulation environment via extending ns2, setting attacking topology and traffic, which can be used to evaluate and compare the effectiveness of different traceback schemes. A comparison among some of the Packet Marking schemes is presented with several metrics, including the received packet number required for reconstructing the attacking path, computation complexity and false positive etc. The simulation approach also can be used to test the performing effects of different marking schemes in large-scale DDoS attacks. Based on the simulation and evaluation results, more efficient and effective algorithms, techniques and procedures to combat these attacks may be developed.