Research Article
Performance investigation of an on-line auction system
Article first published online: 27 FEB 2001
DOI: 10.1002/cpe.546
Copyright © 2001 John Wiley & Sons, Ltd.
Issue
1532-0634/asset/cover.gif?v=1&s=6094df24c795ce080ff6df6ff3b6bcec19adb708)
Concurrency and Computation: Practice and Experience
Special Issue: High performance agent systems
Volume 13, Issue 1, pages 23–41, January 2001
Additional Information
How to Cite
Hillston, J. and Kloul, L. (2001), Performance investigation of an on-line auction system. Concurrency and Computation: Practice and Experience, 13: 23–41. doi: 10.1002/cpe.546
Publication History
- Issue published online: 27 FEB 2001
- Article first published online: 27 FEB 2001
Funded by
- CNRS/Royal Society. Grant Number: UIIVV 78171
- Abstract
- References
- Cited By
Keywords:
- active networks;
- agent systems;
- electronic commerce;
- load balancing;
- stochastic process algebra
Abstract
The standard design of on-line auction systems places most of the computational load on the server and its adjacent links, resulting in a bottleneck in the system. In this paper, we investigate the impact, in terms of the performance of the server and its adjacent links, of introducing active nodes into the network. The performance study of the system is done using the stochastic process algebra formalism PEPA. Copyright © 2001 John Wiley & Sons, Ltd.

1532-0634/asset/olbannerleft.gif?v=1&s=a4e4e145787de94e1d91eaab3c8c29d8a9d96a26)