Results 11  20
of
271
Asymptotic Throughput of Continuous Timed Petri Nets
, 1995
"... We set up a connection between Continuous Timed Petri Nets (the fluid version of usual Timed Petri Nets) and Markov decision processes. We characterize the subclass of Continuous Timed Petri Nets corresponding to undiscounted average cost structure. This subclass satisfies consetration laws and show ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
and shows a linear growth: one obtains as mere application of existing results for Dynamic Programming the existence of an asymptotic throughput. This rate can be computed using Howardtype 'algorithms, or by an extension of the well known cycle time formula for timed event graphs. We present
On the Modeling of Delay and Burstiness for Calculating Throughput
"... Abstract—This paper presents a formula for the throughput of a network considering the bursty nature and delay requirements of real sources by using the established results in the area of guaranteed rate scheduling. The network of which the throughput is derived, implements aggregate scheduling whic ..."
Abstract
 Add to MetaCart
Abstract—This paper presents a formula for the throughput of a network considering the bursty nature and delay requirements of real sources by using the established results in the area of guaranteed rate scheduling. The network of which the throughput is derived, implements aggregate scheduling
TCP is MaxPlus Linear and what it tells us on its throughput
 in &quot;Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
, 2000
"... We give a representation of the packetlevel dynamical be havior of the Reno and Tahoe variants of TCP over a sin gle endtoend connection. This representation allows one to consider the case when the connection involves a net work made of several, possibly heterogeneous, deterministic or random ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
leads to closed form formulas for the throughput allowed by TCP under natural assumptions on the behavior of the routers and on the detection of losses and timeouts; these new formulas are shown to refine those obtained from earlier models which either assume that the network could be reduced to a
New insights from a fixedpoint analysis of single cell
 IEEE 802.11 WLANs. In: Proc. IEEE Infocom 2005
, 2005
"... Abstract—We study a fixedpoint formalization of the wellknown analysis of Bianchi. We provide a significant simplification and generalization of the analysis. In this more general framework, the fixedpoint solution and performance measures resulting from it are studied. Uniqueness of the fixed po ..."
Abstract

Cited by 69 (4 self)
 Add to MetaCart
point is established. Simple and general throughput formulas are provided. It is shown that the throughput of any flow will be bounded by the one with the smallest transmission rate. The aggregate throughput is bounded by the reciprocal of the harmonic mean of the transmission rates. In an asymptotic
Combined Use Of Genetic Programming And Decomposition Techniques For The Induction Of Generalized Approximate Throughput Formulas In Short Exponential Production Lines With Buffers
, 2002
"... An attempt is made to combine standard decomposition techniques and genetic programming approaches, for the induction of generalized approximate throughput formulas in short exponential serial production lines with finite intermediate buffers. The domain of serial production lines lacks the existenc ..."
Abstract
 Add to MetaCart
the existence of general formulas for acquiring useful measurements and line characteristics, such as throughput. Throughput approximation in literature takes place usually with the aid of algorithmic computerbased decomposition techniques. In this paper, decompositionbased data for every different number
COMBINED USE OF GENETIC PROGRAMMING AND DECOMPOSITION TECHNIQUES FOR THE INDUCTION OF GENERALIZED APPROXIMATE THROUGHPUT FORMULAS IN SHORT EXPONENTIAL PRODUCTION LINES WITH BUFFERS
"... Abstract: An attempt is made to combine standard decomposition techniques and genetic programming approaches, for the induction of generalized approximate throughput formulas in short exponential serial production lines with finite intermediate buffers. The domain of serial production lines lacks th ..."
Abstract
 Add to MetaCart
the existence of general formulas for acquiring useful measurements and line characteristics, such as throughput. Throughput approximation in literature takes place usually with the aid of algorithmic computerbased decomposition techniques. In this paper, decompositionbased data for every different number
Research Article Combining ZHENG Theory and HighThroughput Expression Data to Predict New Effects of Chinese Herbal Formulae
, 2012
"... which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. ZHENG is the key theory in traditional Chinese medicine (TCM) and it is very important to find the molecular pharmacology of traditional Chinese herbal formulae. One ZHENG is r ..."
Abstract
 Add to MetaCart
deficiency and Bloodstasis syndrome) before treatment and after being treated with Fuzheng Huayu Capsule were analyzed by a highthroughput gene microarraysbased drug similarity comparison method, which could find the small molecules which had similar effects with Fuzheng Huayu Capsule. Besides getting the results
ABSTRACT Modeling the Throughput of TCP Vegas
"... Previous analytic models of TCP Vegas throughput have been developed for lossfree (allVegas) networks. This work develops a simple and accurate analytic model for the throughput of a TCP Vegas bulk transfer in the presence of packet loss, as a function of average round trip time, minimum round tri ..."
Abstract
 Add to MetaCart
, congestion avoidance, and congestion recovery. The results include (1) a simple, validated model of TCP Vegas throughput that can be used for equationbased rate control of other flows such as UDP streams, (2) a simple formula to determine, from the measured packet loss rate, whether the network buffers
Wireless Channel Parameters Maximizing TCP Throughput
 in "IMA Volumes in Mathematics and its Applications", Volume on Wireless Communications
"... Abstract — We consider a single TCP session traversing a wireless channel, with a constant signal to noise ratio (SINR) at the receiver. We consider the problem of determining the optimal transmission energy per bit, to maximize TCP throughput. Specifically, in the case where direct sequence spread ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
throughput. Finally, we discuss the issue of assigning target SINR values. In order to carry out our analysis, we obtain a TCP throughput formula in terms of the packet transmission error probability p and the transmission capacity C, which is of independent interest. In our TCP model, the window size is cut
Approaching ThroughputOptimality in a Distributed CSMA Algorithm: Collisions and Stability
, 2009
"... It was shown recently that CSMA (Carrier Sense Multiple Access)like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions [1]. One idealized assumption is that the sensing time is negligible, so that there is no colli ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
that there is no collision. In this paper, we study more practical CSMAbased scheduling algorithms with collisions. First, we provide a model and give an explicit throughput formula, which has a simple productform due to the quasireversibility structure of the model. Second, we show that the algorithm in [1] can
Results 11  20
of
271