• Journal of applied mathematics & informatics
• /
• 제39권1_2호
• /
• pp.173-196
• /
• 2021

This paper treats a retrial queue with phase type retrial times and a threshold type-policy, where each server is subject to breakdowns and repairs. Upon a server failure, the customer whose service gets interrupted will be handed over to another available server, if any; otherwise, the customer may opt to join the retrial orbit or depart from the system according to a Bernoulli trial. We analyze such a multi-server retrial queue using the recently introduced threshold-based retrial times for orbiting customers. Applying the matrix-analytic method, we carry out the steady-state analysis and report a few illustrative numerical examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권6호
• /
• pp.1522-1545
• /
• 2012

Call admission control (CAC) plays an important role in mobile cellular network to guarantee the quality of service (QoS). In this paper, a dynamic hybrid CAC scheme with integrated cutoff priority and handoff queue for mobile cellular network is proposed and some performance metrics are derived. The unique characteristic of the proposed CAC scheme is that it can support any number of service types and that the cutoff thresholds for handoff calls are dynamically adjusted according to the number of service types and service priority index. Moreover, timeouts of handoff calls in queues are also considered in our scheme. By modeling the proposed CAC scheme with a one-dimensional Markov chain (1DMC), some performance metrics are derived, which include new call blocking probability ($P_{nb}$), forced termination probability (PF), average queue length, average waiting time in queue, offered traffic utilization, wireless channel utilization and system performance which is defined as the ratio of channel utilization to Grade of Service (GoS) cost function. In order to validate the correctness of the derived analytical performance metrics, simulation is performed. It is shown that simulation results match closely with the derived analytic results in terms of $P_{nb}$ and PF. And then, to show the advantage of 1DMC modeling for the performance analysis of our proposed CAC scheme, the computing complexity of multi-dimensional Markov chain (MDMC) modeling in performance analysis is analyzed in detail. It is indicated that state-space cardinality, which reflects the computing complexity of MDMC, increases exponentially with the number of service types and total channels in a cell. However, the state-space cardinality of our 1DMC model for performance analysis is unrelated to the number of service types and is determined by total number of channels and queue capacity of the highest priority service in a cell. At last, the performance comparison between our CAC scheme and Mahmoud ASH's scheme is carried out. The results show that our CAC scheme performs well to some extend.

• 대한교통학회지
• /
• 제20권5호
• /
• pp.145-152
• /
• 2002

실시간 교통정보는 운전자 입장에서는 항상 과거정보가 되는 특성이 있기에. 신뢰도 높은 예측교통정보 가공의 필요성은 오래전부터 제기되어 왔다. 교통류의 상태를 운전자에게 알리는 방안에는 속도, 통행시간도 있지만, 정체가 심하고 링크가 긴 구간에서는 대기행렬의 길이가 매우 효과적인 제공방안의 하나이다. 본 논문은 Kalman filter를 활용하여 대기행렬 길이를 예측하는 모델을 제안한 후, 실제 검지기 자료를 이용하여 서울 도심의 남산권 네트웍 상에 적용하였다. 5분후의 대기행렬 길이를 예측한 후 통계적으로 검증해 본 결과, 상당한 예측력을 확보할 수 있었다. 본 연구는 국내외 최초로 도심부에서 대기행렬 길이 예측을 시도하였고 실제 활용 가능성을 타진했다는데 큰 의미가 있다.

• International journal of advanced smart convergence
• /
• 제2권1호
• /
• pp.6-11
• /
• 2013

Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.

• 공학논문집
• /
• 제3권1호
• /
• pp.85-95
• /
• 1998

본 논문에서 blocking이 발생되고 다중 customer를 취급하는 유한용량의 Coxian 대기 네트워크를 분석하기 위한 회귀적인 방법을 연구한다. 다중 customer를 나타내기 위한 대용량의 state space로 인해 발생되는 메모리 문제와 rate matrix의 부행렬들에 대한 inverse를 구할 수 없는 관계로 발생될 수 있는 singular 문제를 해결하는 방법을 제안한다. 2가지 blocking 방식(FBFE, HPFE)에 대한 분석을 Gauss-Seidel 방법과 비교하여 본다.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.469-474
• /
• 2011

In a M/G/I queue where the server alternates between busy and idle periods, we assume that firstly customers arrive at the system according to a Poisson process and the arrival process and customer service times are mutually independent, secondly the system has infinite waiting room, thirdly the server utilization is less than 1 and the system has reached a steady state. With these assumptions, we analyze waiting times on the systems where some vacation policies are considered.

• 한국경영과학회지
• /
• 제21권2호
• /
• pp.49-58
• /
• 1996

The generalized Erlang loss function, extensively studied in the literature, is revisited. We study the steady state loss probability in M/M/s/s + c queueing system and prove that it satisfies the first and second order properties in integral number of servers as well as integral queue capacities. Also we study the problem of allocating integral number of servers and queue capacities, and develop an algorithm to obtian an optimal allocation of them individually and jointly with the small number of computations.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1999년도 추계학술대회 논문집
• /
• pp.62-62
• /
• 1999

In this paper, we propose a new technique of estimating tail of steady-state queue length distribution; Pr(Q>q), fo ATM multiplexer. Pr(Q>q) is a fundamental measure of network congestion. Assessing Pr(Q>q) properly is crucial for design and control of ATM networks. Data traffic pattern of high-speed networks is highly correlated and bursty. Estimating Pr(Q>q) is very difficult because of correlation and burstiness. We estimate entropy(rate-function) using large deviation principles and threshold bootstrap. Simulation studies are conducted to compare the performance of an existing method and our new method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제26권1호
• /
• pp.1-22
• /
• 2022

A tandem queue that consists of nodes with buffers of finite capacity and general blocking scheme is considered. The service time distribution of each node is exponential whose rate depends on the state of the node. The blocking scheme at a node may be different from that of other nodes. An approximation method for the system based on decomposition method is presented. The effectiveness of the method is investigated numerically.