• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.765-768
• /
• 2006

센서 네트워크에서 데이터 병합 시 타임아웃 스케줄링은 각 센서노드가 자식노드로부터 메시지를 받기 위해 기다려야하는 시간을 조절하는 것이다. 본 논문에서는 데이터 패턴의 변화에 따라 타임아웃을 적응적으로 조절하는 새로운 타임아웃 스케줄링 기법인 ATS-DA(Adaptive Timeout Scheduling for Data Aggregation)를 제안한다. ATS-DA는 자식노드로부터 수신한 데이터가 특별한 이벤트 없이 기준 데이터 변동률 범위 내에 있게 되면 타임아웃 값을 줄인다. 타임아웃을 작게 하면 파워 소모가 감소하고 전송 지연도 짧아진다. 센싱 데이터가 기준 데이터 변동률을 벗어나면 보다 정확한 데이터 병합 값을 얻기 위해 타임아웃 값을 늘린다. 시뮬레이션 결과에서 제안하는 ATS-DA 기법이 기존 캐스케이딩 타임아웃 스케줄링 기법에 비해 데이터 정확도와 파워 소모 측면에서 우수한 성능을 보여주었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9A
• /
• pp.1535-1541
• /
• 2001

TCP is the most widely-used transport layer protocol in current Internet, while ATM technology is used to increase the data communication speed at data link layer and network layer. In the TCP-over-ATM architecture, the most significant problems are (i) the partial packet discarding problem, and (ii) the TCP window timeout problem. Several approaches have been proposed to solve the partial packet discard problem and the timeout problem individually, but none of them considered the two problems together. In this paper, we propose an enhanced UBR+ scheme which supports fairness among the TCP connections using UBR+ scheme, and provides protection of damaged VC from the multiple packet losses in the same TCP sliding window. To analyze its performance, we simulate the proposed scheme using OPNET. The simulation results show that the proposed scheme supports fairness, and also increases the throughput by reducing the probability of multiple cell losses in the same TCP window.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.780-783
• /
• 2015

MODBUS/TCP는 단순하며 기능이 다양해 산업제어시스템에서 높은 점유율로 사용되는 통신 프로토콜이다. 오랜 시간 많은 사용과 더불어 안전한 MODBUS/TCP를 위한 연구 또한 많이 이루어졌지만, 이는 공개키 적용, SSL과 같은 라이브러리 연동, SCTP와 연동한 Hybrid 형식 등이 대부분이다. hard real system에서 주로 사용되는 MODBUS/TCP는 무엇보다 정해진 timeout 시간 내에 통신이 이루어지도록 해야 한다. 따라서 앞서 말한 방법은 하드웨어 가속기, 충분한 메모리 요구량 등의 문제가 따른다. 본 논문은 hard real system의 산업제어시스템에서 요구하는 timeout 시간을 충족하며 안전한 통신을 제공하는 보안 적용 방안을 소개하며 실험의 결과를 통해 실질적으로 효과적인 대안임을 보이고자 한다.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.443-451
• /
• 2005

Stateful inspection devices must maintain flow information. These devices create the flow information also for network attack packets, and it can fatally inflate the dynamic memory allocation on stateful inspection devices under network attacks. The memory inflation leads to memory overflow and subsequent performance degradation. In this paper, we present a guideline to set the flow entry timeout for a stateful inspection device to remove harmful embryonic entries created by network attacks. Considering Transmission Control Protocol (TCP) if utilized by most of these attacks as well as legitimate traffic, we propose a parsimonious memory management guideline based on the design of the TCP and the analysis of real-life Internet traces. In particular, we demonstrate that for all practical purposes one should not reserve memory for an embryonic TCP connection with more than (R+T) seconds of inactivity where R=0, 3, 9 and $1\leqq{T}\leqq{2}$ depending on the load level.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.43-54
• /
• 2010

