loading...
Performance Analysis of Dynamic Network Processes
Cambridge, Massachusettes October 11-October 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.2003.123817644th Annual IEEE Symposium on Foundat ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eli Upfal, Brown University
This tutorial 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 continues time Markov processes theory, renewal theory and queueing theory to analyze the long term, steady state, performance of the processes. Non-stochastic approaches include adversarial queueing theory, and game theory techniques.
Citation:
Eli Upfal, "Performance Analysis of Dynamic Network Processes," focs, pp.18, 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.