Performance modeling of communication networks with Markov chains

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

Abstract

This book is an introduction to Markov chain modeling with applications to communication networks. It begins with a general introduction to performance modeling in Chapter 1 where we introduce different performance models. We then introduce basic ideas of Markov chain modeling: Markov property, discrete time Markov chain (DTMC) and continuous time Markov chain (CTMC). We also discuss how to find the steady state distributions from these Markov chains and how they can be used to compute the system performance metric. The solution methodologies include a balance equation technique, limiting probability technique, and the uniformization. We try to minimize the theoretical aspects of the Markov chain so that the book is easily accessible to readers without deep mathematical backgrounds. We then introduce how to develop a Markov chain model with simple applications: a forwarding system, a cellular system blocking, slotted ALOHA, Wi-Fi model, and multichannel based LAN model. The examples cover CTMC, DTMC, birth-death process and non birth-death process. We then introduce more difficult examples in Chapter 4, which are related to wireless LAN networks: the Bianchi model and Multi-Channel MAC model with fixed duration. These models are more advanced than those introduced in Chapter 3 because they require more advanced concepts such as renewal-reward theorem and the queueing network model. We introduce these concepts in the appendix as needed so that readers can follow them without difficulty. We hope that this textbook will be helpful to students, researchers, and network practitioners who want to understand and use mathematical modeling techniques.

Original languageEnglish
Title of host publicationSynthesis Lectures on Communication Networks
EditorsJean Walrand
Pages1-90
Number of pages90
DOIs
Publication statusPublished - 2010 May 8

Publication series

NameSynthesis Lectures on Communication Networks
Volume5
ISSN (Print)1935-4185

Fingerprint

Markov processes
Telecommunication networks
Local area networks
Queueing networks
Wi-Fi
Textbooks
Students

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Mo, J. (2010). Performance modeling of communication networks with Markov chains. In J. Walrand (Ed.), Synthesis Lectures on Communication Networks (pp. 1-90). (Synthesis Lectures on Communication Networks; Vol. 5). https://doi.org/10.2200/S00269ED1V01Y201004CNT005
Mo, Jeonghoon. / Performance modeling of communication networks with Markov chains. Synthesis Lectures on Communication Networks. editor / Jean Walrand. 2010. pp. 1-90 (Synthesis Lectures on Communication Networks).
@inbook{500e067fde774db19c606d5f3eff5a34,
title = "Performance modeling of communication networks with Markov chains",
abstract = "This book is an introduction to Markov chain modeling with applications to communication networks. It begins with a general introduction to performance modeling in Chapter 1 where we introduce different performance models. We then introduce basic ideas of Markov chain modeling: Markov property, discrete time Markov chain (DTMC) and continuous time Markov chain (CTMC). We also discuss how to find the steady state distributions from these Markov chains and how they can be used to compute the system performance metric. The solution methodologies include a balance equation technique, limiting probability technique, and the uniformization. We try to minimize the theoretical aspects of the Markov chain so that the book is easily accessible to readers without deep mathematical backgrounds. We then introduce how to develop a Markov chain model with simple applications: a forwarding system, a cellular system blocking, slotted ALOHA, Wi-Fi model, and multichannel based LAN model. The examples cover CTMC, DTMC, birth-death process and non birth-death process. We then introduce more difficult examples in Chapter 4, which are related to wireless LAN networks: the Bianchi model and Multi-Channel MAC model with fixed duration. These models are more advanced than those introduced in Chapter 3 because they require more advanced concepts such as renewal-reward theorem and the queueing network model. We introduce these concepts in the appendix as needed so that readers can follow them without difficulty. We hope that this textbook will be helpful to students, researchers, and network practitioners who want to understand and use mathematical modeling techniques.",
author = "Jeonghoon Mo",
year = "2010",
month = "5",
day = "8",
doi = "10.2200/S00269ED1V01Y201004CNT005",
language = "English",
isbn = "9781598299182",
series = "Synthesis Lectures on Communication Networks",
pages = "1--90",
editor = "Jean Walrand",
booktitle = "Synthesis Lectures on Communication Networks",

}

