• Journal of applied mathematics & informatics
• /
• 제6권1호
• /
• pp.309-320
• /
• 1999

Models of single-server queues with vacations have been widely used to study the performance of many computer communi-cation and production systems. In this paper we analyze an M/G/1 queue with generalized vacations and exhaustive service. This sys-tem has been shown to possess a stochastic decomposition property. That is the customer waiting time in this system is distributed as the sum of the waiting time in a regular M/G/1 queue with no va-cations and the additional delay due to vacations. Herein a general formula for the additional delay is derived for a wide class of vacation policies. The formula is also extended to cases with multiple types of vacations. Using these new formulas existing results for certain vacation models are easily re-derived and unified.

• 한국전자통신학회논문지
• /
• 제15권6호
• /
• pp.1099-1104
• /
• 2020

인터넷을 기반으로 다양한 종류의 응용 서비스들을 제공하기 위해서 각 흐름 별로 서비스 품질을 보장하는 것은 이상적이지만, 이를 실현하는 것은 매우 어려운 일이다. 서비스 품질 요구조건이 같거나 비슷한 여러 흐름들을 동일한 그룹으로 지정하고, 그룹별로 서비스 품질을 제공하는 방안이 효율적이다. 라우터에서 적용되는 큐 관리 메커니즘은 데이터의 효율적으로 전송하고, 서비스 별로 차별화된 서비스 품질을 지원하기 위하여 매우 중요한 역할을 수행한다. 다양한 멀티미디어 서비스를 효율적으로 지원하기 위해서 지능적이고 적응적인 큐 관리 메커니즘 기능이 필요하다. 본 논문은 일정 기간 유입되는 각 흐름 그룹의 트래픽 정보와 현재의 네트워크 상태 정보를 기반으로 그룹별 패킷의 전달 여부를 결정하는 심층강화학습 기반의 지능형 큐관리 메커니즘을 제안한다.

• 전자공학회논문지S
• /
• 제35S권2호
• /
• pp.1-9
• /
• 1998

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

• 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.

• 대한수학회지
• /
• 제32권2호
• /
• pp.211-236
• /
• 1995

The purpose of this paper is to provide a transient diffusion approximation of queue size distribution for M/G/m/N system. The M/G/m/N system can be expressed as follows. The interarrival times of customers are exponential and the service times of customers have general distribution. The system can hold at most a total of N customers (including the customers in service) and any further arriving customers will be refused entry to the system and will depart immediately without service. The queueing system with finite capacity is more practical model than queueing system with infinite capacity. For example, in the design of a computer system one of the important problems is how much capacity is required for a buffer memory. It its capacity is too little, then overflow of customers (jobs) occurs frequently in heavy traffic and the performance of system deteriorates rapidly. On the other hand, if its capacity is too large, then most buffer memories remain unused.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.827-837
• /
• 1998

We consider the M/G/1 queue with instantaneous feed-back. The probabilities of feedback are determined by the state of the underlaying Markov chain. by using the supplementary variable method we derive the generating function of the number of customers in the system. In the analysis it is required to calculate the matrix equations. To solve the matrix equations we use the notion of Ex-tended Laplace Transform.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.469-481
• /
• 2004

In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권1호
• /
• pp.103-112
• /
• 2000

지능망과 이동 통신 시장의 활성화로 차세대 지능망 서비스를 구현함에 있어 이동 서비스 가입자 및 이동 서비스 이용자 등의 서비스 수요가 더욱 증가될 것이 고려되어야 한다. 따라서, 본 논문에서는 가장 많이 사용되는 지능망 서비스중의 하나인 착신 과금 서비스에 대량호를 처리할 수 있는 호 대기 기능을 추가하여 호 성공률을 높이고, 서비스 가입자의 범위를 기존의 유선망 가입자뿐만 아니라 이동 단말을 소유한 무선망 가입자까지 확장하여 가입자의 이동성을 고려한 Global Service Logic을 설계한다. 또한 서비스에 가입된 각 가입자 단말기들의 위치 정보를 관리하여, 그들의 이동에 따른 동적 그룹핑을 수행하는 Queue Manager의 구조 및 동작 메커니즘을 설계하며, 호 시도율과 drop rate에 따라 필요한 큐의 적정 크기와 이에 대한 큐에서의 대기 시간을 제시한다.

• 한국통신학회논문지
• /
• 제25권5B호
• /
• pp.942-955
• /
• 2000

본 논문은 유무선 통합망 환경하에서 대량호에 근거한 지능망 서비스의 호 완료율을 증가시키고 자원을 최적화하기 위한 정보 흐름 및 총괄서비스 로직을 설계한다. 이 로직을 구현하기 위하여 지능망 서비스제거에 호대기 서비스 특징을 적용하기 위한 동적 큐 관리자를 제시하는데, 이것을 유선 가입자뿐만 아니라 이동 단말을 소유한 무선 가입자에게도 적용하기위해 홈위치등록기와 서비스제어기간에 해당 서비스 가입자들의 이동성을 큐 관리자에게 통보하기 위한 서비스 등록 여부 프래그를 관리한다. 따라서, 이동 서비스 가입자가 로밍함에 따른 동적 서비스 그룹핑을 수행하고 M/M/c/K 큐잉 모델에 근거한 큐 길이를 동적으로 관리하여 자원을 최적화 할 수 있는 동적 큐 관리 메커니즘을 제안한다. 동적 큐 관리자에 의해 할당된 큐 길이를 결정하기 위해 서비스 증가율에 따른 가입자 단말 수와 실패율간의 관계 및 그에 따른 큐에서의 적정 대기 시간을 시뮬레이션 및 분석한다. 또한, 동적 큐 관리자를 구성하는 내부 서비스 로직과 SIB들간의 상호동작 및 자료 구조를 설계 및 구현한다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1999년도 가을 학술발표논문집 Vol.26 No.2 (3)
• /
• pp.423-426
• /
• 1999

In offering a statistical end-to-end bandwidth guarantee service, typically called Assured Service, in Differentiated Serviced (Diff-Serv) framework, the biggest issue is its inconsistency. Larger profile TCP flows fail to achieve the guaranteed rate when competing with many smaller profile flows. This phenomenon, which we call "bandwidth skew", stems from the fact that larger profile flows take longer time to recover from the congestion window size backoff after a packet drop. Proposed solutions to this problem, therefore, are focused on modifying the TCP behavior. However, TCP modification is not practicable, mainly due to its large installation base. We look to other mechanisms in the Diff-Serv framework to find more realistic solutions. In particular, we demonstrate that RIO, the de facto standard packet differentiation mechanism used for Assured Service, also contributes to the bandwidth skew. Based on this new finding, we design a modified RIO mechanism called RI+O. RI+O uses OUT queue length in addition to IN and IN+OUT queue length to calculate OUT packet drop probability. We show through extensive simulation that RI+O significantly alleviates the bandwidth skew, expanding the operating regime for Assured Service.d Service.