60 Hits in 2.9 sec

Path-wise performance in a tree-type network: Per-stream loss probability, delay, and delay variance analyses

Huei-Wen Ferng, Chi-Chao Chao, Cheng-Ching Peng
2007 Performance evaluation (Print)  
First deriving the per-stream loss probability, delay, and delay variance of an isolated queue with multi-class input streams modeled by heterogeneous two-state Markovmodulated Poisson processes (MMPPs  ...  In this paper, we investigate continuous-time tree-type queueing networks with Markovian external input models, i.e., MMPPs.  ...  Without loss of generality, we may regard the original queue as a queue with only two input streams, one tagged stream with traffic load ρ t and the other aggregated cross stream with traffic load ρ c  ... 
doi:10.1016/j.peva.2006.01.003 fatcat:6vb6rggp3zhn3oto2hcmcewbce

Connection-wise end-to-end performance analysis of queueing networks with MMPP inputs

Huei-Wen Ferng, Jin-Fu Chang
2001 Performance evaluation (Print)  
For the tagged departure process of an H-MMPPs/G/1 queue, we propose two decomposition schemes to approximate the output process of a tagged traffic stream which is mixed with other traffic streams.  ...  A systematic method for link/connection-wise end-to-end performance evaluation in queueing networks receiving heterogeneous Markov-modulated Poisson processes (H-MMPPs) is proposed.  ...  In this paper, we again employ this approach to analyze a network of queues with heterogeneous MMPP inputs.  ... 
doi:10.1016/s0166-5316(00)00036-5 fatcat:o4cjik2w5vap3crmdo7q6emm4y

Performance of broadcast and unknown server (BUS) in ATM LAN emulation

Hairong Sun, Xinyu Zang, K.S. Trivedi
2001 IEEE/ACM Transactions on Networking  
With the help of SPNP(Stochastic Petri Net Package), a software package for the automated genaration and solution of Markovian stochastic systems, and the decomposition method, the performance of the BUSa  ...  Over the last decade, ATM (Asynchronous Transfer Mode) technology has emerged as a key component of next generation networks.  ...  The frames generated according to the MMPP have three possible sizes, 2 cells (with probability c 1 ), 4 cells (with probability c 2 ), and 32 cells (with probability c 3 ).  ... 
doi:10.1109/90.929857 fatcat:oeluf3h5bjbdleydydbbfqhiru

Markov models of internet traffic and a new hierarchical MMPP model

L. Muscariello, M. Mellia, M. Meo, M. Ajmone Marsan, R. Lo Cigno
2005 Computer Communications  
The proposed model is simple and intuitive: its parameters have a physical meaning, and the model can be tuned with only a few input parameters.  ...  Results prove that the queuing behavior of the traffic generated by the MMPP model is coherent with the one produced by real traces collected at our institution edge router under several different traffic  ...  The results show a better agreement with the generated traffic with respect to simple Poisson and MMPP generators (although the structure of the MMPP is not defined).  ... 
doi:10.1016/j.comcom.2005.02.012 fatcat:c6jghd757vecletjm6tlha5eaq

Using Maximum Entropy Principle for Output Burst Characterization of an ATM Switch [chapter]

T. Srinivasa Roa, Sanjay K. Bose, K. R. Srivathsan
1996 IFIP Advances in Information and Communication Technology  
Numerical experiments are carried out and compared with the simulation results.  ...  Maximum Entropy Principle is used in deriving an approximate expression for the burst length of a tagged call at the output of an ATM switch.  ...  Without loss of generality, we consider the size of a cell to be 53 bytes (ATM standard).  ... 
doi:10.1007/978-0-387-35068-4_2 fatcat:fiefgn5dmbgwvgm24bjqpdjl5m

An efficient technique to analyze the impact of bursty TCP traffic in wide-area networks

Michele Garetto, Don Towsley
2008 Performance evaluation (Print)  
The model also provides original insights into the impact on the network of long-tail flow length distributions, and allows the effectiveness of "TCP pacing" in reducing the traffic burstiness to be evaluated  ...  The analytical predictions are validated against detailed simulation experiments, and prove to be accurate and robust under a variety of operating conditions.  ...  Readers familiar with queueing networks will find it simpler to think of it as an open network of ·/G/∞ queues where each customer in a given queue represents a TCP connection in a given protocol state  ... 
doi:10.1016/j.peva.2007.05.003 fatcat:mx4fxh46yrhjlfymr7my75g4vi

A Robust Queueing Network Analyzer Based on Indices of Dispersion [article]

Ward Whitt, Wei You
2020 arXiv   pre-print
We develop a robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueing network of single-server queues with Markovian routing.  ...  We focus on the customer flows, defined as the continuous-time processes counting customers flowing into or out of the network, or flowing from one queue to another.  ...  In Kim [28, 29] , a decomposition approximation of queueing networks based on MMPP(2)/GI/1 queues was investigated.  ... 
arXiv:2003.11174v1 fatcat:oalegvnndfhntpkzludyfndsta

Circulant approximation for preconditioning in stochastic automata networks

Wai Ki Ching, Xun Yu Zhou
2000 Computers and Mathematics with Applications  
Stochastic Automata Networks (SANs) are widely used in modeling practical systems such as queueing systems, communication systems, and manufacturing systems.  ...  Usually, the steadystate distributions have no close form solutions and cannot be obtained efficiently by direct methods such as LU decomposition due to the huge size of the generator matrices.  ...  The input of the queue comes from the superposition of several independent MMPPs, which is still an MMPP and is parameterized by two 2 n x 2 n matrices (Q, F).  ... 
doi:10.1016/s0898-1221(99)00341-7 fatcat:uljov47uzjbxbnnb4tluwtlm5e

Circulant preconditioners for stochastic automata networks

Raymond H. Chan, Wai Ki Ching
2000 Numerische Mathematik  
Very often, direct methods such as the LU decomposition are ine cient because of the huge size of the generator matrices. An e cient algorithm should make use of the structure of the matrices.  ...  The SAN approach gives a more compact and e cient representation of the network when compared to the stochastic Petri nets approach.  ...  Olof Widlund for introducing him to the subject of queueing networks and his guidance and help all through the years.  ... 
doi:10.1007/s002110000173 fatcat:6qctfbjsjvbxlarqucaf3l43qe

Decomposition-Based Queueing Network Analysis with FiFiQueues [chapter]

Ramin Sadre, Boudewijn R. Haverkort
2010 International Series in Operations Research and Management Science  
FiFiQueues allows for the efficient analysis of large open queueing networks of which the interarrival and service time distributions are of phase-type; individual queues, all with single servers, can  ...  In this chapter we present an overview of decomposition-based analysis techniques for large open queueing networks.  ...  with FiFiQueues Decomposition-Based Queueing Network Analysis with FiFiQueues Decomposition-Based Queueing Network Analysis with FiFiQueues Decomposition-Based Queueing Network Analysis  ... 
doi:10.1007/978-1-4419-6472-4_15 fatcat:naa6mbmeofgk7h7ylxb354c3bi

A functional central limit theorem for Markov additive arrival processes and its applications to queueing systems

Hongyuan Lu, Guodong Pang, Michel Mandjes
2016 Queueing systems  
It is applied to an infinite-server queue and a fork-join network with a non-exchangeable synchronization constraint, where in both systems both the arrival and service processes are modulated by a Markov  ...  We prove FCLTs for the queue length processes in these systems joint with the arrival and departure processes, and characterize the transient and stationary distributions of the limit processes.  ...  Hongyuan Lu and Guodong Pang acknowledge the support from the NSF grant CMMI-1538149.  ... 
doi:10.1007/s11134-016-9496-8 fatcat:zh6cxc4egfhwfhrj2d3zml4y4u

Provisioning of Computing Resources for Web Applications under Time-Varying Traffic

Ali Rajabi, Johnny W. Wong
2014 2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems  
The effectiveness of MMPP is evaluated by comparing the performance results through simulation, using as input the synthetic trace and job arrivals generated by the fitted MMPP.  ...  In our investigation of MMPP as a traffic model, an available workload generator is extended to produce a synthetic trace of job arrivals with a controlled level of time-variation, and an MMPP is fitted  ...  Results on queueing network models with MMPP arrivals have been reported in [52, 53] . Each node in the network is a single server queue with general service time distribution.  ... 
doi:10.1109/mascots.2014.27 dblp:conf/mascots/RajabiW14 fatcat:b3u277t4cvampddjf5ipmwefxu

Transient analysis of deterministic and stochastic Petri nets with concurrent deterministic transitions

Christoph Lindemann, Axel Thümmler
1999 Performance evaluation (Print)  
This paper introduces an efficient numerical algorithm for transient analysis of deterministic and stochastic Petri nets (DSPNs) and other discrete-event stochastic systems with exponential and deterministic  ...  The proposed approach is based on the analysis of a general state space Markov chain (GSSMC) whose state equations constitute a system of multidimensional Fredholm integral equations.  ...  Christoph Lindemann is an Associate Professor in the Department of Computer Science at the University of Dortmund and leading the Computer Systems and Performance Evaluation group.  ... 
doi:10.1016/s0166-5316(99)00020-6 fatcat:j5gndxgyhba3xaej3alejeo2oi

Bandwidth allocation under end-to-end percentile delay bounds

Bushra Anjum, Harry Perros, Xenia Mountrouidou, Kimon Kontovasilis
2011 International Journal of Network Management  
The path through an IP network is depicted by a tandem queueing network of infinite capacity queues, where each queue represents the output port of a router.  ...  In the first algorithm, we assume that the arrival process to the first queue of the queueing network is bursty and correlated and the service times are exponentially distributed.  ...  Feng and Chang [46] used single-node decomposition to analyze a tandem queueing network with general service times where the arrival process to the first queue consisted of multiple heterogeneous MMPPs  ... 
doi:10.1002/nem.783 fatcat:z3s5maemznfqfnlklu5rv7rssq

Traffic Modeling of IP Networks Using the Batch Markovian Arrival Process [chapter]

Alexander Klemm, Christoph Lindemann, Marco Lohmann
2002 Lecture Notes in Computer Science  
Using measured traffic data, a comparative study with the MMPP and the Poisson process illustrates the effectiveness of the customized BMAP for IP traffic modeling by visual inspection of sample paths  ...  Moreover, we identify the BMAP as an analytically tractable model of choice for aggregated traffic modeling of IP networks.  ...  Without loss of generality, we assume 0 0 t = and n t T = .  ... 
doi:10.1007/3-540-46029-2_6 fatcat:p2afo6bhgzfflirel7a6ynoikm
« Previous Showing results 1 — 15 out of 60 results