On the Implementation of Matching Theory Based Resource Allocation in Networking Testbeds

In this paper, we demonstrate the implementation of a matching theory based algorithm that extends the well known Top-Trading-Cycles (TTC) in the resource allocation mechanism of the NITOS networking testbed. We first provide an overview of prominent networking testbeds and the common approach that is used for the allocation of testbed resources to experimenters. We briefly describe our extended TTC algorithm and how it is applied in the enhanced architecture of NITOS resource allocation framework, by illustrating the interactions that take place between the testbed users and the testbed management services.