• Journal of applied mathematics & informatics
• /
• 제41권4호
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• 정보과학회지
• /
• 제5권2호
• /
• pp.49-60
• /
• 1987

待期 理論(Queuing, waiting-Line Theory)은 例을 지어 待期하고 있는 現 象, 즉 各種 窓口에서 特定의 서어비스를 提供받기 위하여 個體가 기다리는 現象 에 관한 理論이며, 이와같은 理論的인 現象을 待期行列現象(Queuing phenomena, Waiting-Line phenomena)이라고 한다.

• 한국ITS학회 논문지
• /
• 제10권2호
• /
• pp.22-34
• /
• 2011

본 논문은 고속도로 톨게이트에서 통행 요금징수로 인해 교통지체가 발생할 때 이를 최소화하기 위해 자동요금징수시스템을 설치하는 경우 차량들의 통과시간이 어떻게 변화하는지 분석한 연구결과를 제시하고 있다. 본 연구에서는 이 설치효과를 톨게이트를 빠져나가는 차량들의 통과시간 감소 편익이라고 생각했으며, 차량의 통과시간을 분석하기 위해 다중서비스 대기행렬 이론을 적용해서 분석하였다. 본 연구에서 분석한 결과, 톨게이트로 진입하는 차량들의 입차 간격이 Poisson 분포를 따르고, 자동요금징수시스템의 서비스 시간이 지수 분포를 따를 때 다중서비스 대기행렬이론을 적용하여 차량들의 통과시간을 분석하는 것이 바람직하다는 것과, 자동요금징수시스템을 설치하더라도 통행 요금을 징수하는데 걸리는 시간이 다르기 때문에 톨게이트 출구 쪽이 입구 쪽보다 통과시간 감소효과가 더 크게 나타난다는 것, 그리고 자동요금징수시스템을 설치한다고 해서 항상 톨게이트를 통과하는 시간이 감소하는 것은 아니며, 자동요금징수시스템 차로에 너무 많은 차량들이 몰리는 경우 오히려 톨게이트 전체로 볼 때는 차량당 통과시간이 증가한다는 것을 밝혔다. 끝으로 본 연구에서는 다중서비스 대기행렬이론의 정확성을 판단하기 위해 실제로 톨게이트 현장조사에서 통과 차량들의 평균 통과시간을 조사해서 모형 값과 비교했는데, 그 결과 모형 값과 실측 값은 약 1~3초 정도의 미소한 차이만을 보여서 다중서비스 대기행렬이론을 실무에 적용해도 좋다는 결론을 얻었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2450-2469
• /
• 2018

In this paper, we develop a spatiotemporal model to analysis of cellular user in underlay D2D communication by using stochastic geometry and queuing theory. Firstly, by exploring stochastic geometry to model the user locations, we derive the probability that the SINR of cellular user in a predefined interval, which constrains the corresponding transmission rate of cellular user. Secondly, in contrast to the previous studies with full traffic models, we employ queueing theory to evaluate the performance parameters of dynamic traffic model and formulate the cellular user transmission mechanism as a M/G/1 queuing model. In the derivation, Embedded Markov chain is introduced to depict the stationary distribution of cellular user queue status. Thirdly, the expressions of performance metrics in terms of mean queue length, mean throughput, mean delay and mean dropping probability are obtained, respectively. Simulation results show the validity and rationality of the theoretical analysis under different channel conditions.

• Industrial Engineering and Management Systems
• /
• 제15권4호
• /
• pp.354-363
• /
• 2016

Due to uncertain environment, various parameters such as price, queuing length, warranty, and so on influence on inventory models. In this paper, an inventory-queuing-pricing problem with continuous review inventory control policy and batch arrival queuing approach, is presented. To best of our knowledge, (I) demand function is stochastic and price dependent; (II) due to the uncertainty in real-world situations, a fuzzy programming approach is applied. Therefore, the presented model with goal of maximizing total profit of system analyzes the price and order quantity decision variables. Since the proposed model belongs to NP-hard problems, Pareto-based approaches based on non-dominated ranking and sorting genetic algorithm are proposed and justified to solve the model. Several numerical illustrations are generated to demonstrate the model validity and algorithms performance. The results showed the applicability and robustness of the proposed soft-computing-based approaches to analyze the problem.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2017년도 추계학술대회
• /
• pp.27-29
• /
• 2017

