Abstract

The paper develops a distributed systems architecture for dependable Internet based online auctions, meeting the requirements of data integrity, responsiveness, fairness and scalability. Current auction services essentially rely on a centralised auction server. Such an approach is fundamentally restrictive with respect to scalability. It is well-known that a tree-based, recursive design approach caters well for scalability requirements. With this observation in mind, the paper develops an approach that permits an auction service to be mapped on to globally distributed auction servers. The paper selects a suitable auction model that treats sellers and buyers symmetrically. This symmetry enables a computational node to play at one level of the tree the role of a seller by dealing with a group of potential buyers as well as to play the role of a potential buyer at the next higher level. Such a symmetric auction (also known as a double auction) is used for supporting a standard auction to be carried out in a hiarchic manner. An architecture is developed and basic algorithms and protocols are presented, together with correctness reasoning.

Keywords

double auctions, federated auction house, bid servers, the Internet, synchronous/asynchronous communication, deadlines, auction fairness