Lecture, four hours; outside study, eight hours. Requisite: course 131A. Stochastic processes as applied to study of telecommunication systems, traffic engineering, business, and management. Discrete-time and continuous-time Markov chain processes. Renewal processes, regenerative processes, Markov-renewal, semi-Markov and semiregenerative stochastic processes. Decision and reward processes. Applications to traffic and queueing analysis of basic telecommunications and computer communication networks, Internet, and management systems. Letter grading.