Abstract
Ring network architectures that employ spatial reuse permit concurrent transmissions of messages over different links. While spatial reuse increases network throughput, it may also cause starvation of nodes. To alleviate this problem, various policies have been suggested in the literature. In this paper we concentrate on a class of such policies that achieve fairness by allocating transmission quotas to nodes. For such policies, we provide mechanisms for improving delays and increasing overall throughput without compromising fairness.
| Original language | English |
|---|---|
| Pages (from-to) | 1103-1111 |
| Number of pages | 9 |
| Journal | Proceedings - IEEE INFOCOM |
| Volume | 3 |
| State | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the IEEE INFOCOM'94. Part 2 (of 3) - Toronto, Ont, Can Duration: 12 Jun 1994 → 16 Jun 1994 |