Designing wide area networks and internetworks: a practical guide
Designing wide area networks and internetworks: a practical guide
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
An Approach to Optimal Peering Between Autonomous Systems in the Internet
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Hi-index | 0.00 |
Today's Internet is a loose federation of independent network providers, each acting in their own self interest. With the ISPs forming with peer relationship under this economic reality, [1] proves that the total cost of “hot potato” routing is much worse than the optimal cost and then gives a price mechanism—one ISP charges the other a price per unit flow, to prevent this phenomenon. However, with its mechanism the global welfare loss may be arbitrarily high. In this paper we propose a new price mechanism—one ISP charges the other a given fee for different flow scale. With our mechanism, we show that if both ISPs agree on splitting the flow according to the max global welfare the charging ISP will get more profit and the charged ISP will achieve the least cost. And our new mechanism can almost eliminate the welfare loss. Finally, some instances are given and the results show that our mechanism is much more effective than that in [1].