• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.11-19
• /
• 2011

In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information for source routing in transport networks that conduct hierarchical QoS routing. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. This method selects the main path weight in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some path weight during aggregation process. In this paper, the main path weight is defined as outlier. Service Boundary Line has 2k+5parameters. k is the number of outliers. The number of storage spaces of Service Boundary Line changes according to the number of outliers. Simulation results show that our approximation method requires a storage space that 1.5-2 times larger than those in other known techniques depending on outlier selection method, but its information accuracy of proposed method in the ratio between storage space and information accuracy is higher.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.467-469
• /
• 2006

In wireless network environments, as users' demands on high-speed data communications due to increase of multi-media services, the necessity of new high-speed WLAN technologies has appeared. Nowaday, IEEE is standardizing a new WLAN protocol caned as IEEE 802.11n. To effectively use wireless resources, IEEE 802.11n introduces MAC aggregation function which is similar to that in IEEE 802.11e. In case of transmitting several frames without MAC aggregation, the frames include individual frame header and trailer, and their corresponding acknowledgement frames can appear on wireless link. However, if they are aggregated into single MAC frame, we can reduce the number of used bits due to frame headers/trailers and also remove redundant acknowledgement frames. In this paper, we explain two different MAC frame aggregation methods for IEEE 802.11e and IEEE 802.11n and evaluate their throughput by simulations.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.419-427
• /
• 2007

In wavelength-division-multiplexing(WDM) networks a link failure may cause the failure of several high-bit-rate optical channels, thereby leading to large data loss. Recently, various protection and restoration mechanisms have been proposed to efficiently deal with this problem in mesh networks. Among them, dedicated path protection(DPP) is a promising candidate because of its ultra-fast restoration time and robustness. In this work we investigate the issue of planning and optimization of WDM networks with DPP. Integer linear programming(ILP), in particular, is one of the most common exact method to solve the design optimization problem for protected WDM networks. Traditional ILP formalizations to solve this problem rely on the classical flow or route formulation approaches, but both these approaches suffer from a excessively high computational burden. In this paper, we present a variable-aggregation method that has the ability of significantly reducing the complexity of the traditional flow formulation. We compare also the computational burden of flow formulation with variable aggregation both with the classical flow and route formulations. The comparison is carried out by applying the three alternative methods to the optimization of two case-study networks.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.80-88
• /
• 2023

RGB-thermal (RGB-T) tracking using unmanned aerial vehicles (UAVs) involves challenges with regards to the similarity of objects, occlusion, fast motion, and motion blur, among other issues. In this study, we propose dynamic tracking aggregation (DTA) as a unified framework to perform object detection and data association. The proposed approach obtains fused features based a transformer model and an L1-norm strategy. To link the current frame with recent information, a dynamically updated embedding called dynamic tracking identification (DTID) is used to model the iterative tracking process. For object association, we designed a long short-term tracking aggregation module for dynamic feature propagation to match spatial and temporal embeddings. DTA achieved a highly competitive performance in an experimental evaluation on public benchmark datasets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1236-1243
• /
• 2000

본 논문은 LAN의 대역폭을 증가 시키기 위하여, 여러 개의 링크를 논리적인 하나의 링크처럼 동작하도록 하는 다중링크통함(link aggregation)기술에 대한 것이다. 우리는 망 구성에 따라 이 기술의 동작방식이 상이함에 착안하여, 두 가지의 새로운 프레임 분배방식을 제안하고 SIMULA를 이용한 모의실험으로 성능을 분석하였다. 먼저, LAN스위치와 스위치간에 적용 가능한 동적 프로엠 분배방식을 제안하였다. 이 방식은 특정 포트로 집중되는 프레임들을 분산시키기 위하여 가장 이용율이 낮은 링크를 동적으로 추가하는 것으로서, 링크 추가시 프레임들의 전달순서를 지킬 수 있도록 특별한 플러쉬 버퍼를 사용하였다. 모의실험 결과, 프러임간의 순서가 유지되면서도 스위치의 내부 버퍼에서의 프레임 폐기율이 기존 방식에 비해 감소됨을 확인하였다. 그리고, 단말과 단말간에 다중링크가 사용된 경우, 수신된 프레임들 간의 순서 뒤바뀜 문제에 대한 해결책으로 패딩 방법과, 태깅 방법, 프레임 분할 방식 등의 세가지으 프레임 분배방식을 제안하고 성능을 분석하였다. 이러한 세가지 방법 중에서 프레임 분할방식이 가장 성능면에서 우수함이 모의실험결과\ulcorner서 알 수 있지만, 패딘 방식도 구현관점에서 장점이 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.25-27
• /
• 2003

