• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.430-438
• /
• 2013

This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.5
• /
• pp.584-594
• /
• 1999

이 논문에서는 CDMA(Code Division Multiple Access)셀룰러 시스템에서 우선순위 큐(Queue)에 기반을 둔 핸드오프채널할당기법의 모델을 제안하였다. 또한 제안한 모델의 성능을 컴퓨터 시뮬레이션을 통해 비우선순위기법 및 FIFO(First In First Out)큐기법과 비교하였다. 제안하는 모델의 핸드오프 채널할당 기법에서는 이동국의 진행방향에 있는 인접 셀(Neighbor Cell)의 파일롯 중에서 임계치가 T-ADD 이상인 파일롯이 있을 경우 기지국이 이 파일롯(Pilot)에 대한 파일롯 세기 측정메시지를 이동국으로부터 수신 한 지점에서 드롭타이머가 종료된후 현재의 셀에서 사용중인 파일롯에 대한 파일롯 세기 측정 메시지를 이동국으로부터 수신한 시점까지 핸드오프 처리가능 영역으로 정의하고 이를 우선순위 큐의 최대큐 대기시간으로 사용하였다. 제안된 기법의 성능을 분석하기 위한 성능평가 척도는 강조종료확률, 호 블록킹 확률, 전체 제공 트래픽에 대한 수행 트래픽 비율, 평균 규크기미치 핸드오프 시 평균 지연시간이다. 성능시뮬레이션결과, 제안된 기법이 전체 시스템 호처리 용량면에서 약간의 단점은 발생하지만 핸드오프 처리에 있어서 높은 성능을 유지함을 알수 있었다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.81-90
• /
• 2016

Different from general operating policies to be applied for controllable queueing models, two of three well-known simple N, T and D operating policies are applied alternatingly to the single server controllable queueing models, so called alternating (NT), (ND) and (TD) policies. For example, the alternating (ND) operating policy is defined as the busy period is initiated by the simple N operating policy first, then the next busy period is initiated by the simple D operating policy and repeats the same sequence after that continuously. Because of newly designed operating policies, important system characteristic such as the expected busy and idle periods, the expected busy cycle, the expected number of customers in the system and so on should be redefined. That is, the expected busy and idle periods are redefined as the sum of the corresponding expected busy periods and idle periods initiated by both one of the two simple operating policies and the remaining simple operating policy, respectively. The expected number of customers in the system is represented by the weighted or pooled average of both expected number of customers in the system when the predetermined two simple operating policies are applied in sequence repeatedly. In particular, the expected number of customers in the system could be used to derive the expected waiting time in the queue or system by applying the famous Little's formulas. Most of such system characteristics derived would play important roles to construct the total cost functions per unit time for determination of the optimal operating policies by defining appropriate cost elements to operate the desired queueing systems.

• 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 Platform Technology
• /
• v.6 no.1
• /
• pp.17-23
• /
• 2018

Taxi's queue for entering into taxi stand makes traffic jam and congestion around taxi stand. If we make that taxi waits in another place around taxi stand, and can approach to taxi stand when it gets in its turn, these traffic jam and congestion around taxi stand can be reduced. In this paper, we propose entry sequence operating system for taxi stand to reduce traffic jam and congestion around taxi stand. In this system, taxi driver can request his sequence number, and the system issues sequence number to driver. When it is time to approach to taxi stand due to issued sequence number, the proposed system notifies to taxi driver via taxi terminal. Taxi getting the proposed service can wait in another place around taxi stand, and can approach to taxi stand after receiving notify for approaching. Therefore, the proposed system in this paper can reduce traffic jam and congestion around taxi stand because it can reduce or get rid of taxi's queue around taxi stand. We implement the taxi stand approach sequence management system proposed in this paper for taxi stand installed in Chungju-Si, Chungbuk. We use Google Cloud service and Android platform for implementing.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.613-620
• /
• 2016

This paper presents a MOHA(Many-Task Computing on Hadoop) framework which aims to effectively apply the Many-Task Computing(MTC) technologies originally developed for high-performance processing of many tasks, to the existing Big Data processing platform Hadoop. We present basic concepts, motivation, preliminary results of PoC based on distributed message queue, and future research directions of MOHA. MTC applications may have relatively low I/O requirements per task. However, a very large number of tasks should be efficiently processed with potentially heavy inter-communications based on files. Therefore, MTC applications can show another pattern of data-intensive workloads compared to existing Hadoop applications, typically based on relatively large data block sizes. Through an effective convergence of MTC and Big Data technologies, we can introduce a new MOHA framework which can support the large-scale scientific applications along with the Hadoop ecosystem, which is evolving into a multi-application platform.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.947-952
• /
• 2016

Most data centers attempt to consolidate servers using virtualization technology to efficiently utilize limited physical resources. Moreover, virtualized systems have commonly adopted contents-based page sharing mechanism for page deduplication among virtual machines (VMs). However, previous page sharing schemes are limited by the inability to effectively manage accumulated hints which mean sharable pages in stack. In this paper, we propose a priority-based hint management scheme to efficiently manage accumulated hints, which are sent from guest to host for improving page sharing opportunity in virtualized systems. Experimental results show that our scheme removes pages with low sharing potential, as compared with the previous schemes, by efficiently managing the accumulated pages.

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

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.113-130
• /
• 2002

In this paper, we developed DNL(Dynamic Network Loading) model based on Moving cell theory to analyze the dynamic characteristics of traffic flow in congested network. In this paper vehicles entered into link at same interval would construct one cell, and the cells moved according to Cell following rule. In the past researches relating to DNL model a continuous single link is separated into two sections such as running section and queuing section to describe physical queue so that various dynamic states generated in real link are only simplified by running and queuing state. However, the approach has some difficulties in simulating various dynamic flow characteristics. To overcome these problems, we present Moving cell theory which is developed by combining Car following theory and Lagrangian method mainly using for the analysis of air pollutants dispersion. In Moving cell theory platoons are represented by cells and each cell is processed by Cell following theory. This type of simulation model is firstly presented by Cremer et al(1999). However they did not develop merging and diverging model because their model was applied to basic freeway section. Moreover they set the number of vehicles which can be included in one cell in one interval so this formulation cant apply to signalized intersection in urban network. To solve these difficulties we develop new approach using Moving cell theory and simulate traffic flow dynamics continuously by movement and state transition of the cells. The developed model are played on simple network including merging and diverging section and it shows improved abilities to describe flow dynamics comparing past DNL models.