Authors:
Yanxing Song,
Xinghuo Yu,
Volume: 1, Page 42 Paper number 1235
Abstract:
In this paper, a multi-parameter modulation scheme is proposed for
secure communication via Lorenz chaos using an adaptive learning mechanism.
It is proved using the Lyapunov method that under the scheme, the tracking
performance of the scheme can be guaranteed. It is also shown that
by incorporating a low pass filter structure into the structure of
the receiver, good tracking performance can be achieved when the signals
to be transmitted contain noises. Simulation studies are provided to
demonstrate the effectiveness of the method proposed.
Authors:
Sarangapani Jagannathan,
Jayasree Talluri,
Volume: 1, Page 47 Paper number 1342
Abstract:
This paper proposes an predictive congestion control methodology for
the Available Bit Rate (ABR) service class in an ATM network for the
case of multiple node single buffer scenario. Adaptive controller
is developed to control traffic where sources adjust their transmission
rates in response to the feedback information from the network nodes.
Specifically, the dynamics of the buffer is modeled as a nonlinear
system and an autoregressive moving average based (ARMAX) adaptive
controller is designed to predict the explicit values of the transmission
rates of the sources so as to prevent network congestion. Stability
analysis of the closed-loop system is presented. Simulation results
are provided to justify the theoretical conclusions.
Authors:
Chaouki T. Abdallah,
Marco Ariola,
Ray Byrne,
Volume: 1, Page 53 Paper number 9127
Abstract:
This paper illustrates the application of statistical-learning control
results for the design of an Available Bit Rate (ABR) congestion control
algorithm. The proposed methodology allows us to take into account
the nonlinearities of the model and the uncertainty of the parameters
in the design phase. Some simulation results are shown.
Authors:
Christos G. Panayiotou,
Christos G. Cassandras,
Volume: 1, Page 55 Paper number 1164
Abstract:
This paper addresses the problem of increasing the capacity of a Cellular
Communication System. Rather than using the traditional channel allocation
schemes, this paper tries to increase the system capacity by utilizing
the unavoidable overlap between the coverage areas of adjacent base
stations and allocate new calls to the ``least sensitive'' base station.
Several simulation results are included that show the benefits of
the proposed algorithms compared to the algorithms that already exist
in the literature.
Authors:
Eitan Altman,
Chadi Barakat,
Emmanuel Laborde,
Patrick Brown,
Denis Collange,
Volume: 1, Page 61 Paper number 1483
Abstract:
Bandwidth sharing between multiple TCP connections has been studied
under the assumption that the windows of the different connections
vary in a synchronized manner. This synchronization is a main result
of the deployment of Drop Tail buffers in network routers. The deployment
of active queue management techniques such as RED will alleviate this
problem of synchronization. We develop in this paper a mathematical
model to study how the bottleneck bandwidth will be shared if TCP windows
are not synchronized. This permits to evaluate the improvement in fairness
and utilization brought by the deployment of active buffers. Also,
this indicates how much a synchronization-based study underestimates
the performance of TCP in a non-synchronized environment.
Authors:
Stephan Bohacek,
Volume: 1, Page 67 Paper number 1799
Abstract:
A hop-by-hop congestion control method is developed. Unlike other hop-by-hop
schemes, this method does not require the router to keep track of per-virtual
circuit information. Hence, this method puts little computational burden
on the router. The method is hop-by-hop based, hence, it allows the
flows to quickly adjust to changes in the available bandwidth. The
network is modeled as an LPV system. However, standard LPV techniques
prove too conservative and alternative methods are applied. It is shown
that for certain feedback gains, the system is exponentially stable.
Authors:
Rene K. Boel,
Iven M.Y. Mareels,
Matthew R. James,
Volume: 1, Page 73 Paper number 2048
Abstract:
In the context of long range dependent processes we compare robust
and adaptive prediction/filtering. The intuitive observation that adaptation
achieves optimality asymptotically and outperforms in the long run
robust filtering is quantified through the estimation of convergence
rates and levels of achievable performance.
|