Network Traffic Modeling

Thomas G. Robertazzi
Additional contact information
Thomas G. Robertazzi: SUNY Stony Brook, Department of Electrical Engineering

Chapter Chapter 7 in Computer Networks and Systems, 2000, pp 333-355 from Springer

Abstract: Abstract The first six chapters of this book have given you, the reader, the basics of queueing theory and performance evaluation for computer networks and computer systems. However this is only a beginning. There are a plethora of techniques to model traffic and evaluate network performance. Overviews of these are given in section 7.2 (for continuous time models) and section 7.3 (for discrete time models). Solution methods for these models are discussed in section 7.4.

Keywords: Interarrival Time; Discrete Time Model; Hurst Parameter; Markovian Arrival Process; Buffer Occupancy (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1164-8_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461211648

DOI: 10.1007/978-1-4612-1164-8_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().