《排隊(duì)系統(tǒng):理論與應(yīng)用》(QUES)是一本聲譽(yù)卓著的期刊，主要研究廣義上的資源共享理論，尤其是內(nèi)部的資源共享理論網(wǎng)絡(luò)環(huán)境。該雜志主要對(duì)這種情況下的概率和統(tǒng)計(jì)問題感興趣。QUES歡迎這兩篇論文在一些應(yīng)用的背景下解決這些問題，以及為它們的分析開發(fā)數(shù)學(xué)方法的論文。在后者中，我們會(huì)特別引用馬爾可夫鏈和進(jìn)程、平穩(wěn)進(jìn)程、隨機(jī)圖、點(diǎn)進(jìn)程、隨機(jī)幾何和相關(guān)領(lǐng)域。預(yù)期的應(yīng)用領(lǐng)域包括但不限于生產(chǎn)、儲(chǔ)存和后勤、交通和運(yùn)輸、計(jì)算機(jī)和通訊系統(tǒng)。

Queueing Systems: Theory and Applications (QUES) is a well-established journal focusing on the theory of resource sharing in a wide sense, particularly withina network context. The journal is primarily interested in probabilistic and statistical problems in this setting.QUES welcomes both papers addressing these issues in the context of some application and papers developing mathematical methods for their analysis. Among the latter, one would particularly quote Markov chains and processes, stationary processes, random graphs, point processes, stochastic geometry, and related fields.The prospective areas of application include, but are not restricted to production, storage and logistics, traffic and transportation, computer and communication systems.