2006 IEEE International Performance Computing and Communications Conference (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/.2006.1629418
D. Pupa , CNRS UMR, Inst. Nat. des Telecommun., Evry, France
T. Atmaca , CNRS UMR, Inst. Nat. des Telecommun., Evry, France
In this paper, we focus on the performance of asynchronous carrier sense multiple access with collision avoidance (CSMA/CA) protocol with variable packet sizes. We examine the fairness issue arising between ring nodes sharing a common data channel and show that the asynchronous CSMA/CA protocol suffers from bandwidth fragmentation and positional priority fairness problems. The paper proves that the phenomenon of bandwidth fragmentation represents the most important issue on asynchronous CSMA/CA protocol because it leads to bandwidth waste and thus increases unfairness for certain ring nodes. In this regard we explore limitations of a previous proposed solution, the so called traffic control architecture using remote descriptors (TCARD). Afterwards, we present an algorithm called Smart PACEd Transmission (SPACES) which deals with the aforementioned fairness problems. The desired scheme is based on a statistical and fully distributed mechanism to grant fair access to shared resources. As illustrated in this article SPACES alleviates performance degradation and resources underutilized while achieving fairness among ring nodes.
smart PACE transmission, distributed fairness algorithm, bus-based metropolitan optical network, asynchronous CSMA-CA protocol, carrier sense multiple access, collision avoidance, data channel, traffic control architecture, remote descriptor
T. Atmaca and D. Pupa, "A distributed fairness algorithm for bus-based metropolitan optical network," 2006 IEEE International Performance Computing and Communications Conference(PCC), Phoenix, AZ, USA, 2006, pp. 40.