Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Protection and administration of information networks with partial orderings
Computers and Security
Optimal order of servers for tandem queues in light traffic
Management Science
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Computer security methodology: risk analysis and project definition
Computers and Security
Simple algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Bounds on the greedy routing algorithm for array networks
Journal of Computer and System Sciences
Stochastic Convexity on General Space
Mathematics of Operations Research
Stochastic Comparison of Random Vectors with a Common Copula
Mathematics of Operations Research
Constant time per edge is optimal on rooted tree networks
Distributed Computing
Mathematics of Operations Research
Network Security Evaluation: Using the NSA IEM
Network Security Evaluation: Using the NSA IEM
Cross-layer architecture for scalable video transmission in wireless network
Image Communication
Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks
IEEE Transactions on Computers
Convex comparisons for random sums in random environments and applications
Probability in the Engineering and Informational Sciences
Evolutionary design of oriented-tree networks using Cayley-type encodings
Information Sciences: an International Journal
Information Sciences: an International Journal
Distributed routing in wireless sensor networks using energy welfare metric
Information Sciences: an International Journal
Investigations on Stochastic Information Control Nets
Information Sciences: an International Journal
| Hi-index | 0.07 |
Consider a rooted tree network, where the items enter at the system and they proceed away from the root until they reach their destination and exit the system, and they are served by a FIFO policy at each arc (server) of the network. The routing is defined by a discrete probability distribution with a given probability for each destination. For such systems, stochastic modelling of the departure times and the delay times is proposed, by the incorporation of random parameters of the inter-arrival times and of the service times, describing dynamic environments. A mixture model for the departure times is introduced. This mixture has an arbitrary mixing distribution defined by the environmental parameter distributions and the routing distribution. The main results provide conditions to compare stochastically the departure times (delay times) for two rooted tree networks characterized by different routing disciplines or by environmental and correlated random vectors of parameters. Furthermore, bounds for these measures are obtained from some well-known dependence concepts, as the PQD property, and ageing properties of the random environment. Similar results for butterfly networks, tree networks with possible failure during the service and other networks are provided. Within the computer networks, our framework and our results provide explorative tools to assess the design, the performance and the security of communication systems.