Crossover times in bipartite networks with activity constraints and time-varying switching rates

TL;DR

This paper analyzes the switching dynamics and crossover times in bipartite networks with activity constraints, modeling wireless networks with interference, and computes transition times under time-varying activation rates.

Contribution

It introduces a model for bipartite networks with time-dependent switching rates and derives crossover times using metastability analysis, extending previous static models.

Findings

Crossover times depend on switching protocols and network structure.

Large activation rates lead to predictable metastable states.

Time-varying protocols can be compared to static ones via coupling techniques.

Abstract

In this paper we study the performance of a bipartite network in which customers arrive at the nodes of the network, but not all nodes are able to serve their customers at all times. Each node can be either active or inactive, and two nodes connected by a bond cannot be active simultaneously. This situation arises in wireless random-access networks where, due to destructive interference, stations that are close to each other cannot use the same frequency band. We consider a model where the network is bipartite, the active nodes switch themselves off at rate 1, and the inactive nodes switch themselves on at a rate that depends on time and on which half of the bipartite network they are in. An inactive node cannot become active when one of the nodes it is connected to by a bond is active. The switching protocol allows the nodes to share activity among each other. In the limit as the activation rate becomes large, we compute the crossover time between the two states where one half of the network is active and the other half is inactive. This allows us to assess the overall activity of the network depending on the switching protocol. Our results make use of the metastability analysis for hard-core interacting particle models on finite bipartite graphs derived in an earlier paper. They are valid for a large class of bipartite networks, subject to certain assumptions. Proofs rely on a comparison with switching protocols that are not time-varying, through coupling techniques.