In this chapter, we consider a discrete-time system with time indexed by t = 0, 1, 2,… We describe a discrete-time arrival process of a traffic source by a sequence of variables A≡{A(t),t = 0, 1, 2,…, where A(t) is the cumulative number of arrivals by time t. We assume that there is no arrival at time 0, i.e., A(0) = 0, and that A(t) is increasing, i.e., A(s) < A(t), for all s < t. Following the terminology in communication networks, we sometimes call an arrival a packet. Packets are assumed to be of the same size unless otherwise specified.


Queue Length Arrival Process Busy Period Network Element Maximum Delay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2000

Authors and Affiliations

  • Cheng-Shang Chang
    • 1
  1. 1.Department of Electrical EngineeringNational Tsing Hua UniversityHsinchuTaiwan, Republic of China

Personalised recommendations