Fair charging policies and minimum-expected-cost routing in internets with packet loss

An economics-based definition of fair pricing is proposed, and fair, simple, and mathematically sound charging policies are derived that properly handle costs and risks in lossy internetworks. Also described are simple and efficient source-based algorithms (having both link-state and distance-vector versions) for computing the optimal routing tables with respect to the new charging measures. These charging measures and algorithms have the property that, by minimizing the individual domain´s expenses, they also minimize the global resource consumption. In addition, a distributed destination-based algorithm is presented for computing optimal paths that allows for faster response time in highly dynamic and unreliable internets. Finally, preliminary accounting procedures are presented for implementing the proposed charging policies