Maximal network for best effort services with fair availability

The Internet was not originally designed to prevent malicious users from securing more resources than other users. Although the best effort service offered by the Internet is quite well known, realizing fair availability in the best effort service is becoming necessary. Accordingly, this paper proposes the maximal network that realizes fair availability. This new concept has two points (1) all users are guided to use some form of (adequate) rate control by the incentives of the proposed maximal network (2) the fair availability between rate controlled users is provided. As guidance, the proposed network penalizes users who refuse to use rate control. Using a distributed algorithm to realize max-min distribution, the proposed network offers fair availability. Its implementation is described and its feasibility is evaluated by computer simulations. It is shown that fair availability can be realized. Lastly, the concept of multi-class best effort service is proposed and simulations show that this service is possible in the maximal network