Stochastic comparisons for rooted butterfly networks and tree networks, with random environments

DOI10.1016/j.ins.2010.12.023zbMath1231.90141OpenAlexW2130067744MaRDI QIDQ545342

Publication date: 22 June 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.12.023

zbMATH Keywords

mixtures directionally convex order stochastic orderings computer network performance distributional bounds modelling uncertainty rooted butterfly networks rooted tree networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Bounds on the greedy routing algorithm for array networks
Evolutionary design of oriented-tree networks using Cayley-type encodings
Parametric stochastic convexity and concavity of stochastic processes
Stochastic orders
Waiting time analysis for a tandem queue with correlated service
An introduction to copulas. Properties and applications
Stochastic ordering and dependence in applied probability
Convex measures of risk and trading constraints
Optimal order for two servers in tandem
Stochastic Convexity on General Space
CONVEX COMPARISONS FOR RANDOM SUMS IN RANDOM ENVIRONMENTS AND APPLICATIONS
Optimal Order of Servers for Tandem Queues in Light Traffic
Routing in queueing networks under imperfect information: stochastic dominance and thresholds
Acyclic fork-join queuing networks
Bounds for the expected delays in some tandem queues
On the comparison of waiting times in tandem queues
Extremal properties of the FIFO discipline in queueing networks
Technical Note—On the Comparison of Waiting Times in GI/G/1 Queues
Average delay in queues with non-stationary Poisson arrivals
Simple Algorithms for Routing on Butterfly Networks with Bounded Queues
Bounds for Different Arrangements of Tandem Queues with Nonoverlapping Service Times
Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks
Constant time per edge is optimal on rooted tree networks
Stochastic Comparison of Random Vectors with a Common Copula
Ultramodular Functions
A kolmogorov-smirnov type test for positive quadrant dependence

This page was built for publication: Stochastic comparisons for rooted butterfly networks and tree networks, with random environments