Search results for "ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS"
showing 10 items of 449 documents
Providing QOS in 3G-WLAN environment with RSVP and DIFFSERV
2006
Here we present the end-to-end QoS mechanism in 3G-multiaccess network environment. As multi-access wireless WLAN and wired xDSL wideband multi-access technologies has emerge and become more popular a need for interoperability with different technologies and domains has become necessity. There is also a need for end-to-end QoS management. We show a scenario where the UE-GGSN connection is covered by RSVP and RAN network part uses partial over dimensioning and real-time controlled ATM queuing. DiffServ covers WLAN-Core QoS and radio interface between WLAN AP and WLAN UE uses IEEE's 802.11e. Our interest is to find out how well 3G traffic classes can survive in different traffic conditions in…
Guaranteed access mode for downlink traffic over IEEE 802.11 WLANs
2011
IEEE 802.11 networks present an unfairness problem between the downlink and uplink traffic, using the default settings of the Enhanced Distributed Channel Access (EDCA). In order to reduce this unfairness, the Access Point (AP) can adapt the standard parameters, but this is not enough. In this paper, we propose simple and efficient solutions, which are implemented at the AP, thus they are standard compatible and no modifications to the current hardware and protocol stacks are needed. These solutions aim at providing guaranteed access to the downlink traffic when the AP perceives the unfairness problem. Our simulation results show a reduction in the unfairness and an enhancement in network p…
Fault Tolerant Routing Methodology for Mesh-of-Tree based Network-on-Chips using Local Reconfiguration
2018
Increase in the processing elements in a System-on- Chip (SoC) has led to an increasing complexity between the cores in the entire network. This communication bottleneck led to rise in the new paradigm called Network-on-Chip (NoC). These NoC are very much susceptible to various types of faults which can be transient, intermittent or permanent. This paper presents a fault-tolerant routing technique which can route the packets from a source to a destination in presence of permanent faults in the leaf routers of Mesh-of-Tree topology where cores are connected. This is achieved by using reconfiguration in the local ports of the leaf routers by inserting multiplexers as a layer between the leaf …
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…
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 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…