http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Doncel, Josu (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses
Josu Doncel,Mohamad Assaad 한국통신학회 2022 Journal of communications and networks Vol.24 No.1
The paper deals with age of information (AoI)in a network of multiple sources and parallel queues withbuffering capabilities, preemption in service and losses in servedpackets. The queues do not communicate between each other andthe packets are dispatched through the queues according to apredefined probabilistic routing. By making use of the stochastichybrid system (SHS) method, we provide a derivation of theaverage AoI of a system of two parallel queues (with and withoutbuffer capabilities) and compare the results with those of a singlequeue. We show that known results of packets delay in QueuingTheory do not hold for the AoI. Unfortunately, the complexityof computing the average AoI using the SHS method increaseshighly with the number of queues. We therefore provide an upperbound of the average AoI in a system of an arbitrary number ofM/M/1/(N+1)* queues and show its tightness in various regimes. This upper bound allows providing a tight approximation of theaverage AoI with a very low complexity. We then provide agame framework that allows each source to determine its bestprobabilistic routing decision. By using Mean Field Games, weprovide an analysis of the routing game framework, propose anefficient iterative method to find the routing decision of eachsource and prove its convergence to the desired equilibrium.
-
On the Age of Information of Processor Sharing Queuing Systems
Gandarias, Beñat,Doncel, Josu,Assaad, Mohamad 한국통신학회 2023 Journal of communications and networks Vol.25 No.5
In this paper, we examine the Age of Information(AoI) of a source sending status updates to a monitor througha queue operating under the Processor Sharing (PS) discipline. While AoI has been well studied for various queuing models andpolicies, less attention has been given so far to the PS discipline. We first consider M/M/1/2 queue with and without preemptionand provide closed-form expressions of the average AoI in thiscase. We overcome the challenges of deriving the AoI expressionby employing the Stochastic Hybrid Systems (SHS) tool. We thenextend the analysis to the M/M/1 queue with one and two sourcesand provide numerical results for these cases. Our results showthat PS can outperform the M/M/1/1* queue in some cases.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
