Showing papers in "Performance Evaluation in 2006"

TL;DR: An approximate analytic model is constructed for the case of LCD interconnection of LRU caches and used to gain a better insight as to why the LCD interconnections yields an improved performance.

TL;DR: This paper systematically model and analyze worm propagation under various scanning strategies, such as uniform scan, routing scan, hit-list scan, cooperative scan, local preference scan, sequential scan, divide-and-conquer scan, target scan, etc, and reveals the underlying similarity and relationship between different worm scanning strategies.

TL;DR: The key technical ingredient of the approach is a deep result of stochastic processes indicating that samples taken from consecutive steps of a random walk on an expander graph can achieve statistical properties similar to independent sampling.

TL;DR: In this article, the authors studied an M/G/1 queue with multiple vacations and exhaustive service discipline such that the server works with different service times rather than completely stopping service during a vacation.

TL;DR: It is found that some intuitive 'fairness' notions may unexpectedly lead to 'unfair' allocations, which do not provide the right incentives for peers, and implementation of P2P systems may want to compromise the degree of ' fairness' in favor of maintaining system robustness and reducing overheads.

TL;DR: An algorithm for mapping a general distribution, G, to a PH distribution, which matches the first three moments of G, which is referred to as Erlang-Coxian (EC) distributions.

TL;DR: A constant-degree P2P architecture, namely Cycloid, which emulates a cube-connected-cycles (CCC) graph in the routing of lookup requests and achieves a time complexity of O(d) per lookup request by using O(1) neighbors per node.

TL;DR: This paper proposes an algorithm for load balancing in heterogeneous, dynamic P2P systems that provide a DHT abstraction and shows that the efficiency and performance improvement demonstrated over the case of no load balancing shows that this technique holds promise for deployed systems.

TL;DR: This paper derives per-flow end-to-end delay bounds in aggregate scheduling networks in which per-egress (or sink-tree) aggregation is in place, and flows traffic is aggregated according to a FIFO policy based on Network Calculus.

TL;DR: It is shown, using a renewal approach, that the stationary distribution is expressed as a linear combination of two matrix-exponential terms and briefly indicates how these terms may be computed in an efficient and numerically stable manner.

TL;DR: SimQPN is presented--a simulation tool for QPNs that provides an alternative approach to analyze QPN models, circumventing the state space explosion problem and proposes a methodology for analyzing QPN model analysis by means of discrete event simulation.

TL;DR: Since SMART targets both the classroom and realistic industrial settings as a learning, research, and application tool, it is written in a modular way that allows for easy integration of new formalisms and solution algorithms.

TL;DR: This work presents an approach for solving the calibration of model parameters, such as the service requirements of various job classes, in the queueing network framework using inference techniques using an efficient and robust solution method.

TL;DR: This work considers a multi-server retrial queueing model in which customers arrive according to a Markovian arrival process (MAP) and performs steady state analysis of the model using direct truncation and matrix-geometric approximation.

TL;DR: A taxonomy based on three categories is proposed, which permits us to identify analogies and differences among the indexes commonly used among the prefetching techniques, and to suggest which indexes should be selected when performing evaluation studies depending on the different elements in the considered web architecture.

TL;DR: The overall blocking probability turns out to be approximated with high accuracy by several methods, however, the individual blocking probabilities per class are significantly more accurate for the method that is introduced in this paper.

TL;DR: A stochastic fluid flow model to compute the transfer time distribution of resources in peer-to-peer file sharing applications and the impact of file popularity, bandwidth characteristics, concurrent downloads and uploads, cooperation level among peers, and user behavior is proposed.

TL;DR: This paper analyzes the short-term behavior of IEEE 802.11 using the embedded-Markov chain method to answer the following two questions: once a node gets control of the medium, what is the average number of packets this node can transmit consecutively without experiencing any collision, and once a nodes loses its control of a medium, how long the node has to wait before it gets controlOf the medium again.

TL;DR: This paper forms the Markovian multi-server queue with a single vacation (e,d)-policy as a quasi-birth-and-death (QBD) process and develops the various stationary performance measures for this system.

TL;DR: This paper adds a correlation parameter to the first three moments of the marginal distribution to construct a Markovian arrival process of second order (MAP(2), and presents an algorithm that decides whether the correlation parameter is permissible with respect to the three moments and delivers a valid MAP(2) which matches the four parameters.

TL;DR: This paper considers a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme, and derives expressions for the probability generating function of the system contents and the packet delay.

TL;DR: This paper considers a two-stage tandem G-queue with blocking, service requirements of phase type and arrivals of units and of signals - which cancel one unit waiting in line or in service - both assumed to be Markovian arrival processes.

TL;DR: Two Markov chain queuing models have been developed to obtain closed-form solutions for packet delay and packet throughput distributions in a real-time wireless communication environment using IEEE 802.11 DCF.

TL;DR: It is found that multiple slow servers are often preferable, and it is demonstrated exactly how many servers are preferable as a function of the load and service time distribution.

TL;DR: In the current special issue, a selection of three papers from TOOLS 2003 are presented, and have been extended and considerably improved by their authors to reach their current form.

TL;DR: This paper presents significant results on the transient and steady-state analysis of statistical multiplexers with N input links and correlated train arrivals and shows how the transient analysis provides insights into the derivation of the system's busy period distribution.

TL;DR: Detailed studies of the buffer overflow period in a batch arrival queue are presented and theoretical results are illustrated via numerical examples.

TL;DR: This paper focuses on two popular ad hoc broadcasting schemes and provides their detailed analysis in one-dimensional and two-dimensional ideal networks and reveals new relationships between network parameters and the performance metrics.

TL;DR: Compared to the non-secure DSR ad hoc routing protocol, the results indicate clearly that anonymity can be achieved in mobile ad hoc networks and the additional overhead of the scheme is reasonably low.

TL;DR: The page fault equation is derived with the help of a conjectured invariant on the interaction between reference behavior and replacement policy and can be used for energy conservation and capacity planning, characterizing the memory requirement of software and managing memory allocation, modeling of processor cache misses and database buffer management.