Authors:
Tania Jiménez,
Volume: 1, Page 1846 Paper number 1501
Abstract:
We consider in this paper the problem of Call Admission Control of
guaranteed performance (GP) connections (such as the CBR and VBR traffic
classes in ATM) in the presence of best effort (BE) connections that
use the bandwidth left over by the guaranteed performance connections.
We assume that the BE sessions do not require a minimum cell rate (MCR)
and are thus not subject to call admission control. By slightly increasing
rejection rate of GP sessions one may decrease dramatically the delay
of BE sessions. We formulate the admission problem as a Markov decision
problem and obtain the optimal policy. In particular, we show that
it is of a switching curve type. We then compare numerically the performance
of the optimal policy to threshold policies as well as to the policy
which ignores the BE traffic (and accepts GP sessions as long as there
is available bandwidth for them). We show that threshold policies are
good approximations for the overall optimal policy.
Authors:
Eitan Altman,
Bruno Gaujal,
Arie Hordijk,
Volume: 1, Page 1852 Paper number 1502
Abstract:
In this paper, we present the notion of multimodular triangulation
under a new geometrical point of view. We also show the link with multimodular
functions by a new proof of the convexity theorem. This is used to
define a partial ordering compatible with multimodularity called the
cone ordering. An application in admission control in queues is then
presented.
Authors:
Timothy Darling,
Mark A. Shayman,
Volume: 1, Page 1858 Paper number 1503
Abstract:
We consider the problem of locating an intruder in an IP domain using
dynamic IPSec security associations as proposed in the DECIDUOUS project.
We formulate this problem as a Markov decision process that evolves
on the set of subtrees of a shortest path routing tree. For small domains,
an optimal stationary policy can be determined by dynamic programming.
For large domains, the use of neurodynamic programming as well as
heuristic policies are examined. Our results indicate that under certain
assumptions, a one-feature heuristic policy provides good performance.
Authors:
Mark A. Shayman,
E. Fernández-Gaucherand,
Volume: 1, Page 1864 Paper number 1504
Abstract:
We consider the problem of determining the optimal sequence of tests
for the discovery of a faulty component, e.g., in a telecommunications
network, where there is a random cost associated with testing a component.
A novel feature in our approach is that a risk-sensitive performance
criterion is used in order to rank different competing schedules. We
characterize optimal schedules both when the testing sequence is not
subject to precedence constraints, and when it is subject to such constraints,
given by an arbitrary partial order.
Authors:
Linhai He,
Jean Walrand,
Volume: 1, Page 1870 Paper number 1505
Abstract:
We investigate the use of simulation and transaction-level models for
TCP in IP network design. More specifically, we focus on the transaction
level dynamics of TCP and approximate it by max-min fair sharing. Based
on this model, we formulate a network dimensioning problem as a nonlinear
constrained optimization problem. The constraints and their gradients,
which do not have analytical forms, are estimated through fluid simulation
of the transaction-level model of TCP. The problem is solved by a gradient
descent type of algorithm, with additional heuristics based techniques
to improve its convergence. The performance of the proposed algorithm
is evaluated through experimental studies on example networks. Results
show that the methods are promising and can help the design of networks.
Authors:
Sarang Wagholikar,
R. Ravikanth,
R. Srikant,
Volume: 1, Page 1876 Paper number 1506
Abstract:
Central limit theorem (CLT) based techniques have been recently proposed
to perform measurement-based admission control (MBAC). In this paper,
we present refinements to this using moderate deviations expansions
of the probability of overflow in a bufferless model.
|