The Experts below are selected from a list of 70644 Experts worldwide ranked by ideXlab platform

V Sankaranarayanan - One of the best experts on this subject based on the ideXlab platform.

  • prevention of co operative black hole attack in manet
    Journal of Networks, 2008
    Co-Authors: Latha Tamilselvan, V Sankaranarayanan
    Abstract:

    A mobile ad hoc Network (MANET) is an autonomous Network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary Network Functionality. One of the principal routing protocols used in Ad hoc Networks is AODV (Ad hoc On demand Distance Vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called ‘Black Hole’ attack In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability it is proposed to wait and check the replies from all the neighboring nodes to find a safe route. Our approach to combat the Black hole attack is to make use of a ‘Fidelity Table’ wherein every participating node will be assigned a fidelity level that acts as a measure of reliability of that node. In case the level of any node drops to 0, it is considered to be a malicious node, termed as a ‘Black hole’ and is eliminated. Computer simulation using GLOMOSIM shows that our protocol provides better security and also better performance in terms of packet delivery than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead.

  • prevention of co operative black hole attack in manet
    Journal of Networks, 2008
    Co-Authors: Latha Tamilselvan, V Sankaranarayanan
    Abstract:

    A mobile ad hoc Network (MANET) is an autonomous Network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary Network Functionality. One of the principal routing protocols used in Ad hoc Networks is AODV (Ad hoc On demand Distance Vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called ‘Black Hole’ attack In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability it is proposed to wait and check the replies from all the neighboring nodes to find a safe route. Our approach to combat the Black hole attack is to make use of a ‘Fidelity Table’ wherein every participating node will be assigned a fidelity level that acts as a measure of reliability of that node. In case the level of any node drops to 0, it is considered to be a malicious node, termed as a ‘Black hole’ and is eliminated. Computer simulation using GLOMOSIM shows that our protocol provides better security and also better performance in terms of packet delivery than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead.

Rajkumar Buyya - One of the best experts on this subject based on the ideXlab platform.

  • software defined security by contract for blockchain enabled mud aware industrial iot edge Networks
    IEEE Transactions on Industrial Informatics, 2021
    Co-Authors: Prabhakar Krishnan, Kurunandan Jain, Krishnashree Achuthan, Rajkumar Buyya
    Abstract:

    To ensure the proper functioning and performance of Industrial grade IoT devices (IIoT) in Industry 4.0 Networks, it is critical to identify the capabilities and malfunctions of their component devices (e.g., sensors, actuators, and controllers) and detect potential misbehavior arising due to cyber-attacks, and misconfiguration. We envision future IoT devices embed behavioral profiles through Security-by-Contract (SxC) that are easy to validate and verify against Network security policies; manufacturers to provide Manufacturer Usage Description (MUD) profiles as a manifest for the devices to signal to the Network what sort of access and Network Functionality they require to properly function. We design authentication in the IoT onboarding process, employ blockchains to a verifiable and immutable repository to store this Network manifests, that are signed and verifiable with SxC based smart contracts by the device manufacturer, or industry authority. The integrated framework combines Blockchains and SxC security contracts, MUD-based behavioral fingerprinting, and Software-Defined-Networking (SDN) for managing the security of IIoT ecosystems. Finally, the proposed scheme is validated in a simulated IoT environment on various performance parameters.

  • latency aware virtualized Network function provisioning for distributed edge clouds
    Journal of Systems and Software, 2019
    Co-Authors: Jungmin Son, Rajkumar Buyya
    Abstract:

    Abstract The emergence of Network Function Virtualization (NFV) enabled decoupling Network Functionality from dedicated hardware and placing them upon generic computing resources. Moreover, the introduction of edge computing paradigm which utilized the resources at the Network edges brings reduced end-to-end latency. With these technologies, Virtualized Network Functions (VNFs) can be placed in anywhere either in the central clouds to utilize more resources or in the Network edges to reduce the end-to-end latency. In this work, we propose a dynamic resource provisioning algorithm for VNFs to utilize both edge and cloud resources. Adapting to dynamically changing Network volumes, the algorithm automatically allocates resources in both the edge and the cloud for VNFs. The algorithm considers the latency requirement of different applications in the service function chain, which allows the latency-sensitive applications to reduce the end-to-end Network delay by utilizing edge resources over the cloud. We evaluate our algorithm in the simulation environment with large-scale web application workloads and compare with the state-of-the-art baseline algorithm. The result shows that the proposed algorithm reduces the end-to-end response time by processing 77.9% more packets in the edge nodes compared to the application non-aware algorithm.

Kirk Webb - One of the best experts on this subject based on the ideXlab platform.

  • SMORE: software-defined Networking mobile offloading architecture
    Proceedings of the 4th, 2014
    Co-Authors: Junguk Cho, Robert Ricci, Binh Nguyen, Arijit Banerjee, Jacobus Van Der Merwe, Kirk Webb
    Abstract:

    We present our Software-defined Network Mobile Offloading aR-chitecturE (SMORE). SMORE realizes traffic offloading in mobile Networks without requiring any changes to the Functionality of ex-isting mobile Network nodes. At the same time, it is fully aware of mobile Network Functionality, including mobility.

Reus Bernhard - One of the best experts on this subject based on the ideXlab platform.

  • Towards model checking real-world software-defined Networks
    'Springer Science and Business Media LLC', 2020
    Co-Authors: Klimis Vassilis, Parisis George, Reus Bernhard
    Abstract:

    In software-defined Networks (SDN), a controller program is in charge of deploying diverse Network Functionality across a large number of switches, but this comes at a great risk: deploying buggy controller code could result in Network and service disruption and security loopholes. The automatic detection of bugs or, even better, verification of their absence is thus most desirable, yet the size of the Network and the complexity of the controller makes this a challenging undertaking. In this paper, we propose MOCS, a highly expressive, optimised SDN model that allows capturing subtle real-world bugs, in a reasonable amount of time. This is achieved by (1) analysing the model for possible partial order reductions, (2) statically pre-computing packet equivalence classes and (3) indexing packets and rules that exist in the model. We demonstrate its superiority compared to the state of the art in terms of expressivity, by providing examples of realistic bugs that a prototype implementation of MOCS in Uppaal caught, and performance/scalability, by running examples on various sizes of Network topologies, highlighting the importance of our abstractions and optimisations

  • Model checking software-defined Networks with flow entries that time out
    IEEE digital library, 2020
    Co-Authors: Klimis Vasileios, Parisis George, Reus Bernhard
    Abstract:

    Software-defined Networking (SDN) enables advanced operation and management of Network deployments through (virtually) centralised, programmable controllers, which deploy Network Functionality by installing rules in the flow tables of Network switches. Although this is a powerful abstraction, buggy controller Functionality could lead to severe service disruption and security loopholes, motivating the need for (semi-)automated tools to find, or even verify absence of, bugs. Model checking SDNs has been proposed in the literature, but none of the existing approaches can support dynamic Network deployments, where flow entries expire due to timeouts. This is necessary for automatically refreshing (and eliminating stale) state in the Network (termed as soft-state in the Network protocol design nomenclature), which is important for scaling up applications or recovering from failures. In this paper, we extend our model (MoCS) to deal with timeouts of flow table entries, thus supporting soft state in the Network. Optimisations are proposed that are tailored to this extension. We evaluate the performance of the proposed model in UPPAAL using a load balancer and firewall in Network topologies of varying siz

  • Model Checking Software-Defined Networks with Flow Entries that Time Out
    2020
    Co-Authors: Klimis Vasileios, Parisis George, Reus Bernhard
    Abstract:

    Software-defined Networking (SDN) enables advanced operation and management of Network deployments through (virtually) centralised, programmable controllers, which deploy Network Functionality by installing rules in the flow tables of Network switches. Although this is a powerful abstraction, buggy controller Functionality could lead to severe service disruption and security loopholes, motivating the need for (semi-)automated tools to find, or even verify absence of, bugs. Model checking SDNs has been proposed in the literature, but none of the existing approaches can support dynamic Network deployments, where flow entries expire due to timeouts. This is necessary for automatically refreshing (and eliminating stale) state in the Network (termed as soft-state in the Network protocol design nomenclature), which is important for scaling up applications or recovering from failures. In this paper, we extend our model (MoCS) to deal with timeouts of flow table entries, thus supporting soft state in the Network. Optimisations are proposed that are tailored to this extension. We evaluate the performance of the proposed model in UPPAAL using a load balancer and firewall in Network topologies of varying size

  • Towards Model Checking Real-World Software-Defined Networks (version with appendix)
    2020
    Co-Authors: Klimis Vasileios, Parisis George, Reus Bernhard
    Abstract:

    In software-defined Networks (SDN), a controller program is in charge of deploying diverse Network Functionality across a large number of switches, but this comes at a great risk: deploying buggy controller code could result in Network and service disruption and security loopholes. The automatic detection of bugs or, even better, verification of their absence is thus most desirable, yet the size of the Network and the complexity of the controller makes this a challenging undertaking. In this paper we propose MOCS, a highly expressive, optimised SDN model that allows capturing subtle real-world bugs, in a reasonable amount of time. This is achieved by (1) analysing the model for possible partial order reductions, (2) statically pre-computing packet equivalence classes and (3) indexing packets and rules that exist in the model. We demonstrate its superiority compared to the state of the art in terms of expressivity, by providing examples of realistic bugs that a prototype implementation of MOCS in UPPAAL caught, and performance/scalability, by running examples on various sizes of Network topologies, highlighting the importance of our abstractions and optimisations

Latha Tamilselvan - One of the best experts on this subject based on the ideXlab platform.

  • prevention of co operative black hole attack in manet
    Journal of Networks, 2008
    Co-Authors: Latha Tamilselvan, V Sankaranarayanan
    Abstract:

    A mobile ad hoc Network (MANET) is an autonomous Network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary Network Functionality. One of the principal routing protocols used in Ad hoc Networks is AODV (Ad hoc On demand Distance Vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called ‘Black Hole’ attack In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability it is proposed to wait and check the replies from all the neighboring nodes to find a safe route. Our approach to combat the Black hole attack is to make use of a ‘Fidelity Table’ wherein every participating node will be assigned a fidelity level that acts as a measure of reliability of that node. In case the level of any node drops to 0, it is considered to be a malicious node, termed as a ‘Black hole’ and is eliminated. Computer simulation using GLOMOSIM shows that our protocol provides better security and also better performance in terms of packet delivery than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead.

  • prevention of co operative black hole attack in manet
    Journal of Networks, 2008
    Co-Authors: Latha Tamilselvan, V Sankaranarayanan
    Abstract:

    A mobile ad hoc Network (MANET) is an autonomous Network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary Network Functionality. One of the principal routing protocols used in Ad hoc Networks is AODV (Ad hoc On demand Distance Vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called ‘Black Hole’ attack In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability it is proposed to wait and check the replies from all the neighboring nodes to find a safe route. Our approach to combat the Black hole attack is to make use of a ‘Fidelity Table’ wherein every participating node will be assigned a fidelity level that acts as a measure of reliability of that node. In case the level of any node drops to 0, it is considered to be a malicious node, termed as a ‘Black hole’ and is eliminated. Computer simulation using GLOMOSIM shows that our protocol provides better security and also better performance in terms of packet delivery than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead.