We study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the probl...
Yi Zhang, Alexei B. Piunovskiy, Urtzi Ayesta, Kons...
—We obtain detailed analytic formulas for the density and probability distribution of the waiting time in a time-division multiple-access (TDMA) model with a finite buffer and s...
Marcel F. Neuts, Jun Guo, Moshe Zukerman, Hai Le V...
This paper discusses an on-line Tasks Assignment and Routing Problem(TARP) for Autonomous Transportation Systems(ATSs) in manufacturing systems. The TARP results in a constrained ...
Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upp...
Yu Ying, Fabrice Guillemin, Ravi Mazumdar, Catheri...