Mo, J 2010, Performance modeling of communication networks with Markov chains. in J Walrand (ed.), Synthesis Lectures on Communication Networks. Synthesis Lectures on Communication Networks, vol. 5, pp. 1-90. https://doi.org/10.2200/S00269ED1V01Y201004CNT005

Performance modeling of communication networks with Markov chains. / Mo, Jeonghoon.

Synthesis Lectures on Communication Networks. ed. / Jean Walrand. 2010. p. 1-90 (Synthesis Lectures on Communication Networks; Vol. 5).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Performance modeling of communication networks with Markov chains

AU - Mo, Jeonghoon

PY - 2010/5/8

Y1 - 2010/5/8

N2 - This book is an introduction to Markov chain modeling with applications to communication networks. It begins with a general introduction to performance modeling in Chapter 1 where we introduce different performance models. We then introduce basic ideas of Markov chain modeling: Markov property, discrete time Markov chain (DTMC) and continuous time Markov chain (CTMC). We also discuss how to find the steady state distributions from these Markov chains and how they can be used to compute the system performance metric. The solution methodologies include a balance equation technique, limiting probability technique, and the uniformization. We try to minimize the theoretical aspects of the Markov chain so that the book is easily accessible to readers without deep mathematical backgrounds. We then introduce how to develop a Markov chain model with simple applications: a forwarding system, a cellular system blocking, slotted ALOHA, Wi-Fi model, and multichannel based LAN model. The examples cover CTMC, DTMC, birth-death process and non birth-death process. We then introduce more difficult examples in Chapter 4, which are related to wireless LAN networks: the Bianchi model and Multi-Channel MAC model with fixed duration. These models are more advanced than those introduced in Chapter 3 because they require more advanced concepts such as renewal-reward theorem and the queueing network model. We introduce these concepts in the appendix as needed so that readers can follow them without difficulty. We hope that this textbook will be helpful to students, researchers, and network practitioners who want to understand and use mathematical modeling techniques.

AB - This book is an introduction to Markov chain modeling with applications to communication networks. It begins with a general introduction to performance modeling in Chapter 1 where we introduce different performance models. We then introduce basic ideas of Markov chain modeling: Markov property, discrete time Markov chain (DTMC) and continuous time Markov chain (CTMC). We also discuss how to find the steady state distributions from these Markov chains and how they can be used to compute the system performance metric. The solution methodologies include a balance equation technique, limiting probability technique, and the uniformization. We try to minimize the theoretical aspects of the Markov chain so that the book is easily accessible to readers without deep mathematical backgrounds. We then introduce how to develop a Markov chain model with simple applications: a forwarding system, a cellular system blocking, slotted ALOHA, Wi-Fi model, and multichannel based LAN model. The examples cover CTMC, DTMC, birth-death process and non birth-death process. We then introduce more difficult examples in Chapter 4, which are related to wireless LAN networks: the Bianchi model and Multi-Channel MAC model with fixed duration. These models are more advanced than those introduced in Chapter 3 because they require more advanced concepts such as renewal-reward theorem and the queueing network model. We introduce these concepts in the appendix as needed so that readers can follow them without difficulty. We hope that this textbook will be helpful to students, researchers, and network practitioners who want to understand and use mathematical modeling techniques.

UR - http://www.scopus.com/inward/record.url?scp=77952500103&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952500103&partnerID=8YFLogxK

U2 - 10.2200/S00269ED1V01Y201004CNT005

DO - 10.2200/S00269ED1V01Y201004CNT005

M3 - Chapter

SN - 9781598299182

T3 - Synthesis Lectures on Communication Networks

SP - 1

EP - 90

BT - Synthesis Lectures on Communication Networks

A2 - Walrand, Jean

ER -

Mo J. Performance modeling of communication networks with Markov chains. In Walrand J, editor, Synthesis Lectures on Communication Networks. 2010. p. 1-90. (Synthesis Lectures on Communication Networks). https://doi.org/10.2200/S00269ED1V01Y201004CNT005