The existing timeout based cache leakage management techniques reduce the leakage energy consumption of the cache significantly by switching off the power supply to the inactive cache line. Since these techniques were mainly proposed for single-processor systems, their efficiency is reduced significantly in multiprocessor systems with a shared L2 cache because of the cache interferences among simultaneously executing tasks. In this paper, we propose a novel cache partition strategy which partitions the shared L2 cache considering the inactive cycles of the cache line. Furthermore, we propose the adaptive task-aware timeout management technique which considers the characteristics of each task and adapts the timeout dynamically. Experimental results from the simulation show that the proposed technique reduces the leakage energy consumption of the shared L2 cache by 73% for the 2-way CMP and 56% for the 4-way CMP on average compared to the existing representative leakage management technique, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.218-225
• /
• 2005

Although Snoop protocol can enhance TCP throughput efficiently in a wired-cum-wireless environment, it has a problem in performing local packet retransmissions under a burst error-prone wireless link. AT-Snoop protocol is proposed to cope with this Snoop protocol's problem by adopting adaptive timer. In this paper, TCP throughputs of AT-Snoop protocol have been analyzed with varying wireless link conditions and the ways of setting parameters of AT-Snoop protocol for higher TCP throughput are found out through computer simulations. From the simulation results, AT-Snoop protocol's two parameters, local retransmission threshold value and local retransmission timeout value, are closely related with the fading changing rate. To get higher TCP throughput, local retransmission threshold value and local retransmission timeout value should be set to a little bit larger values than average WSRTT(Wireless Smoothed Round Trip Time) and mean bad period of the wireless link, respectively.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.451-458
• /
• 2010

To detect and recover packet losses over wireless links is very important in terms of reliability in packet transmission. Most wireless communication systems adopt an automatic repeat request (ARQ) protocol operating at link layer. However, it has been constantly addressed that the interaction not harmonized sufficiently between ARQ and TCP rather degrades TCP performance. In this paper, therefore, we propose an improved scheme from the aspect of the interaction with TCP loss recovery mechanism that can be applied to selective repeat ARQ (SR-ARQ) protocol and prove that the proposed scheme improves TCP performance significantly by OPNET simulations.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.300-307
• /
• 2008

Power management (PM) depends on the power state transition and system workload. The system model is composed of corresponding stochastic models of the power state and system queue. In this paper, stochastic models which can handle various PM techniques are developed. SRN (Stochastic Reward Nets), an extended Petri-Net, has facilities that represent system queue and various modelling functions. The SRN is employed for developing PM models. An adaptive timeout PM model is also introduced and the power consumption and performance of this model are compared with other existing PM techniques models such as greedy and N-Policy techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.333-351
• /
• 2008

Transmission control protocols have to overcome common problems in wireless networks. TCP employing both packet loss discrimination mechanism and available bandwidth estimation algorithm, known as the good existing solution, shows significant performance enhancement in wireless networks. For instance, TCP New Jersey which exhibits high throughput in wireless networks intends to improve TCP performance by using available bandwidth estimation and congestion warning. Even though it achieves 17% and 85% improvements in terms of goodput over TCP Westwood and TCP Reno, respectively, we further improve it by exploring maximized available bandwidth estimation, handling bit-error-rate error recovery, and effective adjustment of sending rate for retransmission timeout. Hence, we propose TCP NJ+, showing that for up to 5% packet loss rate, it outperforms other TCP variants by 19% to 104% in terms of goodput when the network is in bi-directional background traffic.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.508-510
• /
• 2000

본 논문에서는 프레임 릴레이(Frame Relay : FR) 망과 ATM(Asynchronous Transfer Mode) 망이 연동할 때, 분석 대상인 연동장치(InterWorking Unit : IWU) 수신부에서 프레임이 처리되는데 걸리는 지연시간을 분석하였다. ATM과 FR 사이의 데이터 처리속도의 차이로 인하여 연동장치의 버퍼에서 프레임이 기다리게 된다. 이 때 지연시간을 IWU에서 ATM 망에서 들어오는 프레임의 평균값을 구한 다음에 Little's formula를 이용하여 수학적으로 분석하였다. 결과적으로 FR 연결된 수가 증가할수록 연동장치에서 프레임의 지연시간은 지수적으로 증가함을 알 수 있었다. 또한 지연시간을 분석하므로 해서 연동장치에서 timeout의 시간을 결정하여 프레임을 재전송할 수 있는 시간을 결정할 수 있었다.