Download now Free registration required
The authors consider the delay properties of one-hop networks with general interference constraints and multiple traffic streams with time-correlated arrivals. They first treat the case when arrivals are modulated by independent finite state Markov chains. They show that the well known maximal scheduling algorithm achieves average delay that grows at most logarithmically in the largest number of interferers at any link. Further, in the important special case when each Markov process has at most two states (such as bursty ON/OFF sources), they prove that average delay is independent of the number of nodes and links in the network, and hence is order-optimal.
- Format: PDF
- Size: 227 KB