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

DOI10.1016/J.INS.2010.12.023zbMATH Open1231.90141OpenAlexW2130067744MaRDI QIDQ545342FDOQ545342

Eva Ortega

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

mixturesstochastic orderingscomputer network performancedirectionally convex orderdistributional boundsmodelling uncertaintyrooted butterfly networksrooted tree networks

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An introduction to copulas. Properties and applications
• A kolmogorov-smirnov type test for positive quadrant dependence
• Comparison methods for stochastic models and risks
• Stochastic orders
• Convex measures of risk and trading constraints
• Acyclic fork-join queuing networks
• Stochastic Comparison of Random Vectors with a Common Copula
• Ultramodular Functions
• Bounds for the expected delays in some tandem queues
• On the comparison of waiting times in tandem queues
• Stochastic ordering and dependence in applied probability
• Stochastic convexity on general space
• CONVEX COMPARISONS FOR RANDOM SUMS IN RANDOM ENVIRONMENTS AND APPLICATIONS
• Parametric stochastic convexity and concavity of stochastic processes
• Waiting time analysis for a tandem queue with correlated service
• Optimal order for two servers in tandem
• Optimal Order of Servers for Tandem Queues in Light Traffic
• Routing in queueing networks under imperfect information: stochastic dominance and thresholds
• 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
• Bounds on the greedy routing algorithm for array networks
• Evolutionary design of oriented-tree networks using Cayley-type encodings

Cited In (2)

• Recent issues on stochastic directional convexity, and new results on the analysis of systems for communication, information, time scales and maintenance
• On the performance of randomized embedding of reproduction trees in static networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545342)