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

DOI10.1016/J.INS.2010.12.023MaRDI QIDQ545342zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Constant time per edge is optimal on rooted tree networks
• Stochastic comparison of queueing networks
• On the stochastic end-to-end delay analysis in sink trees under independent and dependent arrivals
• Stochastic monotonicity in general queueing networks
• scientific article; zbMATH DE number 1223593

Cites work

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

Cited in

(3)

• On the performance of randomized embedding of reproduction trees in static networks
• Recent issues on stochastic directional convexity, and new results on the analysis of systems for communication, information, time scales and maintenance
• Constant time per edge is optimal on rooted tree 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)