Amrit Lal Sangal

Traceback techniques against DDOS attacks: A comprehensive review

Distributed denial-of-service (DDoS) is a rapidly growing problem. In a typical DDOS attacks a large number of compromised hosts (Zombies) are amassed to send useless packets to jam the victim, or its Internet connection or both. The problem of identifying the attack sources is one of the hardest threats in internet security due to the similarity between the legitimate and illegitimate traffic. Firstly, it is important characteristics of the DDOS attacks that they hide their identities/origins (IP Spoofing). Secondly, the stateless nature of the IP routing where routers normally know only the next hop for the forwarding of packets rather than the complete end to end route taken by each packet make IP traceback difficult. IP traceback (the ability to trace IP packets from source to destination) is a significant step toward identifying and, thus, stopping, attackers. This Review paper evaluates and describes the effectiveness of different existing traceback methods. These methods are based on the enhanced router functions or modifications of the current protocols. Advantages and Disadvantages have also been described in existing techniques to carry out research in this problem.

Characterizing flash events and distributed denial-of-service attacks: an empirical investigation

In the information age where Internet is the most important means of delivery of plethora of services, distributed denial-of-service DDoS attacks have emerged as one of the most serious threat. Strategic, security, social, and financial implications of these attacks have ceaselessly alarmed the entire cyber community. To obviate a DDoS attack and mitigate its impact, there is an irrevocable prerequisite to accurately detect them promptly. An inherent challenge in addressing this issue is to efficiently distinguish these attacks from characteristically analogous flash events FEs which are bona fide occurrences generated by legitimate users. Most of the studies have focused on finding out the unique characteristics of DDoS attacks in isolation, with the peril of false alarms heuristically. To preclude this, it is pertinent to fundamentally focus on identifying the unique characteristics of FE vis-a-vis DDoS attacks ab initio which has been the basis of this work. The aim of this paper is to formulate the taxonomy of FEs and compare the characteristics of FEs and DDoS attacks to segregate these using several empirical metrics. Real and emulation datasets have been used to validate the characteristics of both. The extensive analysis in this study establishes that there are numerous technical dissimilarities that can be exploited to separate these similar looking events. Copyright

Considerations and Open Issues in Delay Tolerant Network’S (DTNs) Security

Delay Tolerant Network (DTN) addresses challenges of providing end-to-end service where end-to-end data forwarding paths may not exist. Security and privacy are crucial to the wide deployments of DTN. Without security and privacy guarantees, people are reluctant to accept such a new network paradigm. To address the security and privacy issues in DTNs, we in this paper have discussed the various open issues and challenges which need to be addressed to evolve the secure DTNs.

Performance Analysis of DSR, AODV Routing Protocols based on Wormhole Attack in Mobile Ad-hoc Network

ad-hoc network are able work without any existing infrastructure. MANET is a self configure network connected by wireless links. Mobile ad-hoc network uses temporary network which is able to work without any centralize administration or stand alone infrastructure. In mobile ad-hoc network each device move in any direction without any restriction so it changes it links to often with other devices present in same network. Mobility of mobile device anywhere in the network without any centralize administration makes it difficult to manage routing. In mobile ad-hoc network each device need to forward traffic that is not related to its own use and therefore each device work as a router. In this paper we have compared the performance of two On-Demand MANET routing protocol AODV and DSR by using random waypoint mobility model and changing the node density with varying number of source node. DSR and AODV both protocol uses On-Demand route discovery concept but internal mechanism which they use to find the route is significantly different for both protocol. We have analyzed the performance of protocols for low and high node density (50 and 100 nodes) on a 750m*750m area with varying source node and random waypoint mobility model. Simulation with random waypoint mobility model has been carried out by using Qualnet 5.0.2 Simulator. The metrics used for performance evaluation are packet Delivery fraction, Average End-to-End Delay, Average Jitter, and number of packet dropped for buffer overflow.

Performance Comparison of RAPID, Epidemic and Prophet Routing Protocols for Delay Tolerant Networks

—These Opportunistic Networks or DTN are the class of networks where the nodes do not have contemporaneous connections, but intermittent connections. In DTN, the main characteristic of packet delivery is large end-to-end path latency and a DTN routing protocols has to cope with frequent disconnections. The lifetime of packet would have large effect on the performance of routing protocols in DTN as the delay is large in DTN. In this paper we have investigated the performance of three different routing protocols namely Epidemic, Prophet and RAPID against varying message TTL. For the simulation we have used Opportunistic Network Environment (ONE) Simulator. The performance is analyzed on three metrics: Delivery Probability, Overhead Ratio, and Average Latency. From the results obtained from the simulation it is analyzed that the RAPID routing protocol gives the best performance in the considered scenario and simulation setting.

Analysis of different churn models in chord based overlay networks

