• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.523-533
• /
• 2006

We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

• 수산해양교육연구
• /
• 제10권1호
• /
• pp.1-14
• /
• 1998

Transportation provides an infrastructure vital to economic growth, and it is also an integral part of production. As a port is regarded as the interface between the maritime transport and domestic transport sectors, it certainly play a key role in any economic development. Ship's delay caused by port congestion has recently has recently attracted attended with the analysis of overall operation in port. In order to analyse complicated port operation which contains large number of variable factors, queueing theory is needed to be adopted, which is applicable to a large scale transportation system in chiding ship's delay in Inchon port in relation to ship's delay problem. The overall findings are as follows ; 1. The stucture of queueing model in this port can be represented as a complex of multi-channel single-phase 2. Ship's arrival and service pattern were Poisson Input Erlangian Service. 3. The suitable formula to calculate the mean delay in this port, namely, $W_q={\frac{{\rho}}{{\lambda}(1-{\rho})}}{\frac{e{\small{N}}({\rho}{\cdot}N)}{D_{N-1}({\rho}{\cdot}N)}}$ Where, ${\lambda}$ : mean arrival rate ${\mu}$ : mean servicing rate N : number of servicing channel ${\rho}$ : utilization rate (l/Nm) $e{\small{N}}$ : the Poisson function $D_{(n-1)}$ : a function of the cumulative Poisson function 4. The utility rate is 95.0 percents in general piers, 75.39 percents in container piers, and watiting time 28.43 hours in general piers, 13.67 hours in container piers, and the length of queue is 6.17 ships in general piers, 0.93 ships in container piers, and the ship turnaround time is 107.03 hours in general piers, 51.93 hours in container piers.

• 한국경영과학회지
• /
• 제22권2호
• /
• pp.99-123
• /
• 1997

Performance analysis of NTT/BT protocol is investigated, which is a GFC (Generic Flow Control) ptotocol in ATM (Asynchronous Transfer Mode ) network and is based on cyclic reset mechanism. THe mean cell delay time is proposed as a performance measure of NTT/BT protocol. The mean cell delay time is defined as the duration from the instant the cell arrives at the transmission buffer until the cell is fully transmitted. The process of cell transmission can be described as a single server queueing modle with two dependent services. By utilizing this model, mean cell delay time is obtained and sensitivity of the factors such as window size and reset period is also analysed.

• 전자공학회논문지S
• /
• 제36S권1호
• /
• pp.1-8
• /
• 1999

종합 서비스망에서, 트랙픽을 발생시키는 각각의 플로우에 대하여 QoS(Quality of Service)를 적절하게 제공하기위해서는 호스트와 라우터에 자원 예약뿐만 아니라 효율적인 트랙픽 스케쥴링이 채택되어야 한다. 본 논문에서는 가상시간이 선형적으로 증가하는 새로운 페어 큐잉 알고리즘에 제안한다. 본 논문에서 제안된 알고리즘은 각 플로우에 대하여 기존의 SCFQ(Self-Clocked Fair Queneing) 알고리즘과 유사한 구현 복잡성을 갖으면서 더 감소된 최대 지연와 평균 지연시간을 제공하고 공평성 측면에서도 개선됨을 보여준다. 또한 자신에게 할당된 대역폭보다 더 많은 트랙픽을 발생시키는 플로우에 의해 다른 플로우는 영향을 받지 않도록하는 독립성 특성 또한 SCFQ보다 더 좋은 성능을 보인다. 본 논문에서는 제안된 알고리즘에 대한 공평성을 증명했고, 최대지연과 평균지연시간에 대한 시뮬레이션 결과를 나타냈다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1758-1763
• /
• 2004

This paper focuses on congestion control for ATM network with uncertain time-variant delays. The time-variant delays can be distinguished into two distinct components. The first one is represented by time-variant queueing delays in the intermediate switches that are occurred in the return paths of RM cells. The next one is a forward path delay. It is solved by the VBR model which quantifies the data propagation from the sources to the switch. Robust $H_8$ control is studied for solving congestion problem with norm-bounded time-varying uncertain parameters. The suitable robust $H_8$ controller is obtained from the solution of a convex optimization problem through LMI technique.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• 한국통신학회논문지
• /
• 제25권4B호
• /
• pp.692-699
• /
• 2000

