### Abstract

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.

Original language | English |
---|---|

Pages | 527-536 |

Number of pages | 10 |

Publication status | Published - 1999 Jan 1 |

Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: 1999 Jan 17 → 1999 Jan 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

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'Optimal on-line algorithms for an electronic commerce money distribution system'. Together they form a unique fingerprint.

## Cite this

*Optimal on-line algorithms for an electronic commerce money distribution system*. 527-536. Paper presented at Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, .