In the literature, a BitTorrent-like peer-to-peer file-sharing system has been modelled as a system of addition-min fuzzy relational inequalities (FRIs). Finding all minimal solutions of such a system is considered a difficult task because the minimal solutions to addition-min FRIs are usually not unique and are often infinite in number. In this paper, we study the properties of the minimal solutions of such a system and propose an iterative algorithm to find the minimal solutions for any given solution (included the maximum solution). The proposed algorithm not only finds the minimal solutions efficiently, but also finds many minimal solutions in different iterative sequences of variables.

在文献中，类似于 BitTorrent 的点对点文件共享系统已被建模为加法最小模糊关系不等式 (FRIs) 系统。找到这样一个系统的所有最小解被认为是一项艰巨的任务，因为加法最小 FRI 的最小解通常不是唯一的，而且通常是无限的。在本文中，我们研究了这种系统的最小解的性质，并提出了一种迭代算法来找到任何给定解（包括最大解）的最小解。所提出的算法不仅有效地找到了极小解，而且在不同的变量迭代序列中找到了许多极小解。