• 한국시뮬레이션학회논문지
• /
• 제8권2호
• /
• pp.29-43
• /
• 1999

As real-time processing of data with large storage space is required in the era of multimedia, disk arrays are generally used as storage subsystems which be able to provide improved I/O performance. To design the cost-effective disk array, it is important to develop performance models which evaluate the disk array performance. Both queueing theory and simulation are applicable as the method of performance evaluation through queueing modeling. But there is a limit to the analytical method using queueing theory due to the characteristics of disk array requests being serviced in the parallel and concurrent manner. So in this paper we evaluate the disk array performance using simulation method which abstract disk array systems in the low level. Performance results were evaluated through simulation, so that mean response time, mean queueing delay, mean service time, mean queue length for disk array requests and utilization, throughput for disk array systems, can be utilized for capacity planning in the phase of disk array design.

• 한국산업정보학회논문지
• /
• 제12권4호
• /
• pp.107-118
• /
• 2007

A single-server queueing model with infinite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of an accepted batch arrive one-by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. Analysis of the joint distribution of the number batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. Effect of control on the main performance measures of the system is demonstrated numerically.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.81-84
• /
• 2000

Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size

• 한국정보통신학회논문지
• /
• 제4권2호
• /
• pp.289-295
• /
• 2000

인터넷에서 제공되는 멀티미디어 데이터의 서비스 품질 및 트래픽 파라메타인 사용자 트래픽의 최대 발생률, 데이터 전송시간지연과 변동 허용치, 최대 버스트 길이의 자기유사 특성을 가진 트래픽 모델로 분석 하므로써, 네트워크의 확장성, Quality of Service 그리고 최적화된 설계를 유추하였으며 시뮬레이션 네트워크를 통한 트래픽 지연 특성과 처리율을 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1587-1605
• /
• 2015

Mobile cloud computing (MCC) combines mobile Internet and cloud computing to improve the performance of applications. In MCC, the data processing and storage for mobile devices (MDs) is provided on the remote cloud. However, MCC faces the problem of energy efficiency caused by randomly varying channels. In this paper, by introducing the Lyapunov optimization method, we propose a combined service subscription and delivery (CSSD) algorithm that can guide the users to subscribe to services reasonably. This algorithm can also determine whether to deliver the data and to whom data is sent in the current time unit based on the queue backlog and the channel state. Numerical results validate the correctness and effectiveness of our proposed CSSD algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• 한국통신학회논문지
• /
• 제19권10호
• /
• pp.2014-2027
• /
• 1994

이 논문에서는 서비스 우선순위가 다른 2개의 독자적인 입력 스트림을 가지는 큐잉 모델을 연구하였다. 구체적으로 head-of-line 우선 순위가 적용되는 IBP+BP/D/I시스템을 분석하였는데, 여기에는 IBP는 Interrupted Bernoulli Process를 BP는 Bernoulli Process를 표시한다. BP 스트립은 IBP 스트립에 대하여 서비스 우선권을 가진다. 본 논문은 이 우선 순위 큐에 대하여 시스템 상태의 안정상태분포와 각 클래스 별 고객의 대기 시간분포 및 출발시간 간격분포를 구할 수 잇는 정확한 분석방법을 제공하고 있다. 우선 순위가 다른 두 입력스트림의 다양한 파라미터들이 시스템의 성능에 어떠한 영향을 미치는지 보여줄 수 있는 수치적 예들도 제시하였다.

• 디지털산업정보학회논문지
• /
• 제7권4호
• /
• pp.15-22
• /
• 2011

U-Healthcare service is a real-time service using the vital signs which are continuously transferred from monitoring sensors attached to mobile patients under the wireless network environments. It should monitor the health condition of mobile patients everywhere at any time. In this paper, we have improved two features of the three layered mobile patient monitoring system with load balancing ability. First, the simulation process has been improved by allowing the number of related nodes to be changed. Secondly, we have modified S node to which queue is added to reduce the loss rate of collecting data from patients during the delay of S node process. And the data from the patient with high priority can be transferred to the server immediately through the filtering function. Furthermore, we have solved the problem of redundancy in sharing information among S nodes by differentiating process time to each S node. By performing a DEVS Java-based system simulation, we have verified the efficiency of this improved system.

• 한국전자거래학회지
• /
• 제4권1호
• /
• pp.87-101
• /
• 1999

To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the control devices located in common manufacturing zone and operated by connecting them. In this paper, functional standard of the network layers are set as physical and data link layer of IEEE 802.2, 802.4, and VMD application layer and ISO-CIM reference model. Then, they are divided as minimized architecture, designed as group objects which perform group management and service objects which organizes and operates the group. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the waiting time for the network operation. For the method of the analysis, non-exhausted service method are selected, and the arrival rates of the each data packet to the nodes that are assumed to form a Poission distribution. Then, queue model is set as M/G/1, and the analysis equation for waiting time is found. For the evalution of the performance, the length of the data packet varies from 10 bytes to 100 bytes in the operation of the group management network, the variation of the wating time is less than 10 msec. Since the waiting time in this case is less than 10 msec, response time is fast enough. Furthermore, to evaluate the real time processing of the group management network, it shows if the number of nodes is less than 40, and the average arrival time is less than 40 packet/sec, it can perform stable operation even taking the overhead such as software delay time, indicated packet service, and transmissin safety margin.

• 인터넷정보학회논문지
• /
• 제23권5호
• /
• pp.33-46
• /
• 2022

본 논문은 공중급유기의 지상 대기시간을 최소화 하기 위해서 단일서버와 다중서버 환경에서 대기시간을 산출하는 대기행렬, 즉, Queuing 이론을 연구에 활용하였다. 국가의 예산과 자원은 한정되어 있어 군수지원 서비스팀의 무한한 증가는 제한되는 환경이다. 따라서 전시 준비단계 또는 전시 환경에 따라 지상 대기시간을 적응적으로 제어할 수 있는 군수지원 서비스팀 수량을 산출하였다. 본 연구의 결과는 공군의 공중급유기 군수지원 서비스팀의 최적 수량을 산출할수 있는 명문화된 기준을 제공함으로서, 군수지휘관이 평시에서 전시까지 각 단계별로 군수지원 서비스팀을 할당할 수 있는 근거를 제공할 수 있을 것으로 기대한다.