Calculus

Calculus
复制标题

DOI:
10.1007/978-1-4471-0459-9_1
复制
发表时间:
2020-08
期刊:
Bicycle or Unicycle?
影响因子:
--
通讯作者:
Cheng-Shang Chang
Cheng-Shang Chang
中科院分区:
其他
文献类型:
--
作者:
Cheng-Shang Chang

文献摘要

被引文献

相似文献

在本章中,我们考虑一个离散时间系统,其时间索引为拜特t = 0,1,2,.我们假设在时间0没有到达,即,A(0)= 0,并且A(t)是递增的,即,A(s)<A(t),对于所有s < t。按照通信网络中的术语,我们有时称一个到达为包。除非另有说明,否则包被假定为相同的大小。
In this chapter, we consider a discrete-time system with time indexed byt= 0, 1, 2,… We describe a discrete-time arrival process of a traffic source by a sequence of variablesA≡{A(t),t= 0, 1, 2,…, whereA(t) is the cumulative number of arrivals by timet. We assume that there is no arrival at time 0, i.e.,A(0) = 0, and thatA(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.Packetsare assumed to be of the same size unless otherwise specified.