A performance study of the local fairness algorithm for the MetaRing MAC protocol

  • G. Anastasi
  • M. La Porta
  • L. Lenzini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1044)


The MetaRing is a Medium Access Control (MAC) protocol for Gigabit LANs and MANs with cells removed by the destination stations (slot reuse). Slot reuse increases the aggregate throughput beyond the capacity of single links but can cause starvation. In order to prevent this the MetaRing MAC protocol includes a fairness algorithm. Two types of fairness algorithms have been proposed: “global” and “local”. The paper analyses the local fairness algorithm specified in [CHEN93] by focusing on a worst-case network scenario which is particularly critical with respect to slot reuse. This scenario consists of a group of N equally spaced stations located in one half of the ring and which all send data traffic to a gateway only. The analysis can be divided into two parts. In the first part stations are assumed to operate in asymptotic conditions (never empty queues) and closed formulae for the aggregate and station throughputs are derived. In the second part of the paper the performances of the local fairness algorithm are studied in normal conditions, that is when the offered load is lower (underload conditions) or slightly higher (overload conditions) than the aggregate throughput achievable in asymptotic conditions. The analysis is performed (by simulation) on the same worst-case network scenario. The results obtained show that in asymptotic conditions the local fairness algorithm always allows a complete utilization of the medium capacity. Although it is not perfectly fair, the unfairness can be reduced by choosing of the algorithm parameters appropriately. This choice guarantees fairness in overload conditions as well, but causes unfairness in underload conditions.


Packet Loss Medium Access Control Medium Access Control Protocol Asymptotic Condition Message Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CHEN93]
    J. Chen, I. Cidon, Y. Ofek, “A Local Fairness Algorithm for Gigabit LAN's/MAN's with Spatial Reuse”, IEEE JSAC, Vol. 11, No. 8, October 1993, pp. 1183, 1192.Google Scholar
  2. [CIDO93]
    I. Cidon, Y. Ofek, “MetaRing, a Full Duplex Ring with Fairness and Spatial Reuse”, IEEE Transaction on Communications, Vol. 41, No. 1, January 1993.Google Scholar
  3. [CINL75]
    E. Çinlar, “Introduction to Stochastic Processes”, Englewood Cliffs, NJ: Prentice-Hall, 1975.Google Scholar
  4. [GORD92]
    R. F. Gordon, P. G. Lowener, E. A. MacNair “The Research Queueing Package Version 3. Language Reference Manual”, IBM Research Report, Yorktown 1992.Google Scholar
  5. [LAPO95]
    M. La Porta, “Valutazione delle Prestazioni del Meccanismo di Fairness Locale REQ/GNT applicato alla MAN al Gigabit/sec MetaRing”, Laurea Thesis (in Italian).Google Scholar
  6. [MAYE95]
    A. Mayer, Y. Ofek, M. Yung, “Approximating Max-Min Rates via Distributed Local Scheduling with Partial Information”, private communication.Google Scholar
  7. [OFEK94]
    Y. Ofek, “Overview of the MetaRing Architecture”, Computer Networks and ISDN Systems, Vol. 26, Nos. 6–8, March 1994, pp. 817–830.CrossRefGoogle Scholar
  8. [WU92]
    H. T. Wu, Y. Ofek, K. Sorhaby, “Integration of Synchronous and Asynchronous Traffic on the MetaRing Architecture and its Analysis”, Proceedings of ICC '92.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • G. Anastasi
    • 1
  • M. La Porta
    • 1
  • L. Lenzini
    • 1
  1. 1.Department of Information EngineeringUniversity of PisaPisaItaly

Personalised recommendations