Skip to Main Content
This paper studies the problem of service allocation and scheduling of real-time messages in peer-to-peer wireless networks. Using stochastic network theory and optimization we propose a model that allows us to design a dynamic service allocation algorithm that maximizes the total network utility while meeting deadline constraints, by appealing to connections between Lagrange multipliers and deficits in service. The model allows for general interference constraints and arrival models. Using simulations we compare our algorithm against an optimal solution proposed for scheduling persistent real-time traffic and show the limitations of that approach to handle real-time messages for providing fairness.