Search results for "NETWORKS"
showing 10 items of 3260 documents
Algorithmic Complexity Vulnerability Analysis of a Stateful Firewall
2016
Algorithmic complexity vulnerabilities are an opportunity for an ad-versary to conduct a sophisticated kind of attack i.e. on network infrastructure services. Such attacks take advantage of worst case time or space complexity of algorithms implemented on devices in their software. In this paper we address potential risks introduced by such algorithmic behavior in computer networks in particular on a stateful firewall. First we introduce the idea and theoretical background for the attack. We then describe in full detail a successfully con-ducted attack which takes advantage of the worst case computational complexi-ty of O(n2) of a hash table data structure used to store active sessions. The …
A TDMA-Based MAC Protocol Supporting Cooperative Communications in Wireless Mesh Networks
2011
This paper proposes a TDMA-based medium access control protocol which enables cooperative communications in multi-hop wireless mesh networks. According to the proposed scheme, each router at the two-hop neighbourhood of each other is allocated to a specific time slot for accommodating either direct or cooperative transmissions in a coordinated manner, controlled by mini-slots which are part of the time slot. Benefiting from the elaborate mini-slot design, channel resources are fairly and efficiently allocated to each router so that no handshake is needed prior to each packet transmission. By providing access priority to cooperative transmission through an optimal relay which is determined b…
Design and Implementation of ForCES Protocol
2017
This paper proposes the design and implementation of the ForCES protocol, specifically FP logical point of the ForCES architecture, which is strictly the communication between the CE (Control Element) and the FE (Forwarding Element). It is a flexible and reprogrammable architecture that is established within the specifications issued and defined by the ForCES working group, and consists of elaboration of a protocol that carries information between both elements. In order to comprobate the correct functioning of the implemented the ForCES protocol, is we provide a network testbed scenario, which consist an application client-server. Each device has equipped with the application which based o…
Computer networks stability independence of the queuing delays
2015
Communication in intelligent computer networks is an indispensible attribute of the dataflow quality in Web traffic. We propose a model that investigates intelligent computer networks stability while specifying its limits. Packet queuing delay affects the performance of the network, and especially its stability. If the network is presented as a dynamic system in block diagram form, we compute a transfer function and determine the quasi-polynomial system. The characteristic polynomial distribution of zeros of complex variable quasi-plane determines the boundaries of the network stability. The approach relies on estimation of the network system's transfer functions and its quasi-polynomial. C…
Endpoint Admission Control with Delay Variation Measurements for QoS in IP Networks.
2002
In this paper we describe a novel Endpoint Admission Control scheme (EAC) for IP telephony. EAC mechanisms are driven by independent measurements taken by the edge nodes on a flow of packets injected in the network to probe the source to destination path. Our scheme is characterized by two fundamental features. First, it does not rely on any additional procedure in internal network routers other than the capability to apply different service priorities to probing and data packets. Second, the connection admission decision is based on the analysis of the probing flow delay variation statistics. Simulation results, which focus on a IP telephony scenario, show that, despite the lack of core ro…
PCP-DV: An End-to end Admission Control Mechanism for IP Telephony
2001
In this paper we describe a novel endpoint admission control mechanism for IP telephony:the PCP-DV which is characterized by two fundamental features. First, it does not rely on any additional procedure in internal network routers other than the capability to apply different service priority to probing and data packets. Second, the triggering mechanism for the connection admission decision is based on the analysis of the delay variation statistics over the probing flow. Numerical results for an IP telephony traffic scenario prove that 99th delay percentiles not greater than few ms per router are guaranteed even in overload conditions.
A Migration Path for the Internet: From Best-Effort to a QoS Capable Infrastructure by Means of Localized Admission Control
2000
Looking back at many proposals appeared on the scene in these years, a fundamental lesson to be learned is that their success or failure is strictly tied to their backward compatibility with existing infrastructures. In this paper, we consider the problem of providing explicit admission control decisions for QoS aware services. We rely the decision to admit a new flow upon the successful and timely delivery, through the Internet, of probe packets independently generated by the end points. Our solution, called GRIP (Gauge&Gate Realistic Internet Protocol), is fully distributed and scalable, as admission control decisions are taken at the edge network nodes, and no coordination between router…
A reconfigurable platform for evaluating the performance of QoS networks
2010
Nowadays, high performance System and Local Area Networks (SAN/LAN) have to serve heterogeneous traffic consisting of information flows with different bandwidth and latency requirements. This makes it necessary to provide Quality of Service (QoS) and optimize the design of network components. In this paper we present a hardware tool designed to analyze the performance of QoS networks, under given traffic conditions and server models. In particular, a reprogrammable multimedia traffic Generator/Monitor platform has been built. This permits prototyping the communication system of a high speed LAN/SAN on a single FPGA device. Hence, it can be used at design to produce more efficient devices. T…
A new Scheme for RPL to handle Mobility in Wireless Sensor Networks
2017
Mobile wireless sensor networks (WSNs) are characterised by dynamic changes in the network topology leading to route breaks and disconnections. The IPv6 routing protocol for low power and lossy networks (RPL), which has become a standard, uses the Trickle timer algorithm to handle changes in the network topology. However, neither RPL nor Trickle timer are well adapted to mobility. This paper investigates the problem of supporting mobility when using RPL. It enhances RPL to fit with sensors' mobility by studying two cases. Firstly, it proposes to modify RPL in order to fit with a dynamic and hybrid topology in the context of medical applications. Secondly, it investigates a more general case…
I-RP: Interference Aware Routing Protocol for WBAN
2018
The Wireless Body Sensor Networks (WBSN) have witnessed tremendous research interest because of their wide range of applications (medical and non-medical) in order to improve the quality of life. The healthcare applications of WBSN demands dissemination of patient’s data, reliably and in a timely manner. For this purpose, medical teams may use real-time applications for disseminating critical data such as blood pressure, ECG, and EEG. The critical data packets are highly delay sensitive that must reach intended destination within time constraints. Due to the exchange of real-time and multi-media data, some nodes or links may experience the significant level of interference in the network. C…