Search results for "Computer network"
showing 10 items of 1634 documents
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…
AQM Stability in Multiple Bottleneck Networks
2004
In this paper, we highlight that multiple bottlenecks can affect the performance of active queue management controllers, which are usually configured on a single bottleneck basis, as if each controller were the only element regulating the TCP traffic along its path. To see this, we consider a network scenario where RED is configured at each router, according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. Yet, we show that instability may arise when two link become congested. We justify this result through a multiple bottleneck model and give guidelines for new cooperative AQM controllers.
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…
<title>Revenue-maximization-based adaptive WFQ</title>
2002
In the future Internet, di erent applications such as Voice over IP (VoIP) and Video-on-Demand (VoD) arise with di erent Quality of Service (QoS) parameters including e.g. guaranteed bandwidth, delay jitter, and latency. Different kinds of service classes (e.g. gold, silver, bronze) arise. The customers of di erent classes pay di erent prices to the service provider, who must share resources in a plausible way. In a router, packets are queued using a multi-queue system, where each queue corresponds to one service class. In this paper, an adaptive Weighted Fair Queue based algorithm for traAEc allocation is presented and studied. The weights in gradient type WFQ algorithm are adapted using r…
Parallel Genetic Algorithms for the Tuning of a Fuzzy AQM Controller
2003
This paper presents the results of the application of a parallel Genetic Algorithm (GA) in order to design a Fuzzy Proportional Integral (FPI) controller for active queue management on Internet routers. The Active Queue Management (AQM) policies are those policies of router queue management that allow the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. Two different parallel implementations of the genetic algorithm are adopted to determine an optimal configuration of the FPI controller parameters. Finally, the results of several experiments carried out on a forty nodes cluster of workst…
A Discrete Model for a Network Having Broken Packages
2009
Broken packages are packages with not enough information regarding the destination address and they have a negative impact on a computer network. Broken packages stay in the router too much time and overload it. This is a real problem which appears in the computer network of Sofia University. We know only the time when a broken package arrives in the router. The problem is to find the computer which send broken packages. The aim of this article is to propose a model for defining the data transmission stability and correctness in a computer network. Our theoretical model is temporal dependent and captures the transmission properties of a computer network.
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…