A more just measure of resource distribution in computer networks is proposed. Classic functions evaluate fairness only “on average”. The proposed new fairness score function ensures that no node is left without resources while on average everything looks good. It is compared with well-known and widely adopted function proposed by Jain, Chiu and Hawe and another one recently proposed fairness function by Chen and Zhang. The function...

The paper proposes an algorithm of bandwidth distribution, ensuring fairness to end-users in computer networks. The proposed algorithm divides users into satisfied and unsatisfied users. It provides fairness in terms of quality of experience (QoE) for satisfied users and quality of service (QoS) for unsatisfied users. In this paper, we present detailed comparisons relevant to service providers to show the advantages of the proposed...

The fairness problem was presented. Popular fairness concepts and measures were shown. The RPR fairness mechanism and the SAT mechanism were described. A modification of the SAT algorithm, adapted to the possibilities of Ethernet cards used for implementation of a dual-ring RPR-based network, was proposed. Performance of the proposed modification was measured. Jain's and Chen's fairness indexes were calculated. Effectiveness comparison...

These days, it is quite a challenge for app owners to keep users engaged with an app. Currently, the level of user abandonment is one of the key parameters that application owners are interested in. To meet these challenges, we are conducting an extended study of a previously proposed solution that significantly reduces the abandonment rate of a given application. The investigated solution is based on the methods of fairness using...