DocumentCode
2169172
Title
Performance analysis of dynamic processes
Author
Upfal, Eli
Author_Institution
Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
fYear
2003
fDate
11-14 Oct. 2003
Firstpage
18
Abstract
The article covers various approaches for modeling and analyzing dynamic processes in networks. Modeling the dynamic performance as a stochastic process, we apply tools from discrete and continuous time Markov processes theory, renewal theory and queuing theory to analyze the long term, steady state performance of the processes. Non-stochastic approaches include adversarial queuing theory, and game theory techniques.
Keywords
Markov processes; computer network reliability; game theory; queueing theory; adversarial queueing theory; continuous time Markov process; discrete time Markov process; dynamic process; game theory technique; performance analysis; renewal theory; stochastic process; Computer networks; Computer science; Game theory; Markov processes; Performance analysis; Queueing analysis; Routing protocols; Steady-state; Stochastic processes; Stochastic systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on
ISSN
0272-5428
Print_ISBN
0-7695-2040-5
Type
conf
DOI
10.1109/SFCS.2003.1238176
Filename
1238176
Link To Document