Article ID: | iaor20051968 |
Country: | South Korea |
Volume: | 29 |
Issue: | 3 |
Start Page Number: | 99 |
End Page Number: | 110 |
Publication Date: | Sep 2004 |
Journal: | Journal of the Korean ORMS Society |
Authors: | Rhee Young |
In this paper, we investigate the impact of window mechanisms on end to end delay in a series of nodes with constant service times. It is shown that arbitrary combinations of window mechanisms, each applying to an arbitrary subset of data, can be embedded on the nodes without affecting the departure instants from the system if the windows are at least as large as the number of nodes spanned. The window mechanisms are shown to have no impact on the average end to end delay of data. As the condition on the windows is a minimal necessary requirement for full parallelism, the results show that the transparent operation from viewpoint of data transmission can be achieved with minimal resources.