Marco Conti, Sajal K. Das, et al.
Pervasive and Mobile Computing
We consider a token ring local area network (LAN) with an infinite number of nodes uniformly distributed around the ring. A token that circulates around the ring at a constant speed stops to “serve” fixed length packets that are generated by the nodes. We assume that the cumulative arrival process of packets constitutes a two-dimensional Poisson process. Given a fixed point on the ring, called the origin, we obtain the first-order statistics of the interarrival times of packets at the origin in the form of their Laplace—Stieltjes transform. © 1992 IEEE
Marco Conti, Sajal K. Das, et al.
Pervasive and Mobile Computing
Bikram Sengupta, Nilanjan Banerjee, et al.
Cluster Computing
S. Yousaf Shah, Boleslaw Szymanski, et al.
PerCom Workshops 2013
Murat Sensoy, Chatschik Bisdikian, et al.
SPIE Defense + Security 2012