최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Journal of Korean Society of Industrial and Systems Engineering = 한국산업경영시스템학회지, v.43 no.4, 2020년, pp.1 - 14
Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are li...
Al-Begain, K., Dudin, A., Kazimirsky, A., and Yerima, S., Investigation of the M2/G2/1/∞, N queue with restricted admission of priority customers and its application to HSDPA mobile systems, Computer Networks, 2009, Vol. 53, No. 8, pp. 1186-1201.
Chakravarthy, S.R., A dynamic non-preemptive priority queueing model with two types of customers, International Conference on Mathematics and Computing, 2018, pp. 23-42.
Conway, R.W., Maxwell, W.L., and Miller, L.W., Theory of scheduling, Addison-Wesley, 1967.
Demoor, T., Walraevens, J., Fiems, D., De Vuyst, S., and Bruneel, H., Influence of real-time queue capacity on system contents in DiffServ's expedited forwarding per-hop-behavior, Journal of Industrial and Management Optimization, 2010, Vol. 6, No. 3, pp. 587-602.
Drekic, S. and Stanford, D.A., Reducing delay in preemptive repeat priority queues, Operations Research, 2001, Vol. 49, pp. 145-156.
Jaiswal, N.K., Priority queues, Academic Press, 1968.
Kim, K., Delay cycle analysis of finite-buffer M/G/1 queues and its application to the analysis of M/G/1 priority queues with finite and infinite buffers, Performance Evaluation, 2020, Vol. 143, pp. 102133.
Kim, K., (N, n)-preemptive priority queues, Performance Evaluation, 2011, Vol. 68, No. 7, pp. 575-585.
Kim, K., T-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks, Computers & Operations Research, 2012, Vol. 39, No. 7, pp. 1394-1401.
Kim, K. and Chae, K.C., Discrete-time queues with discretionary priorities, European Journal of Operational Research, 2010, Vol. 200, No. 2, pp. 473-485.
Miao, W., Min, G., Wu, Y., and Wang, H., Performance modelling of preemption-based packet scheduling for data plane in software defined networks, 2015 IEEE international conference on Smart City/SocialCom/Sustain Com(SmartCity), 2015, pp. 60-65.
Pandey, S.R., Alsenwi, M., Tun, Y.K., and Hong, C.S., A downlink resource scheduling strategy for URLLC traffic, 2019 IEEE International Conference on Big Data and Smart Computing(bigcomp), 2019, pp. 1-6.
Parkvall, S., Dahlman, E., Furuskar, A., and Frenne, M., NR : The new 5G radio access technology, IEEE Communications Standards Magazine, 2017, Vol. 1, No. 4, pp. 24-30.
Sachs, J., Wikstrom, G., Dudda, T., Baldemair, R., and Kittichokechai, K., 5G radio network design for ultra-reliable low-latency communication, IEEE Network, 2018, Vol. 32, No. 2, pp. 24-31.
Van Velthoven, J., Van Houdt, B., and Blondia, C., The impact of buffer finiteness on the loss rate in a priority queueing system, European Performance Engineering Workshop, 2006, pp. 211-225.
Willinger, W., Paxson, V., and Taqqu, M.S., Self-similarity and heavy tails : Structural modeling of network traffic, A Practical Guide to Heavy Tails : Statistical Techniques and Applications, 1998, Vol. 23, pp. 27-53.
Wu, W.-R., Lin, T.-H., and Lee, Y.-H., An indicator-free eMBB and URLLC multiplexed downlink system with correlation-based sfbc, Proceedings of the 3rd International Conference on Telecommunications and Communication Engineering, 2019, pp. 105-110.
Yang, W., Li, C.-P., Fakoorian, A., Hosseini, K., and Chen, W., Dynamic URLLC and eMBB multiplexing design in 5G new radio, 2020 IEEE 17th Annual Consumer Communications & Networking Conference(CCNC), 2020, pp. 1-5.
Zhou, Z., Yan, Y., Ruepp, S., and Berger, M., Analysis and implementation of packet preemption for time sensitive networks, 2017 IEEE 18th International Conference on High Performance Switching and Routing(HPSR), 2017, pp. 1-6.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.