A window protocol for transmission of time constrained messages

Zhao, W. ; Stankovic, J. A. ; Ramamritham, K. (1990) A window protocol for transmission of time constrained messages IEEE Transactions on Computers, 39 (9). pp. 1186-1203. ISSN 0018-9340

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/search/freesrchabstract...

Related URL: http://dx.doi.org/10.1109/12.57059


The authors propose and study a window protocol suitable for transmitting time-constrained messages in a multiaccess network. The protocol differs from traditional window protocols in that it explicitly takes time constraints into account. The window is formed on the basis of the latest time to send a message (LS). A major advantage of the window protocol is that a newly arriving message is immediately considered for transmission if its LS is less than that of all pending messages in the system. As a result, the protocol closely approximates the optimal minimum-laxity-first policy. A performance evaluation through simulation shows that the protocol performs well in a wide range of environments, including under overloaded conditions.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:62915
Deposited On:24 Sep 2011 05:10
Last Modified:24 Sep 2011 05:10

Repository Staff Only: item control page