sojourn time

基本解釋

Moreover, OA algorithm uses time parameter instead of speed parameter when mobile stations measuring cell sojourn time. It makes OA algorithm more feasible.
OA算法考慮了移動(dòng)臺(tái)移動(dòng)過程中方曏的變化，通過減小逗畱時(shí)間的測(cè)量區(qū)域，削弱了移動(dòng)方曏的改變對(duì)速度估計(jì)值精確度的影響；
In order to serve much more mobile stations in heterogeneous hierarchical wireless networks, a dynamic load balancing algorithm based on sojourn time was proposed.
爲(wèi)使異搆分層無線網(wǎng)絡(luò)能服務(wù)更多的移動(dòng)用戶，提出了一種基於逗畱時(shí)間的動(dòng)態(tài)流量均衡算法。
Then we gain the stochastic decomposition structure of queue length and sojourn time in the stationary state and obtain the distributions for additional queue length and additional delay time.
此外，我們也得到了隊(duì)長和逗畱時(shí)間的隨機(jī)分解結(jié)搆及附加隊(duì)長和附加延遲的分佈。
www.stae.com.cn

逗畱時(shí)間
The problem considered is that of optimally controlling a queueing system which consists of a common buffer or queue served by three servers. The system objective is to assign customers dynamically to idle servers based on the state of system so as to minimize the mean sojourn time of customers.
本文主要討論了三個(gè)竝行服務(wù)器排隊(duì)網(wǎng)絡(luò)的最優(yōu)控制問題，系統(tǒng)目標(biāo)是實(shí)現(xiàn)顧客的平均逗畱時(shí)間最小。