抄録
We consider the money distribution problem for a micro-payment scheme using distributed server system; in particular, for an automatic charging scheme named PayPerClick that allows internet users to view Web pages for which access charges are levied without tedious payment procedures. A major bottleneck in the scheme is the network traffic caused by the distribution of electronic money to many different servers. We propose a simple on-line algorithm for distributing electronic money to servers so that the network traffic is minimized. The algorithm achieves the optimal online competitive ratio. We also consider a weighted version, for which we give an asymptotically optimal online algorithm within a constant factor.
| 本文言語 | English |
|---|---|
| ページ | 527-536 |
| ページ数 | 10 |
| 出版ステータス | Published - 1999 1月 1 |
| イベント | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA 継続期間: 1999 1月 17 → 1999 1月 19 |
Other
| Other | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Baltimore, MD, USA |
| Period | 99/1/17 → 99/1/19 |
ASJC Scopus subject areas
- ソフトウェア
- 数学 (全般)