Positive matrices associated with synchronised communication networks

DOI10.1016/J.LAA.2004.07.016zbMath1062.93024OpenAlexW2059881830MaRDI QIDQ703620

Abraham Berman, Robert N. Shorten, Douglas J. Leith

Publication date: 11 January 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2004.07.016

zbMATH Keywords

communication networksnetwork congestion controlinterlacing theorem for rank-1 perturbed matricessecond eigenvalue of a positive matrix

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Eigenvalue problems (93B60) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (7)

Identification of stochastically perturbed autonomous systems from temporal sequences of probability density functions ⋮ A matrix-based approach to solving the inverse Frobenius-Perron problem using sequences of density functions of stochastically perturbed dynamical systems ⋮ Solving the inverse Frobenius-Perron problem using stationary densities of dynamical systems with input perturbations ⋮ Stability and stabilization of positive switched systems with mode-dependent average dwell time ⋮ A novel matrix approach for controlling the invariant densities of chaotic maps ⋮ On the second eigenvalue of matrices associated with TCP ⋮ Reconstruction of one-dimensional chaotic maps from sequences of probability density functions

Cites Work

• Analysis and design of AIMD congestion control algorithms in communication networks
• Matrix Analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive matrices associated with synchronised communication networks