Department of Computer Engineering
S E M I N A R
Network Decomposition and Fixed-Point Iterations
Today, obtaining various performance measures of complex systems, such as queueing networks, composed of many interacting subsystems still remains a challenging problem. Indeed, only a small class of queueing networks can be analyzed easily for their performance measures. This class of networks are called product form and require specific Markovian conditions on their arrival and service processes. On the other hand, obtaining performance measures for queueing networks with general arrival and service processes and arbitrary queue sizes is difficult. In that case, one may either resort to approximative techniques or to simulation. In this talk, we discuss our ongoing reserch on devising a general fixed-point iteration based on network decomposition which will enable us to solve for performance measures exactly up to machine precision.
DATE: November14, 2005, Monday@ 16:40
PLACE: EA 409