Path routing algorithms for max-min fair share networks considering service satisfaction of users

摘要

This paper studies on path routing algorithms for multi-media networks that maintain max-min fair share semantics. In order to clarify the fairness among services, we introduce a function that represents the degree of user's satisfaction obtained from a telecommunication service. We assume that service satisfaction of a user depends only on the amount of network resources allocated to the user. By using the satisfaction function, we describe the resource allocation process as an iteration algorithm that can maximize the minimum service satisfaction in each link. For the purpose of supporting different network policies, we investigate two different path routing schemes, Vacant-Shortest Scheme and Shortest-Widest Scheme. Effectiveness of the path routing algorithms in the max-mm fair share networks is numerically evaluated.