Department of Computer Science and Information Systems

Permanent URI for this collectionhttp://localhost:4000/handle/123456789/1928

Browse

Author: search.filters.author.Haribabu, K

Search Results

Now showing 1 - 10 of 31
  • No Thumbnail Available
    Item
    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.
  • No Thumbnail Available
    Item
    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.
  • No Thumbnail Available
    Item
    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%.
  • No Thumbnail Available
    Item
    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.
  • No Thumbnail Available
    Item
    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.
  • No Thumbnail Available
    Item
    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.
  • No Thumbnail Available
    Item
    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.
  • No Thumbnail Available
    Item
    Real-time monitoring of network latency in Software Defined Networks
    (IEEE, 2015) Haribabu, K
    Latency in a network is an important parameter that can be utilized by Service providers and end users alike. Delay on a network path is often measured using end-to-end probing packets. When multiple end systems measure end-to-end latency, there are overlaps in their paths. Since end systems do not have this knowledge, it results in redundant work and network overhead. In this paper, we propose a method to measure end-to-end path latency in Software Defined Networks (SDN). This method avoids redundant work and measures latency in real-time. Our proposal is an improvement over the looping technique. We simplified the looping technique by using IP TTL as a counter. In order to avoid duplicate work, latency is measured per link and stored in the controller. End systems may register their flow labels with the SDN controller to receive latency information. For each registered flow, controller composes individual link latencies on that path to compute end-to-end latency. We also propose another approach to measure latency using queue lengths at network switches. This technique removes network overhead. In our simulations, improved looping technique is found to be giving better results with reduced computational and network overhead, while the proposed queue length technique shows comparable results.
  • No Thumbnail Available
    Item
    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.
  • No Thumbnail Available
    Item
    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.