Sciweavers

660 search results - page 3 / 132
» Parallel Computer Workload Modeling with Markov Chains
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Performance Modelling of Peer-to-Peer Routing
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
ECSQARU
2003
Springer
14 years 27 days ago
Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Weiru Liu, Xin Hong, Kenneth Adamson
TC
2010
13 years 2 months ago
Model-Driven System Capacity Planning under Workload Burstiness
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
PERCOM
2009
ACM
14 years 2 months ago
Markov Chain Existence and Hidden Markov Models in Spectrum Sensing
—The primary function of a cognitive radio is to detect idle frequencies or sub-bands, not used by the primary users (PUs), and allocate these frequencies to secondary users. The...
Chittabrata Ghosh, Carlos de M. Cordeiro, Dharma P...