Container terminals in Northern Vietnam have recorded an impressive development in recent years. This development, however, also raises a fierce competition among local container terminals to attract customers. Beside the handling charges, the vessels' waiting cost is also an important factor that drive the opinion of users in choosing appropriate terminal. This research plans to estimate the waiting cost in different container terminals in Northern Vietnam by building regression equation that describe the relationship between the rate of throughput/capacity and waiting cost/TEU. Queuing theory with the application of Poisson distibution is used to estimate the waiting time of arrival vessels and uncertainty theory is applied to estimate the vessel's daily expenses. Previous studies suggested two different formation of the equation and according to the research results, cubic equation is more suitable in the given case. The research results are also useful for further research which require calculation of waiting cost per TEU in each container terminal in Northern Vietnam.

• 산업경영시스템학회지
• /
• 제47권3호
• /
• pp.1-7
• /
• 2024

In an influential paper, Choi and Kim (2010) derived waiting times in an M/M/1 queuing model under net neurality and under prioritization. In this short paper, we argue that the waiting times of content transmission that Choi and Kim (2010) derived by using the M/M/1 gueuing model under the non-preemptive priority rule are miscalculated. We provide corrected waiting times in the M/M/1 queuing model in the prioritization case. We also show that this correction does not affect their main results on the delay time and the incentive to invest in the network capacity qualitatively.

• 한국정보시스템학회지:정보시스템연구
• /
• 제29권2호
• /
• pp.131-147
• /
• 2020

Purpose The purpose of this study is to develop intelligent vehicle parking distribution system based on LoRa network at the circumstance of traffic congestion during cultural festival in a local city. This paper proposes a parking dispatch and distribution system using a Q-learning algorithm to rapidly disperse traffics that increases suddenly because of in-bound traffics from the outside of a city in the real-time base as well as to increase parking probability in a parking lot which is widely located in a city. Design/methodology/approach The system get information on realtime-base from the sensor network of IoT (LoRa network). It will contribute to solve the sudden increase in traffic and parking bottlenecks during local cultural festival. We applied the simulation system with Queuing model to the Yudeung Festival in Jinju, Korea. We proposed a Q-learning algorithm that could change the learning policy by setting the acceptability value of each parking lot as a threshold from the Jinju highway IC (Interchange) to the 7 parking lots. LoRa Network platform supports to browse parking resource information to each vehicle in realtime. The system updates Q-table periodically using Q-learning algorithm as soon as get information from parking lots. The Queuing Theory with Poisson arrival distribution is used to get probability distribution function. The Dijkstra algorithm is used to find the shortest distance. Findings This paper suggest a simulation test to verify the efficiency of Q-learning algorithm at the circumstance of high traffic jam in a city during local festival. As a result of the simulation, the proposed algorithm performed well even when each parking lot was somewhat saturated. When an intelligent learning system such as an O-learning algorithm is applied, it is possible to more effectively distribute the vehicle to a lot with a high parking probability when the vehicle inflow from the outside rapidly increases at a specific time, such as a local city cultural festival.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.286-297
• /
• 2011

A novel converged optical network unit (ONU)-base station (BS) architecture has been contemplated for next-generation optical-wireless networks. It has been demonstrated through high quality studies that data traffic carried by both wired and wireless networks exhibit self-similar and long range dependent characteristics; attributes that classical teletraffic theory based on simplistic Poisson models fail to capture. Therefore, in order to apprehend the proposed converged architecture and to reinforce the provisioning of tightly bound quality of service (QoS) parameters to end-users, we substantiate the analysis of the QoS behavior of the ONU-BS under self-similar and long range dependent traffic conditions using custom queuing which is a common queuing discipline. This paper extends our previous work on priority queuing and brings novelty in terms of presenting performance analysis of the converged ONU-BS under realistic traffic load conditions. Further, the presented analysis can be used as a network planning and optimization tool to select the most robust and appropriate queuing discipline for the ONU-BS relevant to the QoS requirements of different applications.

• 전자공학회논문지
• /
• 제54권2호
• /
• pp.61-67
• /
• 2017

이 논문에서는 협대역과 낮은 전송속도의 제약을 가진 수중의 다양한 환경에 적응적인 MAC 기법을 제안하였다. 이미 발표된 Underwater Packet Flow Control (UPFC) 기법은 전송회수와 전송시간을 이용한 세 가지 전송타입을 제안하여 일반전송, 블럭전송, 병렬전송이 가능하도록 설계되었으나 기존 머지전송을 보완하여 최대전송가능 페이로드를 기준으로 효율적인 큐잉방법에 대한 기법 Effective Queuing-UPFC (EQ-UPFC)을 제안하였다. 제안한 기법의 전송효율의 검증을 위해 수학적 모델을 제시하였으며 시뮬레이션을 수행하여 전송회수 및 전송량 대비 효율성의 증가를 검증하였다.