Skip Navigation

The Computer Journal 2002 45(1):62-67; doi:10.1093/comjnl/45.1.62
© 2002 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tofts, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Traffic Modelling and Probabilistic Process Abstraction

C. Tofts1

1 HP Research Laboratories Bristol, Filton Road, Stoke Gifford, Bristol BS34 8QZ, UK Email: chrof@hpl.hp.com

State-based models provide an attractive and simple approach to performance modelling. Unfortunately, this approach gives rise to two fundamental problems: (1) capturing the input loads to a system efficiently within such presentations; and (2) coping with the explosion in the number of states when the system is compositionally presented. Both problems can be regarded as searching for some optimal representative state model with a minimal cost. In this paper we present a probabilistic feedback search approach (popularly referred to as a genetic algorithm) for locating good models with low (state) cost.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.