Performance investigation of an on‐line auction system

Hillston, Jane; Kloul, Leïla

doi:10.1002/cpe.546

Cited by 17 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our algorithm for this collapses the derivation graph at each model state and does not require a costly computation of bisimulation equivalence between components of the model. We have found it to be applicable in situations where the full derivation graph is too large even to be generated [20]. Further, we believe that many of the models which occur in practice would contain symmetries of the types which can be exploited by isomorphism.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

An efficient algorithm for aggregating PEPA models

Gilmore

Hillston

Ribaudo

2001

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Performance Evaluation Process Algebra (PEPA) is a formal language for performance modelling based on process algebra. It has previously been shown that using the process algebra apparatus compact performance models can be derived which retain the essential behavioural characteristics of the modelled system. However no efficient algorithm for this derivation was given. In this paper we present an efficient algorithm which recognises and takes advantage of symmetries within the model and avoids unnecessary computation. The algorithm is illustrated by a multiprocessor example.

show abstract

Section: Conclusion and Further Workmentioning

confidence: 99%

An efficient algorithm for aggregating PEPA models

Gilmore

Hillston

Ribaudo

2001

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…Reading is a purely local computation, whereas writing additionally uses the Logger service. In this model, Database is only accessed by the university portal in states External and Store in equations (4) and 7, respectively. Let PD denote the processor on which Database is deployed, acquired through action acquire pd .…”

Section: Databasementioning

confidence: 99%

“…Stochastic process algebras have been successfully used to construct performance models of a wide variety of systems for more than a decade [1,2,3,4,5,6,7,8,9,10]. The strength of these modelling languages stems from their ability to express a high-level compositional description of a system from which an underlying mathematical model can be rigorously derived.…”

Section: Introductionmentioning

confidence: 99%

Stochastic Process Algebras: From Individuals to Populations

Hillston¹,

Tribastone²,

Gilmore³

2011

The Computer Journal

View full text Add to dashboard Cite

In this paper we report on progress in the use of stochastic process algebras for representing systems which contain many replications of components such as clients, servers and devices. Such systems have traditionally been difficult to analyse even when using high-level models because of the need to represent the vast range of their potential behaviour. Models of concurrent systems with many components very quickly exceed the storage capacity of computing devices even when efficient data structures are used to minimise the cost of representing each state. Here, we show how population-based models which make use of a continuous approximation of the discrete behaviour can be used to efficiently analyse the temporal behaviour of very large systems via their collective dynamics. This approach enables modellers to study problems which cannot be tackled with traditional discrete-state techniques such as continuous-time Markov chains.

show abstract

“…Ezhilchelvan and Morgan (2001) designed a scalable decentralized auction service implemented in geographically dispersed servers satisfying the requirements of reliability and fairness between bidders in terms of chance of bid submission. In an attempt to alleviate the problems associated with network delay and servers overload Hillston and Kloul (2001) proposed the transferring of computing tasks from one server to a structured set of active nodes responsible not only for routing but also for bid checking, storage of recent bids, price information etc. Sheldon et al, (2002) presented an e-auction development methodology based on the combined use of Unified Modeling Language (UML)…”

Section: Figure 28mentioning

confidence: 99%

Προηγμένες Δημοπρασίες Σε Δυναμικές Αγορές

Μαρεντάκης¹

View full text Add to dashboard Cite

This thesis considers auctions as trading mechanisms in dynamic marketplaces. In the recent past, the evolution of Internet and wireless communications leveraged the wide and global expansion of auctions by abolishing time and location restrictions. These developments enabled the initiation of trade and participation for almost any type of entity like consumers, business, government etc. Moreover, the technological infrastructure facilitated and enhanced the implementation of more complex auction mechanisms introducing advanced properties like negotiation attributes, bundles of items, etc. The thesis focuses on the application of advanced forms of auctions in dynamic marketplaces where one or more of its dimensions are characterized by high variability. These dimensions can be, for example, the location of the trading item or market participants, the price, the available capacity, the number of participants, etc.An extended literature review mainly from the last decade yielded more than 450 research works dealing with auction mechanisms and corresponding auction theory, and more than 300 research works dealing with the implementation of auctions in electronic and mobile marketplaces. This number reflects the intensive research interest in the area of auctions. The extensive study of these resources demonstrated a serious gap on the systematic organization of auctions regarding the mechanism attributes, their parameters, and implementation instance. This thesis comes to bridge this gap by introducing a conceptual auction classification prototype that resulted from the intensive study of the research literature and the systematic unification of the findings. This model is conceptually defined as "Auction Classification Ecosystem -ACE" and it intends to be used in the future as the state-of-the-art model for auctions engineering.The ACE model consists of three discrete, yet strongly integrated Levels: (i) Level-1 supports the design of the basic auction mechanism, yet, it also supports the design of more complex multi-dimensional auction formats including special decision-making plug-ins, (ii) Level-2 deals with the enrichment of the core auction mechanism with additional parameters which entails enhancing characteristics related to, for example, robustness, fairness, competitiveness, etc., (iii) Level-3 aims on the efficient implementation of the auction supporting several types of decision-makers (e.g., auctioneer, technology provider, etc.) to organize the implementation of the auction and prioritize their actions depending on the implementation context. These layers can be used either independently of each other or in a sequential form. Overall, ACE is highly comprehensive and expandable and usuable, able to serve for: (i) the extensive and structured organization of auction-based dynamic marketplaces, (ii) the analysis of auction formats, (iii) the classification of literature and research findings (iv) the completeness in decision-making, (v) the expandability and integration with other research disciplines, a...

show abstract

Performance investigation of an on‐line auction system

Cited by 17 publications

References 11 publications

An efficient algorithm for aggregating PEPA models

An efficient algorithm for aggregating PEPA models

Stochastic Process Algebras: From Individuals to Populations

Προηγμένες Δημοπρασίες Σε Δυναμικές Αγορές

Contact Info

Product

Resources

About