Stability of Traffic Load Balancing on Wireless Complex Networks
share
Load balancing between adjacent base stations (BS) is important for homogenizing traffic load distributions and improving service provisioning. Whilst load balancing between any given pair of BSs is beneficial, cascade load sharing can cause network level instability that is hard to predict. An unexplored area of research is the relationship between the local load balancing dynamics and the overall network topology. Here, we show an exact analytical relationship for cascade stability, relating the load balancing dynamics with the graph property of the whole network. We employ the Gershgorin theorem to show that basic load balancing across any dynamic and network topology is always asymptotically stable. We demonstrate this result using both a Poisson Point Process (PPP) and a Poisson Cluster Process (PCP) generated random complex network. We believe this general relationship can inform the joint design of both the load balancing dynamics and the neighbour list of the network.
READ FULL TEXT
