direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications of KBS

Fair Overload Handling using Proof-Of-Work Functions
Citation key GoMu:2006:FairOverloadHandling
Author Sebastian Golze and Gero Mühl
Title of Book IEEE/IPSJ International Symposium on Applications and the Internet (SAINT 2006)
Pages 14–21
Year 2006
ISBN 0-7695-2508-3
Address Phoenix, Arizona, USA
Month jan
Publisher IEEE Computer Society
Abstract Overload can reduce the overall performance of a computer system up to a point where the whole service might collapse. Thus, for example the load on a server must be controlled to achieve optimal system performance. Doing so some requests from clients must be rejected. We show that we can distinguish four different types of user profiles, why micropayments are no suitable solution and how a proof-of-work based system can be used to allocate the rare resources slots to those clients that generate the maximal use out of these requests. We then present the new HashCashLin function we developed in order to overcome the poor adjustment possibilities of the classic HashCash function and how such a proof-of-work can be augmented. We describe our proof-of-work auction system and finally we show the results obtained by running a simulated model of our system.
Link to publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions