A waste-free fairness control for rings with spatial reuse

While spatial reuse in a high-speed ring increases the throughput performance, it leads to a fairness problem in distributing the network bandwidth among distinct nodes. To alleviate this problem, fairness control algorithms based on a packet window have been developed. Under these algorithms, satisfied nodes are forced to pass empty slots to starved downstream nodes until their windows are refilled by a reset signal. This regulation incurs a bandwidth waste corresponding to the travel distance of those empty slots. In this paper, a waste-free fairness control method based on a two-layer window composed of the cycle and packet windows is developed. Using the proposed method, packets allocated to multiple fairness cycles are simultaneously transferred and, in consequence, the otherwise wasted bandwidth can be reused to carry, in advance, packets allocated to future fairness cycles. This method is applied to two typical ring protocols with only the packet window, ATMR and MetaRing, and their performances are investigated The simulation results show that the cycle window is very effective to improve the performance of the ATMR and MetaRing protocols.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2001-02
Language
ENG
Keywords

PERFORMANCE ANALYSIS; ALGORITHM; NETWORK; DESIGN

Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E84B, no.2, pp.305 - 316

ISSN
0916-8516
URI
http://hdl.handle.net/10203/3400
Appears in Collection
EE-Journal Papers(저널논문)
  • Hit : 420
  • Download : 1
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0