Institutions

About Us

Help

Gaeilge
0
1000
Home
Browse
Advanced Search
Search History
Marked List
Statistics
A
A
A
Author(s)
Institution
Publication types
Funder
Year
Limited By:
Subject = delays ;
7 items found
Sort by
Title
Author
Item type
Date
Institution
Peer review status
Language
Order
Ascending
Descending
25
50
100
per page
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Displaying Results 1  7 of 7 on page 1 of 1
Marked
Mark
A Strategy for Fair Coexistence of Loss and DelayBased Congestion Control Algorithms
(2009)
Budzisz, Lukasz; Stanojević, Rade; Shorten, Robert N.; Baker, Fred
A Strategy for Fair Coexistence of Loss and DelayBased Congestion Control Algorithms
(2009)
Budzisz, Lukasz; Stanojević, Rade; Shorten, Robert N.; Baker, Fred
Abstract:
Delaybased TCP variants have attracted a large amount of attention in the networking community because of their ability to efficiently use network resources, control queuing delays, exhibit virtually zero packet loss, etc. One major issue that discourages the wider deployment of delaybased TCP variants is their inability to coexist fairly with standard lossbased TCP. In this note we propose a simple mechanism that allows delayand lossbased (AIMD) TCP flows to compete fairly with each other. Further, our approach ensures that delaybased flows automatically (and swiftly) switch to a lowdelay regime if no lossbased flows are present. We provide analytical and simulation results to validate presented algorithm.
http://mural.maynoothuniversity.ie/1648/
Marked
Mark
Adaptive Tuning of DropTail Buffers for Reducing Queueing Delays.
(2006)
Stanojević, Rade; Shorten, Robert N.; Kellett, Christopher M.
Adaptive Tuning of DropTail Buffers for Reducing Queueing Delays.
(2006)
Stanojević, Rade; Shorten, Robert N.; Kellett, Christopher M.
Abstract:
Internet router buffers are used to accommodate packets that arrive in bursts and to maintain high utilization of the egress link. Such buffers can lead to large queueing delays. We propose a simple algorithm, Active DropTail (ADT), which regulates the queue size, based on prevailing traffic conditions, to a minimum size that still allows for a desired (high) level of utilization. Packet level ns2 simulations are provided to show that Adaptive DropTail achieves significantly smaller queues than current approaches at the expense of 12% of the link utilization.
http://mural.maynoothuniversity.ie/1762/
Marked
Mark
Control of pH inline using a neural predictive strategy
(1996)
Gomm, J.B.; Doherty, Sean; Williams, D.
Control of pH inline using a neural predictive strategy
(1996)
Gomm, J.B.; Doherty, Sean; Williams, D.
Abstract:
Control of an experimental inline pH process exhibiting varying nonlinearity and deadtime is described. A radial basis function (RBF) artificial neural network is used to model the nonlinear dynamics of the process. Accommodation of the varying process deadtime in the neural model is achieved by the generation of a feedforward signal, for input to the neural network, from a downstream pH measurement. The feedforward signal is derived from a variable delay model based on process knowledge and a flow measurement. The neural model is then used to realise a predictive control scheme for the process. Development of the neural process model is described and results are presented to illustrate the performance of the neural predictive control scheme which is tested as a regulator at different setpoints.
http://mural.maynoothuniversity.ie/9685/
Marked
Mark
Input Disturbance Rejection in Channel SignaltoNoise Ratio Constrained Feedback Control
(2008)
Rojas, A.J.; Middleton, R.H.; Freudenberg, J.S.; Braslavsky, J.H.
Input Disturbance Rejection in Channel SignaltoNoise Ratio Constrained Feedback Control
(2008)
Rojas, A.J.; Middleton, R.H.; Freudenberg, J.S.; Braslavsky, J.H.
Abstract:
Communication channels impose a number of obstacles to feedback control. One recent line of work considers the problem of feedback stabilisation subject to a constraint on the channel signaltonoise ratio (SNR). It has been shown for continuoustime systems that the optimal control problem of achieving the infimal SNR can be formulated as a linear quadratic Gaussian (LQG) control problem with weights chosen as in the loop transfer recovery (LTR) technique. The present paper extends this formulation to: discretetime systems; communications over channels with memory; and input disturbance rejection. By using this formulation, we derive exact expressions for the linear time invariant (LTI) controller that achieves the infimal SNR under the effect of timedelay and additive coloured noise. We then quantify the infimal SNR required for both stabilisation and input disturbance rejection for a relative degree one, minimum phase plant and a memoryless Gaussian channel.
http://mural.maynoothuniversity.ie/2245/
Marked
Mark
On Diagonal Stability of Positive Systems with Switches and Delays
(2018)
Aleksandrov, Alexander; Mason, Oliver
On Diagonal Stability of Positive Systems with Switches and Delays
(2018)
Aleksandrov, Alexander; Mason, Oliver
Abstract:
We consider linear positive systems with delay and switchings of operation modes. We establish conditions under which it is possible to construct a common Lyapunov–Krasovskii diagonal functional for the family of subsystems corresponding to the system with switchings in consideration. These conditions are formulated in terms of the feasibility of auxiliary systems of linear algebraic inequalities. In addition, we study the problem of the existence of a diagonal functional of a special form. We also show that our results can be used to analyze the stability of some classes of nonlinear positive systems with delay.
http://mural.maynoothuniversity.ie/13195/
Marked
Mark
On the achievable delay margin using LTI control for unstable plants.
(2007)
Middleton, Richard H.; Miller, Daniel E.
On the achievable delay margin using LTI control for unstable plants.
(2007)
Middleton, Richard H.; Miller, Daniel E.
Abstract:
Handling delays in control systems is difficult and is of longstanding interest. It is well known that, given a finitedimensional linear timeinvariant (FDLTI) plant and controller forming a strictly proper stable feedback connection, closedloop stability will be maintained under a small delay in the feedback loop, although most closed loop systems become unstable for large delays. One previously unsolved fundamental problem in this context is whether, for a given FDLTI plant, an arbitrarily large delay margin can be achieved using LTI control. Here, we adopt a frequency domain approach and demonstrate that, for a strictly proper real rational plant, there is a uniform upper bound on the delay that can be tolerated when using an LTI controller, if and only if the plant has at least one closed right half plane pole not at the origin. We also give several explicit upper bounds on the achievable delay margin, and, in some special cases, demonstrate that these bounds are tight.
http://mural.maynoothuniversity.ie/1709/
Marked
Mark
Sizing Internet Router Buffers, Active Queue Management, and the Lur'e Problem.
(2006)
Kellett, Christopher M.; Shorten, Robert N.; Leith, Douglas J.
Sizing Internet Router Buffers, Active Queue Management, and the Lur'e Problem.
(2006)
Kellett, Christopher M.; Shorten, Robert N.; Leith, Douglas J.
Abstract:
In this paper we consider the design of control strategies for implementation in a recently proposed Active Queue Management (AQM) scheme, active droptail (ADT) [9]. The basic idea underlying ADT is to adjust the queue length of a droptail buffer to regulate the utilization of a link carrying internet traffic in order to reduce queuing delays in the network. A basic problem in the design of ADT is to design appropriate strategies to regulate the target utilization using the buffer queue as a control input. This problem is challenging due to the stochastic and timevarying nature of communication networks. Our contribution in this paper is to relate the design of control strategies for this AQM to the classical Lur’e problem. Our formulation naturally accounts for the timevariations and randomness inherent in communication networks, and enables us to design AQMs with guaranteed convergence (under mild and realistic assumptions). Packet level simulations are given to demonstrate th...
http://mural.maynoothuniversity.ie/1779/
Displaying Results 1  7 of 7 on page 1 of 1
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Item Type
Book chapter (2)
Journal article (5)
Year
2018 (1)
2009 (1)
2008 (1)
2007 (1)
2006 (2)
1996 (1)
built by Enovation Solutions