Spatial Reuse can significantly increase the throughput of optical ring networks by allowing multiple stations to transmit concurrently over distinct segments of the ring. Buffer Insertion Ring (BIR) scheme is widely used to achieve spatial reuse. However, because non-preemptive priority is usually given to the ring (pass-through) traffic, BIR scheme may cause fairness problems in allocating the ring bandwidth among distinct nodes. In this paper, we propose a novel approach that can prevent starvation and maximize the throughput with low complexity. The main idea of this method is that for every node of the ring to provide a separate queue for each source that shares the output link of the particular node. We then fairly allocate the output link bandwidth to all the sources based on the weight of the corresponding queues. Simulations and analysis show that this new scheme can provide fairness with less end-to-end delay compare to BIR scheme.

Additional Metadata
Keywords Bandwidth allocation, Buffer Insertion Ring (BIR), Fairness, Packet scheduling, Source-Based Queuing (SBQ), Spatial reuse
Persistent URL dx.doi.org/10.1117/12.480725
Conference APOC 2002: Metro and Access Networks II
Citation
Tang, H. (Helen), & Lambadaris, I. (2002). Novel bandwidth allocation scheme for ring networks with spatial reuse. Presented at the APOC 2002: Metro and Access Networks II. doi:10.1117/12.480725