silikontri.blogg.se

Intime scheduling
Intime scheduling









intime scheduling

These algorithms provide throughput-optimality without requiring knowledge of arrival rates since they dynamically adapt inter-switching durations to stochastic arrivals. We characterize the impacts of reconfiguration delays on system stability and delay, and propose scheduling algorithms that persist with service schedules for durations of time based on queue lengths to minimize negative impacts of reconfiguration delays. Next, we consider a general queuing network model under reconfiguration delays and interference constraints which includes wireless, satellite and optical networks as special cases. We propose control algorithms that stabilize the system whenever possible and have optimal delay scaling. We utilize a combination of wireless transmission and controlled mobility to improve the system delay scaling with load from (1/(1-)²) to (1/1-), where the former is the delay for the corresponding system without wireless transmission. In this setting reconfiguration delays correspond to travel times of collectors. We first consider a Delay Tolerant Network model where data messages arriving randomly in time and space are collected by mobile collectors. Moreover, simultaneous presence of time-varying channels and reconfiguration delays has never been considered and we show that it impacts the system fundamentally. Optimal control of networks has been studied to a great extent in the literature, however, the significant effects of reconfiguration delays received limited attention. Reconfiguration delay is the time it takes to switch network resources from one subset of nodes to another and it is a widespread phenomenon observed in many practical systems. We consider the control of possibly time-varying wireless networks under reconfiguration delays.











Intime scheduling