A fluid model for a relay node in an ad hoc network: Evaluation of resource sharing policies.
A heuristic method for the estimation of the project duration in a stochastic network scheduling
A stochastic complex network model society.
Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables.
Bounded expansion in web graphs
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.
Building multi-agent models applied to supply chain management
Cycle time of stochastic max-plus linear systems.
Discrete small world networks.
Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy.
Dynamic traffic network equilibrium system.
Erlang distributed activity times in stochastic activity networks
It is assumed that activity times in stochastic activity networks (SANs) are independent Erlang random variable (r.v.). A recurrence method of determining the th moments of the completion time is presented. Applications are provided for illustration and are used to evaluate the applicability and appropriateness of the Erlang model to represent activity network.
Flows in infinite networks
Gordon and Newell Queueing Networks and Copulas
Joint queue-perturbed and weakly coupled power control for wireless backbone networks
Wireless Backbone Networks (WBNs) equipped with Multi-Radio Multi-Channel (MRMC) configurations do experience power control problems such as the inter-channel and co-channel interference, high energy consumption at multiple queues and unscalable network connectivity. Such network problems can be conveniently modelled using the theory of queue perturbation in the multiple queue systems and also as a weak coupling in a multiple channel wireless network. Consequently, this paper proposes a queue perturbation...
Knowledge sharing in flexible supply networks: a context-based approach
Large deviations for tandem queueing systems.
L'importance des réseaux en économie
Localización sobre redes estocásticas con criterio minisum.
Se considera el problema de localización de centros de servicio sobre redes estocásticas, donde los puntos de demanda son cada uno de los puntos de los arcos, así como los nodos de la red y el tiempo de duración de los trayectos, sobre los arcos de la red, son variables aleatorias discretas con distribuciones de probabilidad conocidas. Bajo un conjunto particular de supuestos, se encuentra que siempre existe un conjunto de m puntos de la red que son puntos medios de los arcos, o nodos de la red,...
Modèles analytiques de routeurs
Modèles Analytiques de Routeurs
We focus on performance study of routers in high-speed network through a queuing network analytical model. Such a model gives accurate results about classical performance criteria. For example, analytical study of packet loss probabilities in a router uses a product-form queuing network. The analytical results are compared to simulation results, and they provide routers managers with invaluable information for internal memories tuning.