Dimensioning of data networks: a flow-level perspective
β Scribed by Lassila, Pasi ;Penttinen, Aleksi ;Virtamo, Jorma
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 276 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1124-318X
- DOI
- 10.1002/ett.1340
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Fitting models to incomplete categorical data requires more care than "tting models to the complete data counterparts, not only in the setting of missing data that are non-randomly missing, but even in the familiar missing at random setting. Various aspects of this point of view have been considered
This paper describes an NP-hard combinatorial optimization problem arising in the Sloan Digital Sky Survey and a practical approximation algorithm that has been implemented and will be used in the survey. The algorithm is based on network flow theory and Lagrangian relaxation.
We present a parallel algorithm for computing the correlation dimension (D2) from a time series generated by a dynamic system, using the method of correlation integrals, which essentially requires the computation of distances among a set of points in the state space. The parallelization is suitable
The modern business climate presents challenges with the evolution and convergence of networks, the use of third-party equipment, outsourcing and changes in customers' management of networks. While driving the same availability requirements, these modern challenges cause a need for designers to appl