본 논문은 10GbE로의 망 전개에 따라 구현될 l0Gb 스위치에 필요한 계층2 부가서비스들 중에서 여러개의 물리적인 링크를 하나의 논리적인 링크로 집합하여 대역폭의 증가를 가져오는 링크 집합(Link Aggregation) 기술에 필요한 프레임 분배방식에 대한 것이다. 링크 집합 기술은 분배 알고리즘의 설계에 따라 스위치에서 성능의 차이를 가져오므로 링크 집합의 장정을 살리려면 종은 성능을 가지는 분배 알고리즘이 필요하다. 우선 링크 집합의 간단한 구현 방법을 살펴보고 기존에 제시된 스위치와 스위치 사이에서의 프레임 분배방식인 정적/동적 프레임 분배 방식과 우리가 새로이 제안한 패딩을 이용한 분배방식을 비교한 후, 정적/동적 프레임 분배 방식과 패딩을 이용한 분배방식을 컴퓨터 시뮬레이션을 통해 성능을 비교하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.79-81
• /
• 2019

Collecting data in wireless sensor networks in minimum time is a traditional problem which is known NP-hard. Previous studies built the schedule using the node-based or link-based metrics to prioritize the transmissions. In this work, we combine the effect of both metrics to obtain a smaller aggregation time. We compare our work with state of the art schemes and report the improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1057-1059
• /
• 2016

A construction method of energy-efficient data aggregation tree is proposed by considering a tradeoff between acquisition time and energy consumption in wireless sensor networks. This proposed method constructs the data aggregation tree to minimize the link cost between the connected nodes for reducing energy consumption, while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed aggregation tree can be generated with low complexity and achieves high energy efficiency compared to conventional methods.

• International Journal of Highway Engineering
• /
• v.16 no.3
• /
• pp.119-129
• /
• 2014

PURPOSES : This investigational survey is to observe a proper spatial aggregation method for path travel time estimation using the hi-pass DSRC system. METHODS : The links which connect the nodes of section detectors location are used for path travel time estimation traditionally. It makes some problem such as increasing accumulation errors and processing times. In this background, the new links composition methods for spatial aggregation are considered by using some types of nodes as IC, JC, RSE combination. Path travel times estimated by new aggregation methods are compared with PBM travel times by MAE, MAPE and statistical hypothesis tests. RESULTS : The results of minimum sample size and missing rate for 5 minutes aggregation interval are satisfied except for JC link path travel time in Seoul TG~Kuemho JC. Thus, it was additionally observed for minimum sample size satisfaction. In 15, 30 minutes and 1 hour aggregation intervals, all conditions are satisfied by the minimum sample size criteria. For accuracy test and statistical hypothesis test, it has been proved that RSE, Conzone, IC, JC links have equivalent errors and statistical characteristics. CONCLUSIONS : There are some errors between the PBM and the LBM methods that come from dropping vehicles by rest areas. Consequently, this survey result means each of links compositions are available for the estimation of path travel time when PBM vehicles are missed.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.2 s.5
• /
• pp.129-140
• /
• 2004

In this paper, we conduct the research about optimal aggregation interval of travel time data on interrupted traffic flow and verify the reliability of AVI collected data by using car plate matching method in RTMS for systematic collection and analysis of link travel time data on interrupted traffic flow rural arterial. We perform Kolmosorov-Smirnov test on AVT collected sample data and on entire population data, and conclude that the sample data does not represent pure random sampling and hence includes sample collection error. We suggest that additional review is necessary to investigate the effectiveness of AVI collected sample data as link representative data. We also develop statistical model by applying two estimation techniques namely point estimation and interval estimation for calculating optimal aggregation interval. We have implemented our model and determine that point estimate is preferable over interval estimate for exactly selecting and deciding optimal aggregation interval. Our final conclusion is that 5-minute aggregation interval is optimal to estimate travel time in RTMS, as is currently being used our investigation is based on AVI data collected from Yang-ji to Yong-in $42^{nd}$ National road.