Abstract

Considering the requirement of the biggest download speed, a Peer-to-Peer (P2P) file sharing system can be reduced into a system of max–min fuzzy relation inequalities. In order to decrease the network congestion under some fixed priority grade of the terminals, fuzzy relation lexicographic programming is proposed to model the P2P file sharing system. For solving the proposed problem, we define concept of feasible index set and discuss some simple properties. Based on the feasible index set, a novel algorithm is developed to find the optimal solution with an illustrative example.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.