We build and analyze some types of queueing model to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Internet backbone network. We assume that the IWU has a FIFO buffer to transmit IP packets to the Internet through the backbone. In order to analyze the system, we use a Poisson process and an MMPP process as input traffic models of IP packets and we use a general service time distribution as a service time model. But we use both an exponential service time and a deterministic service time in numerical examples for simple and efficient performance comparisons. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effect of arrival rate, buffer size and link capacity on packet loss and mean delay.

• 한국통신학회논문지
• /
• 제11권3호
• /
• pp.179-196
• /
• 1986

본 논문에서는 통계적 패킷 음성/데이터 다중화기의 성능을 연구하였다. 성능해석은 음성과 데이터가 서로 분리된 한정된 queue를 사용하고, 전송에 있어서 음성이 데이터보다 우선권을 갖는 것을 가정하고, 다중화기의 출력 link를 시간 slot단위로 나누고 음성은 (M+1)-state의 Markov Process로, 데이터는 Poisson process로 modeling 하여 수행하였다. 전송시 음성신호가 데이터 신호보다 우선권을 가지므로 음성의 queueing behavior는 data에 거의 영향을 받지 않는다. 다라서 본 연구에서는 음성의 queueing behavior를 먼저 해석한 다음 data의 queueing behavior를 해석하였다. 패킷 음성 다중화기의 성능 해석은 입력상태와 buffer의 점유를 2차원의 Markov chain을 가지고 formulation하였고, 집적된 음성/data의 다중화기는 data를 추가한 3차원 Markov chain으로 하였다. 이러한 model을 사용하여 Gauss-Seidel방법으로 결과를 얻고 simulation으로 입증하였다. 이들 결과로 부터 음성 가입자의 수, 출력 link용량, 음성의 queue크기, 음성의 overflow확률에서는 서로 trade-off가 있고 data에서도 비슷한 tradeoff가 있음을 알았다. 또한 입력 traffic량과 link의 용량에 따라서 음성과 데이타간의 성능에서 서로 tradeoff가 있고, TASI의 이득이 2이상이고 음성가입자의 수가 적을 경우 데이타의 평균 지연시간은 buffer의 최대길이 보다 길음을 알아내었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1174-1177
• /
• 1987

The design of flow control protocols for integrared networks with complete voice traffic on the data link level is investigated. The class of admissible flow control policies analyzed maximized the average data link throughput subject to an average system time delay constraints a finite intervals (O,s). In particular, it is shown that the optimum control law is bang-bang (window flow mechanism). The window size L can be analytically derived from maximum tolerated time delay T, the input arrival C of the queueing system, the duration of the time interval S, the initial number of packets in the queue.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3029-3042
• /
• 2022

For over half a century, the United States (US) and its coalition military aircrafts have been using Ultra High Frequency (UHF) band analog modulation (AM) radios in ground-to-air communication and short-range air-to-air communications. Evolving from this, since 2007, the US military and the North Atlantic Treaty Organization (NATO) adopted HAVE QUICK to be used by almost all aircrafts, because it had been revealed that intercepting and jamming of former aircraft communication signals was possible, which placed a serious threat to defense systems. The second-generation Anti-jam Tactical UHF Radio for NATO (SATURN) was developed to replace HAVE QUICK systems by 2023. The NATO Standardization Agreement (STANAG) 4372 is a classified document that defines the SATURN technical and operational specifications. In preparation of this future upgrade to SATURN systems, in this paper, the SATURN technical and operational specifications are reviewed, and the network synchronization, frequency hopping, and communication setup parameters that are controlled by the Network (NET) Time, Time Of Day (TOD), Word Of Day (WOD), and Multiple Word of Day (MWOD) are described in addition to SATURN Edition 3 (ED3) and future Edition 4 (ED4) basic features. In addition, an anti-jamming performance analysis (in reference to partial band jamming and pulse jamming) and the time delay queueing model analysis are conducted based on a SATURN transmitter and receiver assumed model.