The upper bound of packet transmission capacity in local static routings
classification
💻 cs.NI
cond-mat.stat-mech
keywords
transmissioncapacitynetworksroutingsstaticupperagreeanalysis
read the original abstract
We propose a universal analysis for static routings on networks and describe the congestion characteristics by the theory. The relation between average transmission time and transmission capacity is described by inequality T0Rc0<=1. For large scale sparse networks, the non-trivial upper bond of transmission capacity Rc0 is limited by Rc0<=1/< 1/k > in some approximate conditions. the theoretical results agree with simulations on BA Networks.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.