Characterization and synthesis of markovian workload models

Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


We consider the general problem of workload model generation using Markovian Arrival Processes (MAPs). MAPs are a large class of analytically tractable processes frequently used in communication and computer network modeling. We show that MAP moment and autocorrelation formulas admit a simple scalar form deriving from spectral properties of the MAP defining matrices. This suggests a new approach for studying MAPs, by which we address challenging characterization and fitting problems as well as the open issue of synthesizing processes with prescribed moments and acf for inter-arrival times. A case study illustrates the impact of spectral-based synthesis on sensitivity analysis of network models.

Original languageEnglish (US)
Title of host publication2007 IEEE Globecom Workshops
StatePublished - 2007
Externally publishedYes
Event2007 IEEE Globecom Workshops - Washington, DC, United States
Duration: Nov 26 2007Nov 30 2007

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


Other2007 IEEE Globecom Workshops
CountryUnited States
CityWashington, DC

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Characterization and synthesis of markovian workload models'. Together they form a unique fingerprint.

Cite this