Results 1  10
of
592,208
Accuracy vs Efficiency of Hyperexponential Approximations of the Response Time Distribution of MMPP/M/1 Queues
, 2008
"... The Markov Modulated Poisson Process (MMPP) has been shown to well describe the flow of incoming traffic in networked systems, such as the Grid and the WWW. This makes the MMPP/M/1 queue a valuable instrument to evaluate and predict the service level of networked servers. In a recent work we have pr ..."
Abstract
 Add to MetaCart
provided an approximate solution for the response time distribution of the MMPP/M/1 queue, which is based on a weighted superposition of M/M/1 queues (i.e. a hyperexponential process). In this article we address the tradeoff between the accuracy of this approximation and its computational cost. By jointly
RESEARCH ARTICLE Accuracy vs Efficiency of Hyperexponential Approximations of the Response Time Distribution of MMPP/M/1 Queues
, 2008
"... The Markov Modulated Poisson Process (MMPP) has been shown to well describe the flow of incoming traffic in networked systems, such as the Grid and the WWW. This makes the MMPP/M/1 queue a valuable instrument to evaluate and predict the service level of networked servers. In a recent work we have pr ..."
Abstract
 Add to MetaCart
provided an approximate solution for the response time distribution of the MMPP/M/1 queue, based on a weighted superposition of M/M/1 queues (i.e. a hyperexponential process). In this article we address the tradeoff between the accuracy of this approximation and its computational cost. By jointly
Fast Computation of Hyperexponential Approximations of the Response Time Distribution of MMPP/M/1 Queues
, 2008
"... Input characterization to describe the flow of incoming traffic in network systems, such as the GRID and the WWW, is often performed by using Markov Modulated Poisson Processes (MMPP). Therefore, to enact capacity planning and QualityofService (QoS) oriented design, the model of the servers that r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that receive the incoming traffic is often described as a MMP P/M/1 queue. In a recent work we have provided an approximate solution for the response time distribution of the MMP P/M/1 queue, which is based on a hyperexponential process obtained via a weighted superposition of the response time distributions
An equivalent random method with hyperexponential service
 Perform. Eval
, 2004
"... The Equivalent Random Method (ERM) has been widely used to predict blocking probabilities at overflow service stations. The method assumes that service times follow an exponential distribution. While this may be a reasonable assumption for voice traffic, it is not a good assumption for dialup Inter ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
up Internet traffic, where service times typically have a coefficient of variation (standard deviation/mean) greater than 1. In this paper, we give a modified ERM for twoterm hyperexponential service distributions. The method is based on an efficient algorithm to estimate the peakedness of the overflow
Approximate Signal Processing
, 1997
"... It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing these tra ..."
Abstract

Cited by 516 (2 self)
 Add to MetaCart
It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing
Internet time synchronization: The network time protocol
, 1989
"... This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a selforganizing, hierarchi ..."
Abstract

Cited by 617 (15 self)
 Add to MetaCart
This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a self
Efficient similarity search in sequence databases
, 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract

Cited by 505 (21 self)
 Add to MetaCart
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 545 (1 self)
 Add to MetaCart
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like
DISTRIBUTED SYSTEMS
, 1985
"... Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence. ..."
Abstract

Cited by 755 (1 self)
 Add to MetaCart
Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence.
Results 1  10
of
592,208