Boole-Bonferroni inequalities and linear programming
Operations Research
Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur
Mathematics of Operations Research
Sharp bounds on probabilities using linear programming
Operations Research
The discrete moment problem and linear programming
Discrete Applied Mathematics
Computing approximate blocking probabilities for large loss networks with state-dependent routing
IEEE/ACM Transactions on Networking (TON)
Controlling alternate routing in general-mesh packet flow networks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Reliability of Computer and Communication Networks
Reliability of Computer and Communication Networks
Call Admissibility for Multirate Traffic in Wireless ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
| Hi-index | 0.00 |
Computational techniques are presented for connection-level performance evaluation of communication networks, with stochastic multirate traffic, state dependent admission control, alternate routing, and general topology --- all characteristics of emerging integrated service networks. The techniques involve solutions of systems of fixed point equations, which estimate equilibrium network behavior. Though similar techniques have been applied with success to single-rate fully connected networks, the curse of dimensionality arises when the techniques are extended to multirate, multihop networks, and the cost of solving the fixed point equations exactly is exponential. This exponential barrier is skirted by exploiting, in particular, a close relationship with the network reliability problem, and by borrowing effective heuristics from the reliability domain. A series of experiments are reported on, comparing the estimates from the new techniques to the results of discrete event simulations.