Structured Overlays are emerged as a suitable infrastructure for building distributed and self organizing architecture. They are used for a range of applications such as resilient routing networks, distributed storage and backup system and distributed spam filters etc. However, due to their fixed architecture their performance is greatly affected by continuous process of nodes joining or leaving the network (churn). So, in order to design an effective overlay application, we should evaluate its performance keeping node dynamism in mind. To model node dynamism the simulation environments provides different churn generators. The goal of this paper is to study these churn generators to understand their churn generation trends, which will help the researchers in selecting appropriate churn generator for testing their overlay application in OverSim simulation environment. Specifically, Lifetime, Pareto and Random churn generators are evaluated to provide a comparative analysis. This simulation study concludes that the lifetime churn (based on weibull distribution) provides highest node dynamism and thus have significant impact on the overlays performance. This study also emphasis on the fact that churn rate is not solely dependent on the selection of churn generator but we can increase or decrease the churn rate by varying mean life time parameter in lifetime and pareto churn generation and target mobility delay in random churn generation.

Modeling and simulation of DDoS attack using Omnet

Distributed Denial of Service (DDoS) attack continues to evolve over the past two decades. Its easy accomplishment, hard tracing and disastrous effects make it a popular choice among the attackers community. The goal of DDoS attack is to overwhelm the targets resources to such an extent that it becomes incapable to serve the legitimate client. Till date, researchers have proposed many solutions to detect and mitigate DDoS attack, but a very little attention is given to impact analysis of attack. The purpose of this paper is to study the impact of DDoS attack with respect to two parameters: attack intensity and buffer size. In this paper, we model and analyze different DDoS attack scenario using different attack rate and different buffer size of network components. The results in this paper indicate that performance of WebServer degrades with increase in attack intensity and low buffer size.

A Persistent Structured Hierarchical Overlay Network to Counter Intentional Churn Attack

The increased use of structured overlay network for a variety of applications has attracted a lot of attention from both research community and attackers. However, the structural constraints, open nature anybody can join and anybody may leave, and unreliability of its participant nodes significantly affect the performance of these applications and make it vulnerable to a variety of attacks such as eclipse, Sybil, and churn. One attack to compromise the service availability in overlay network is intentional churn join/leave attack, where a large number of malicious users will join and leave the overlay network so frequently that the entire structure collapses and becomes unavailable. The focus of this paper is to provide a new robust, efficient, and scalable hierarchical overlay architecture that will counter these attacks by providing a structure that can accommodate the fleeting behaviour of nodes without causing much structural inconsistencies. The performance evaluation showed that the proposed architecture has more failure resilience and self-organization as compared to chord based architecture. Experimental results have demonstrated that the effect of failures on an overlay is proportional to the size of failure.

Quantitative Measurement and Comparison of Effects of Various Search Engine Optimization Parameters on Alexa Traffic Rank

are currently 2 billion users on the internet which is roughly 28% of the global human population. A global market of 2 billion is usually a significant motivator for companies to seriously consider internet branding and marketing. According to Pew Research, people are relying more and more on Internet search. In fact, approximately 50 percent of web users use search every day and search is second only to e-mail in daily tasks performed by web users. These search page views span everything from shopping, travel, entertainment, research, work, local, socializing, sharing, and more. Consequently search engines are the main sources of traffic. More traffic to a commercial website means more visitors, more customers more sales and so high profit in business. It is desirable to bring as much as possible traffic to a companys website. One should consider using SEO (Search Engine Optimization) to increase the website traffic. Alexa Traffic Rank is the most popular website traffic measurement unit. The paper applies various SEO parameters onto a commercial website http://www.ujjaincity.com/ and measures the change in ATR (Alexa Traffic Rank). The paper is intended to help the webmasters and marketing department of a company in improving the ATR of the companys website. Also the paper suggests the relative effectiveness of the different SEO practices so that it can be decided which practice is feasible as well as profitable. With the help of the paper the webmasters and site owners can determine which practices provide good ROI (Return On Investment). The paper will guide them to adopt and implement the best practices to improve the ATR of their website. The improved ATR will lead to more profit in online business.

Performance Analysis of Predictive Stabilization for Churn Handling in Structured Overlay Networks

The structured overlay networks are self-organized, open networks with specific structural constraints to ensure resource or service discovery in a small number of probabilistically bounded networking hops. The main challenge to ensure the viability of the structured overlay networks for the deployment of highly scalable applications is to maintain the structure of these overlay networks in the presence of dynamic participants. The state of the art structured overlay networks employs a costly periodic stabilization mechanism for the maintenance of overlay structure and per node routing tables in the dynamic environments. However, many applications report the predictable dynamic behavior of different overlay nodes driven by underlying users online behavior and its dependency on many factors such as, geographical position, time of the day, day of the week etc. This paper utilizes these characteristics for the implementation of an intelligent predictive stabilization mechanism for the structure maintenance and routing table updation in the chord based overlay networks. In this paper, we focus on the implementation and performance comparison of the Hidden Markov Model based and Neuro-Fuzzy based predictive stabilization techniques. The OverSim based simulation results clearly present that our proposed predictive stabilization techniques outperforms the existing periodic stabilization techniques in terms of better lookup success ratio and less maintenance overhead. Experimental results also demonstrate the suitability of Neuro-Fuzzy model a compared to HMM based prediction model for the failure prediction of dynamic nodes.