Browsing by Author "Haribabu, K"

Now showing 1 - 20 of 31

Achieving waypoint enforcement in multi-VLAN hybrid SDN
(IEEE, 2018) Haribabu, K; Bhatia, Ashutosh
The waypoint enforcement in a network can be seen as the act of diverting the path of packets flowing in the network towards a predefined checkpoint to gain a higher degree of control over the network. Most of the existing solutions which perform waypoint enforcement in hybrid-SDN either disturb the existing VLAN configurations or possess certain limitation in terms of placement of SDN switches in the network. In this paper, we address the problem of achieving waypoint enforcement in a multi-VLAN hybrid software defined network (hybrid-SDN), which does not have these limitations. In particular, the proposed method uses the concept of gratuitous ARP (Address Resolution Protocol) to poison the ARP table of all the hosts in the network to divert the traffic packet towards an SDN switch.
Adaptive lookup for unstructured peer-to-peer overlays
(IEEE, 2008) Haribabu, K
Scalability and efficient global search in unstructured peer-to-peer overlays have been extensively studied in the literature. The global search comes at the expense of local interactions between peers. Most of the unstructured peer-to-peer overlays do not provide any performance guarantee. In this work we propose a novel Quality of Service enabled lookup for unstructured peer-to-peer overlays that will allow the userpsilas query to traverse only those overlay links which satisfy the given constraints. Additionally, it also improves the scalability by judiciously using the overlay resources. Our approach selectively forwards the queries using QoS metrics like latency, bandwidth, and overlay link status so as to ensure improved performance in a scenario where the degree of peer joins and leaves are high. User is given only those results which can be downloaded with the given constraints. Also, the protocol aims at minimizing the message overhead over the overlay network.
Addressing Challenges in Browser Based P2P Content Sharing Framework Using WebRTC
(IEEE, 2016) Haribabu, K; Sinha, Yash
Most of the content sharing applications use the client/server model in which all of group managements are done by the server and this sometimes becomes a communication bottleneck. Installing specialized software for different purposes such as file sharing, video conferencing etc., becomes a barrier for the user. Recent technologies like NodeJs and Socket.io have fostered new ideas the ways web browsers can be used. Moreover, the emerging standards of WebRTC open up new paradigm of direct communication channel between web browsers without relaying the data through a web server. But there are certain issues such as lack of full-fledged threading/concurrency support in the JavaScript language, reliance on synchronous loading etc. that restricts modern day browsers to take full advantage of current multiprocessing capabilities. Although, on one hand there are advantages of using web browsers, such as no requirement of specialized software, benefits of emerging technologies etc., the aforementioned issues pose challenges in implementation in certain areas. In this paper, we have tried to couple the benefits of peer-to-peer (P2P) architecture (elimination of centralized dependency, better scalability, shareability etc.) along with the advantages of recent web technologies (NodeJs, WebRTC etc.) by designing and implementing a browser based P2P content sharing framework. We have addressed the aforementioned challenges of a browser based P2P architecture by providing a mechanism to exchange messages asynchronously and facilitating new peer joins via existing peers in the network, thus reducing the dependency on bootstrap server. Our prototypical implementation demonstrates the feasibility, efficiency and scalability of this lightweight framework, on the top of which a variety of applications can be added as a layer of functionality.
Analysis and Performance Evaluation of Different Methods to Achieve Way-Point Enforcement in Hybrid SDN
(Springer, 2020-03) Haribabu, K; Bhatia, Ashutosh
Software Defined Networking (SDN) is a new paradigm that gives central control over distributed SDN-enabled switches. SDN is begin adapted very rapidly to gain the advantages of centralized programmable control over the network. But it is difficult to go for a green-field deployment of SDN due to several reasons. It requires a huge budget to install SDN network infrastructure. The deployment of SDN devices will take some time, due to which the network can go down. The safe option is to go for partial deployment, where the SDN devices can be installed incrementally in the traditional network. Over the last few years, the research community brings their attention to hybrid SDN networks. To gain SDN control over the network traffic, it has to go through at least one SDN switch. There exist a few solutions which enforce the traffic to go through the SDN switch. In this paper, our aim is to analyze and evaluate the performance of existing methods to achieve way-point enforcement in hybrid SDN networks in terms of average path length, and percentage of way-point enforcement achieved.
Analysis of Floating Index Caching Technique for P2P Overlay Index Propagation
(ACM Digital Library, 2015) Haribabu, K
The paper proposes an indexing scheme known as Floating Index Caching. In Floating Index caching, queries carry a summarized index of contents of the peers that are on its way. Each node snoops on the queries passing through it. Queries are sent in the network using ether flooding or random-walk methods. When a query arrives at a node, indexes can be further added to the query or existing indexes replaced with new indexes. In this paper, we classify propagation schemes as depth-wise and breadth-wise, combined with flooding and random-walk methods. Through experimental evaluations, we found that Floating Index Caching with random walkers has the best returns as far as index dissemination is considered. Breadth-wise spreading of indexes through random-walk utilized 54% of the query traffic effectively to spread the indexes. This method has spread indexes of 77% of the nodes onto more than 50% of the network.
A Browser-Based Distributed Framework for Content Sharing and Student Collaboration
(Springer, 2017-08) Haribabu, K; Sinha, Yash
The utilization of the networks in education system has become increasingly widespread in recent years. WebRTC has been one of the hottest topics recently when it comes to Web technologies for distributed systems as it enables peer-to-peer (P2P) connectivity between machines with higher reliability and better scalability without the overhead of resource management. In this paper, we propose a browser based, asynchronous framework of a P2P network using distributed, lookup protocol (Chord), NodeJS and RTCDataChannel; which is scalable and lightweight. The design combines the advantages of P2P networks for better and sophisticated education delivery. The framework will facilitate students to share course content and discuss with fellow students without requiring any centralized infrastructure support.
Decision Tree Based IoT Attack Detection in Programmable Data Plane Using P4 Language
(Springer, 2022-03) Haribabu, K
The Internet of Things (IoT) is a massively growing domain. With this the threats are also growing. Software Defined Networking (SDNs) is an emerging architecture which separates the control plane and the data plane of a network. It is being put to practice in networks around the world to mitigate issues. With growing heterogeneity in IoT protocols, it is cumbersome and costly to use SDNs. The Programming Protocol-independent Packet Processors (P4) is an open source, domain-specific programming language for network devices, specifying how data plane devices (switches, routers, NICs, filters, etc.) process packets. To overcome the challenges of IoT, P4 language is ideal as it provides flexibility for programming the data plane. We propose a light and fast approach to use decision tree to detect attacks from network traces and form small header fields to implement high accuracy attack detection in the programmable data plane using the P4 language.
Detecting Sybils in Peer-to-Peer File Replication Systems
(Springer, 2009) Haribabu, K
The test of a peer-to-peer file sharing network is how efficiently the objects are discovered and retrieved. One of the most important factors that contribute towards this is optimal replication of the objects across the network. One of the security threats to replication model is Sybil attack. In this paper we propose an approach that aims at detecting sybil identities in peer-to-peer file sharing networks. The sybils can corrupt, hide or destroy the replicas in file sharing network. This approach makes use of the fact that sybil doesn’t scale its storage to the factor of its identities. The approach safeguards the availability and accessibility of objects in a peer-to-peer network from sybil attack. Experimental evaluations have shown that our approach works very efficiently in detecting sybils. More than 50% of the sybils were detected in first few seconds of the simulation and loss or damage of objects is reduced to less than .0001%.
Detecting Sybils in Peer-to-Peer Overlays Using Neural Networks and CAPTCHAs
(IEEE, 2010) Haribabu, K
Over the years, peer-to-peer networks have emerged as one of the most popular file sharing medium over The Internet, capable of providing user anonymity to the clients if desired. However, modern P2P networks suffer from the bane of malicious entities we refer to as Sybils, which forge multiple identities to negatively influence or even control the entire network. This paper suggests a novel solution to eradicate the Sybil threat using a unique combination of neural networks and CAPTCHA. We capture common behavioral patterns of participating Sybil entities, in terms of certain quantitative variables, and ascertain their true identities by feeding these variables to a neural network, followed by sending CAPTCHA to the alleged entity ensuring a very high success rate in identifying malicious entities in the network. Network simulations have shown the proposed approach to be highly effective in countering the Sybil threat by giving a high degree of accuracy in detecting the malicious nodes.
Detecting Sybils in Peer-to-Peer Overlays Using Psychometric Analysis Methods
(IEEE, 2011) Haribabu, K
Peer to peer networks are fast becoming the most popular file sharing media, guaranteeing complete user anonymity to the clients. However, modern P2P networks suffer from Sybil attacks, which forge multiple identities to influence the global decisions in the network. This paper suggests a novel solution to minimize Sybils influence using unique combination of Psychometric Tests, Color Tests & CAPTCHAs. Our survey has shown that the proposed approach is promising in detecting not just Sybils but Sybil groups. The results have shown that 30-50% of Sybil groups are detected.
An Efficient Method to Collect Statistics in SDN Using Curvature Based Sampling
(IEEE, 2021) Haribabu, K; Bhatia, Ashutosh
Network management involves measurements and control. Software Defined Networking (SDN) provides a higher level of control on network devices. In SDN, the controller can poll the statistics at different granularity with a constant or dynamic polling rate. There is always a trade-off between the accuracy and polling overhead. This paper proposes a new method for dynamic polling, which provides the best trade-off between the accuracy and polling overhead. We use curvature based sampling as the basis for our method and compute the change in the rate of change to decide the polling frequency. We use real traffic traces for the experiments. The experimental results demonstrate that the proposed method provides better accuracy compared to MoMon [1] and CeMon [2]. The proposed method achieves 23% accuracy over MoMon [1] and roughly three to four times better accuracy than CeMon
Enhanced Search in Peer-to-Peer Networks Using Fuzzy Logic
(Springer, 2010) Haribabu, K
The efficiency of a Peer-to-Peer file sharing overlay is dependent on the lookup procedure. Huge size of peer-to-peer networks demands a scalable efficient lookup algorithm. In this paper we look at fuzzy logic approach in which we assign probabilities to each node based on the content it has. Lookup is guided by the probabilities. The results show that this algorithm is much better than standard lookup algorithms.
Estimation of End-to-End Available Bandwidth and Link Capacity in SDN
(Springer, 2017-12) Haribabu, K
The traditional networks, with the control and data plane integrated into the same network devices, do not provide a global view of the network performance like degree of congestion, bandwidth utilization, etc. Software defined network (SDN) is an approach towards this problem which separates the control plane of the switch from its data plane and provide a centralized control plane so as to get a global view of the network performance and thus make decisions of how to regulate flows. In SDN, network monitoring can be achieved more efficiently than traditional networks using OpenFlow statistics. SDN controller can keep track of available bandwidth on each link and thus estimate end-to-end available bandwidth of a path simply by composing individual link bandwidths thus avoiding end-to-end probing. We have made two contributions in this paper: (i) proposed and validated a method to estimate end-to-end available bandwidth on any given path by composing link-wise available bandwidths (ii) proposed a method to measure link capacity using OpenFlow protocol. We compared our results to the ones obtained using the state-of-the-art bandwidth measurement tool, Yaz
Estimation of Raw Packets in SDN
(Springer, 2017-12) Haribabu, K; Sinha, Yash
In SDN based networks, for network management such as monitoring, performance tuning, enforcing security, configurations, calculating QoS metrics etc. a certain fraction of traffic is responsible. It consists of packets for many network protocols such as DHCP, MLD, MDNS, NDP etc. Most of the time these packets are created and absorbed at midway switches. We refer to these as raw packets. Cumulative statistics of sent and received traffic is sent to the controller by OpenFlow compliant switches that includes these raw packets. Although, not part of the data traffic these packets get counted and leads to noise in the measured statistics and thus, hamper the accuracy of methods that depend on these statistics such as calculation of QoS metrics. In this paper, we propose a method to estimate the fraction of the network traffic that consists of raw packets in Software Defined Networks. The number of raw packets transferred depends on the number of switches and hosts in the network and it is a periodic function of time. Through experiments on several network topologies, we have estimated a way to find a cap on the generated raw packets in the network, using spanning tree information about the topology.
Fault Tolerance in Cloud: A Brief Survey
(Springer, 2022-03) Haribabu, K
The Cloud computing environment has seen tremendous growth in terms of enterprises migrating to the cloud. The Cloud computing environment has been characterized by its support to multi-tenancy as well as rapid elasticity. A cloud service provider needs to adhere to service level agreements agreed with its tenants. As cloud infrastructure is composed of heterogeneous, it ought to have faults when different components interact with each other. Fault tolerance is one critical task in order to overcome faults in a timely manner and smooth operations. Through this paper, we present a brief survey of fault tolerance approaches available in the literature for the cloud computing environment. The fault tolerance techniques in literature have been broadly classified into three categories viz. Reactive approaches, proactive approaches, and resilient approaches. Reactive methods try to recover the system after faults. Proactive approaches try to prevent the system from entering in failure state by predicting faults beforehand. Resilient approaches are relatively new in the area of cloud fault tolerance predict faults for dynamically changing environments to prevent failures. Resilient methods are have used machine learning and artificial intelligence as a key factors for predicting faults.
A Framework for OpenFlow-like Policy-based Routing in Hybrid Software Defined Networks
(INC, 2016) Haribabu, K
Software Defined Networks (SDNs) provide a centralized view and allow extensive programmability of the network. They separate the control and data planes opening up immense scope in developing low cost control and management applications to operate the network. Yet, network administrators are ambivalent to revamp their entire network hardware to bring in SDN-compatible switches. This leads to the need for developing models for gradual adaptation of SDN technology. In this paper, we present a framework which allows for policy implementations based on all OpenFlow version 1.4 specified match fields, over legacy Layer 3 devices. This would enable the legacy networks to reap the benefits of SDN in an incremental, controlled and consistent manner.
A Framework to Achieve Full Waypoint Enforcement in Hybrid SDN Networks
(Springer, 2019) Haribabu, K; Bhatia, Ashutosh
Software Defined Networking (SDN) addresses the operational challenges faced in maintaining legacy networks by decoupling the data plane and control plane. Overhauling of the network to replace legacy switches with SDN switches is not economically viable. Incremental deployment of SDN devices is the most promising approach. Hybrid SDN network contains both legacy and SDN devices in a network. One of the challenges in hybrid SDN network is to enforce traffic to go through some of the SDN switches (waypoints) present in the network. There exist a few solutions in the literature to achieve waypoint enforcement, but practically none of them provide full waypoint enforcement. In this paper, we propose a novel framework to achieve full waypoint enforcement. The proposed framework uses virtual IP addresses to divert the complete network traffic towards the SDN switches present in the network. We also provide an analysis of the framework.
GAUR: a method to detect Sybil groups in peer-to-peer overlays
(Inder Science, 2012) Haribabu, K
Sybil attack is an important problem as the peer-to-peer networks grow in size and become prominent means for distributing multimedia. In order to validate the feasibility of using psychometric tests as an approach to detect Sybils in their entirety as Sybil groups, an experiment is conducted by taking the tests on a population of considerable size. Selected people were given multiple questionnaires corresponding to multiple identities in the network. The survey data is analysed using DBSCAN clustering algorithm using several metrics. The results show that 75% of the Sybil groups were detected with 67% completeness.
GlobeSnap: An Efficient Globally Consistent Statistics Collection for Software-Defined Networks
(Springer, 2021-05) Haribabu, K; Bhatia, Ashutosh
Software defined networking (SDN) controller requires crucial statistics like flow-wise statistics from the switches to make decisions related to routing, load balancing, and QoS provisioning. These statistics, when viewed across the switches are likely to be inconsistent if a specific order is not enforced while collecting statistics. Collecting consistent statistics requires coordination among all the participating switches. A few approaches in the literature collect globally consistent statistics of a network in the SDN domain. However, these approaches are not time-efficient, robust, and synchronous for OpenFlow based networks. We propose, GlobeSnap, a time-efficient, robust, and synchronous method to collect globally consistent statistics for OpenFlow networks. GlobeSnap collects consistent statistics for all flows in a single round and is therefore, time-efficient. Moreover, GlobeSnap is robust since it resumes the statistics collection process from where it left in case of interruption. GlobeSnap also provides a near-synchronous snapshot of statistics of the switches traversed by a given flow. We also propose a mechanism to persistently store states in OpenFlow based networks using registers, multiple flow tables, and multiple pipelines. We find that GlobeSnap outperforms the state-of-the-art approaches in consistency evaluation. Further we present two use-cases which are sensitive to inconsistent flow statistics, that is, computing packet loss and identifying bottleneck links, to show the time-efficiency, robustness, and synchronicity of GlobeSnap. GlobeSnap provides 100% consistency in OpenFlow based SDN networks. Whereas the existing methods achieve a maximum of 59.89% consistency.
Indexing through Querying in Unstructured Peer-to-Peer Overlay Networks
(Springer, 2008) Haribabu, K
The efficiency of a Peer-to-Peer file sharing overlay is measured in terms of the scalability and versatility of its object lookup strategy. In these networks peers carry out distributed query relaying to discover the service providers. Existing lookup mechanisms like flooding and random walks in unstructured P2P overlays create huge communication overhead and increased response time. In this work we propose efficient lookup in unstructured peer-to-peer overlay networks using indexing through querying, distributing indices through queries. Our simulation studies show that by our approach more than 97% of the queries are answered in one hop and the rest in few hops thus reducing the network load. Our approach is efficient in worst case scenarios where contents are distributed over thousands of peers and the overlay network condition is highly dynamic.