The upper bound of packet transmission capacity in local static routings

TL;DR

This paper presents a theoretical analysis of the maximum packet transmission capacity in static network routings, establishing bounds and validating them with simulations on BA networks.

Contribution

It introduces a universal theoretical framework for static routing capacity bounds and provides approximate formulas for large sparse networks.

Findings

The relation T0Rc0<=1 links average transmission time and capacity.

Upper bounds of Rc0 are derived for large sparse networks.

Simulations on BA networks confirm the theoretical bounds.

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.