• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.239-246
• /
• 2009

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.703-717
• /
• 2002

This paper illustrates the implementation of a scalable shared buffer asynchronous transfer mode (ATM) switch. The designed shared buffer ATM switch has a shared buffet of a pipelined memory which has the access time of 4 ns. The high-speed buffer access time supports a possibility of the implementation of a shared buffer ATM switch which has a large switching capacity. The designed switch architecture provides flexible switching performance and port size scalability with the independence of queue address control from buffer memory control. The switch size and the buffer size of the designed ATM switch can be reconfigured without serious circuit redesign. The designed prototype chip has a shared buffer of 128-cell and 4 ${\times}$ 4 switch size. It is integrated in 0.6um, double-metal, and single-poly CMOS technology. It has 80MHz operating frequency and supports 640Mbps per port.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.533-535
• /
• 2017

MQTT provides three QoS levels on top of the TCP/IP layer to ensure message delivery reliability. However, in an environment where messages are concurrently transmitted and received in a node, messages are lost due to the delivery method for QoS level. In this paper, it construct an experimental environment in which MQTT generates concurrently messages, and confirm the message reliability according to QoS level. Therefore, we analyze the message reception ratio on the subscriber side by changing number of publisher and transmission cycle of message. Experimental results show that the message reception ratio of 1 and 2 except QoS level 0 decreases as the number of publisher increases or the message transmission cycle increases.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.736-743
• /
• 2016

Several studies have reported the impact of core affinity on the network I/O performance of multi-core systems. As the network bandwidth increases significantly, it becomes more important to determine the effective core affinity. Although a framework for dynamic core affinity that considers both network and disk I/O has been suggested, the multiple queues provided by high-speed I/O devices are not properly supported. In this paper, we extend the existing framework of dynamic core affinity to efficiently support the multiple queues of high-speed I/O devices, such as 40 Gigabit Ethernet and NVM Express. Our experimental results show that the extended framework can improve the HDFS file upload throughput by up to 32%, and can provide improved scalability in terms of the number of cores. In addition, we analyze the impact of the assignment policy of multiple I/O queues across a number of cores.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.161-168
• /
• 2009

Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

• Journal of Korean Society of Transportation
• /
• v.24 no.5 s.91
• /
• pp.7-18
• /
• 2006

Data for travel information Provision are regularly aggregated to Provide travel time information in a reliable and convenient manner and to manage traffic data and information efficiently. In most of practices in Korea, the GPS based travel time data are mainly aggregated every 5 minutes As a result, some probes can't pass by a link within aggregation interval and thereby create uncompleted link passing data. But these data are mostly generated during the congested times and therefore a method that uses such uncompleted link passing data are required. This study estimated queue dissipation length, green time and cycle that use GPS spot speed and developed a link travel time estimation method using such uncompleted link passing data. It also presents method and the overall process of using such data to estimate link travel time in a more accurate manner. As a result, MAPE 1.98% and MAE 4.75 sec of link travel time accuracy improvement has been reported, which is not much different from the real link travel time. The method Proposed here would be an alternative to increase the amount of GPS probe data, especially in congested urban arterial case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.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.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1992.10a
• /
• pp.3-3
• /
• 1992

컴퓨터 시스템의 개발 및 분석에 많이 활용되는 시뮬레이션 모델을 구축하는데 있어서 SIMSCRIT, GISS, SIMAN, SLA II등과 같은 시뮬레이션 전용언어가 많이 사용되지만, 이들은 새로운 전용언어의 습득, 시스템 프로그램과의 접속, 시뮬레이션 수행 속도면에서 부담을 주어왔다. 본 연구에서는 기존의 C언어 사용자들이 손쉽게 시뮬레이션 모델을 구축할 수 있도록 기존의 smpl을 확장하여 SMPLE(smpl extended)를 개발하였다. SMPLE의 모체의 smpl은 컴퓨터 시스템의 시뮬레이션 모델을 구현하기 위해 MIT에서 C언어를 이용하여 고안되었으며, C언어의 기능적인 확장으로서 라이브러리 함수들의 집합 형태를 갖는 시뮬레이션 서브 시스템이다. 이러한 라이브러리 함수들의 집합인 smpl 시뮬레이션 서브 시스템은 C언어 자체와 더불어 사건중심(event-oriented) 시뮬레이션 언어를 구성하며, smpl 시뮬레이터는 C 언어 프로그램으로 구현되다. smpl은 시뮬레이션하기 위한 설비(facility)들을 정의, 예약, 해제하거나 상태를 알아보는 함수를 제공하며, 시간의 관점에서 보면 토큰의 흐름은 일련의 대기시간과 활동시간에 의하여 나타낼 수 있게 된다. smpl은 사건의 스케쥴링(scheduling), 확률변수의 생성, 통계자료 수집 등에 관한 함수의 제공과, 시뮬레이션 시간의 전진과 사건발생의 순서를 조절해주는 기능을 제공한다. smpl 시뮬레이션 프로그램은 초기화루틴, 제어루틴 및 결과출력루틴으로 구성된다. 기존의 smpl에서 사용되는 프로그램의 자료구조(data structure)는 배열과 인덱스 구조가 사용되었다. 이러한 구조는 이미 완성되어 있는 프로그램 내에서는 효율성 면에서 좋겠지만, 변경이나 확장하기 위해 이 프로그램을 분석한다거나 필요한 기능을 추가하기 위해서는 매우 많은 어려움이 따르게 된다. 본 논문에서는 배열을 기반으로 하고 있는 smpl의 자료구조를 C의 structure와 pointer를 기반으로 하게끔 변경시키고 이에 따르는 제반 변경 사항을 수정 보완하여 프로그램의 분석을 용이하게 하며 기능의 변경 및 추가가 수월하게 하였고 메모리를 동적으로 관리할 수 있게 하였다. 또한 기존의 smpl에 디버깅용 함수 및 설비(facility) 제어용 함수를 추가하여 시뮬레이션 프로그램 작성을 용이하게 하였다. 예를 들면 who_server(), who_queue(), pop_Q(), push_Q(), pop_server(), push_server(), we(), wf(), printfct() 같은 함수들이다. 또한 동시에 발생되는 사건들의 순서를 조종하기 위해, 동시에 발생할 수 있는 각각의 사건에 우선순위를 두어 이 우선 순위에 의하여 사건 리스트(event list)에서 자동적으로 사건들의 순서가 결정되도록 확장하였으며, 설비 제어방식에 있어서도 FIFO, LIFO, 우선 순위 방식등을 선택할 수 있도록 확장하였다. SIMPLE는 자료구조 및 프로그램이 공개되어 있으므로 프로그래머가 원하는 기능을 쉽게 추가할 수 있는 장점도 있다. 아울러 SMPLE에서 새로이 추가된 자료구조와 함수 및 설비제어 방식등을 활용하여 실제 중형급 시스템에 대한 시뮬레이션 구현과 시스템 분석의 예를 보인다.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.80-91
• /
• 2002

A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.