• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권3호
• /
• pp.916-937
• /
• 2023

Most of the existing Distributed Denial-of-Service mitigation schemes in Software-Defined Networking are only implemented in the network domain managed by a single controller. In fact, the zombies for attackers to launch large-scale DDoS attacks are actually not in the same network domain. Therefore, abnormal traffic of DDoS attack will affect multiple paths and network domains. A single defense method is difficult to deal with large-scale DDoS attacks. The cooperative defense of multiple domains becomes an important means to effectively solve cross-domain DDoS attacks. We propose an efficient multi-domain DDoS cooperative defense mechanism by integrating blockchain and SDN architecture. It includes attack traceability, inter-domain information sharing and attack mitigation. In order to reduce the length of the marking path and shorten the traceability time, we propose an AS-level packet traceability method called ASPM. We propose an information sharing method across multiple domains based on blockchain and smart contract. It effectively solves the impact of DDoS illegal traffic on multiple domains. According to the traceability results, we designed a DDoS attack mitigation method by replacing the ACL list with the IP address black/gray list. The experimental results show that our ASPM traceability method requires less data packets, high traceability precision and low overhead. And blockchain-based inter-domain sharing scheme has low cost, high scalability and high security. Attack mitigation measures can prevent illegal data flow in a timely and efficient manner.

• 한국정보과학회논문지:정보통신
• /
• 제34권2호
• /
• pp.120-133
• /
• 2007

전송-수신 쌍들을 연결하는 많은 수의 경로들로 이루어진 멀티캐스트 트리에서 네트워크 구성요소의 실패는 멀티캐스트 트리의 일부를 손상시킬 수 있다. 그러나 하나의 구성요소의 실패를 복구하기 위해 전체 멀티캐스트 트리를 다시 만드는 것은, 실패의 영향을 받지 않은 경로를 사용하는 그룹 멤버들까지도 서비스의 중단을 겪어야 하기 때문에 바람직하지 않다. 본 논문은 QoS 멀티캐스트 트리에서 재구성해야 할 영역을 줄이면서 재구성의 성공 가능성을 최대화하는 계획된 재구성(Pre-Planned Reconfiguration: PPR) 정책을 제안한다. PPR 방식은 멀티캐스트 트리의 전송-수신 쌍을 연결하는 각 경로에 재구성 경로를 미리 만들고, 이들 경로에 필요한 자원을 미리 예약해 둔다. 이를 위해 우리는 기존 멀티캐스트 트리의 변화를 최소화하며 손상되지 않은 부분들의 서비스를 최대한 유지하는 재구성 경로의 라우팅 방법을 고안하였으며, 효율적 자원 공유 방법을 사용하여 재구성 경로들을 위해 예약된(실패가 일어나지 않을 경우 사용되지 않는) 자원의 양을 줄인다. PPR 방식은 실패 복구를 위해 여러 멀티캐스트 세션들이 동시에 엄청난 경쟁을 하는 것을 막을 수 있다. 시물레이션을 통해 최단경로 라우팅을 사용하는 전송자 중심 멀티캐스트 트리와 공유 멀티 캐스트 트리에서 각각 성능을 평가한 결과 PPR 방식은 적당한 오버헤드내에서 모든 그룹 멤버들에게 성공적인 재구성을 제공한다. 또한 PPR 방식은 그룹 멤버쉽이 동적으로 변화할 때에도 잘 적응한다.

• ETRI Journal
• /
• 제42권1호
• /
• pp.7-16
• /
• 2020

Assuming omnidirectional antenna reception, the ITU-R recently developed a new propagation model on building entry loss (BEL) for 5G millimeter-wave frequency sharing and compatibility studies, which is a simplified outdoor-to-indoor path loss model. Considering the utilization of high-gain narrow-beamwidth beamforming, the omnidirectional-based ITU-R BEL model may not be appropriate to predict propagation characteristics for directional beamforming scenarios. This paper studies the effects of beamwidth on the ITU-R BEL model. This study is based on field measurements collected with four different beamwidth antennas: omnidirectional, 10° horn, 30° horn, and 60° horn. The measurement campaigns were conducted at two types of building sites: traditional and thermally efficient buildings. These sites, as well as the measurement scenarios, were carefully chosen to comply with the ITU-R BEL measurement guidelines and the ITU-R building types. We observed the importance of accurate beam alignment from the BEL variation range. We were able to quantify the beamwidth dependency by fitting to a model that is inversely proportional to the beamwidth.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1607-1616
• /
• 2006

The growing market of multimedia and digital signal processing requires significant data-path portions of SoCs. However, the common models for verification are not suitable for SoCs. A novel model--WGL (Weighted Generalized List) is proposed, which is based on the general-list decomposition of polynomials, with three different weights and manipulation rules introduced to effect node sharing and the canonicity. Timing parameters and operations on them are also considered. Examples show the word-level WGL is the only model to linearly represent the common word-level functions and the bit-level WGL is especially suitable for arithmetic intensive circuits. The model is proved to be a uniform and efficient model for both bit-level and word-level functions. Then Based on the WGL model, a backward-construction logic-verification approach is presented, which reduces time and space complexity for multipliers to polynomial complexity(time complexity is less than $O(n^{3.6})$ and space complexity is less than $O(n^{1.5})$) without hierarchical partitioning. Finally, a construction methodology of word-level polynomials is also presented in order to implement complex high-level verification, which combines order computation and coefficient solving, and adopts an efficient backward approach. The construction complexity is much less than the existing ones, e.g. the construction time for multipliers grows at the power of less than 1.6 in the size of the input word without increasing the maximal space required. The WGL model and the verification methods based on WGL show their theoretical and applicable significance in SoC design.

• ETRI Journal
• /
• 제39권1호
• /
• pp.41-50
• /
• 2017

In connection-oriented data transport services, data loss can occur when a service experiences a problem in its end-to-end path. To resolve the problem promptly, the data transport systems providing the service must quickly modify their internal configurations, which are distributed among different locations within each system. The configurations are modified through a series of problem (event) handling procedures, which are carried out by multiple control processors in the system. This paper proposes a provisioning-to-signaling method for inter-control-processor messaging to improve the time efficiency of event processing. This method simplifies the sharing of the runtime event, and minimizes the time variability caused by the amount of event data, which results in a decrease in the latency time and an increase in the time determinacy when processing global events. The proposed method was tested for an event that required 4,000 internal path changes, and was found to lessen the latency time of global event processing by about 50% compared with the time required for general methods to do the same; in addition, it reduced the impact of the event data on the event processing time to about 30%.

• 보건의료산업학회지
• /
• 제14권2호
• /
• pp.1-14
• /
• 2020

Objectives : The purpose of this study was to test fitness of the structured model of SNS activities for health information. Methods : A structured questionnaire were administered to 500 subjects. A structural equation model was applied to collected data. Results : The response rate was 73.9%. The respondents mostly used Facebook and KakaoStory. They spent 70 minutes per day and 21~30% of this usage was taken by health information. In the variances, those who has religion more actively exchanged information about diseases and medical institutions. The goodness-of-fit of the model was .81(GFI) and .90(CFI). The main path was bridging capital -> bonding capital -> credibility -> SNS activities for health information. The path from quality of sharing information to SNS activities was not significant. It could be explained by the restriction of digital literacy. Conclusions : SNS activities for health information were determined by credibility, currency and bonding social capital. Bridging social capital, indirectly, influenced SNS activities through bonding social capital. Thus building bonding social capital would be a critical success factor for SNS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3120-3137
• /
• 2021

Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 D
• /
• pp.2900-2902
• /
• 2005

본 논문에서는 환경과 시스템의 상호작용을 통한 경험에 의해 습득된 정보를 개체간 네트워크를 통하여 갱신하는 과정을 구성하는 연구를 하였다. 기존의 연구에서는 강화학습 알고리즘을 이용하여 임의의 구역에 대한 지도 정보를 습득하고 이를 바탕으로 개체들 각각의 최적의 행동 정책을 구성하는 바 이 때 각각의 체개체가 가지고 있는 최단경로에 대한 정보의 우위를 결정하는 과정을 추가하였다. 이를 바탕으로 최종적으로 선택된 경로에 대한 정보를 업데이트하여 구성 된 네트워크를 통한 개체간 데이터를 동시에 공유하는 과정을 거쳐서 각각의 시스템이 스스로 정보를 갱신하는 방법을 제안하였다 또한 이 제안한 개념의 적합성을 입증하기 위하여 개체간의 정보를 통합하고 비교하는 실험을 수행하여 성공적인 결과를 얻었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.915-920
• /
• 1987

When a task requires two robot arms to move in a cooperative manner sharing a common workspace, potential collision exists between the two robot arm . In this paper, a novel approach for collision-free trajectory planning along paths of two SCARA-type robot arms is presented. Specifically, in order to describe potential collision between the links of two moving robot arms along the designated paths, an explicit form of "Virtual Obstacle" is adopted, according to which links of one robot arm are made to grow while the other robot arm is forced to shrink as a point on the path. Then, a notion of "Coordination Chart" is introduced to visualize the collision-free relationship of two trajectories.of two trajectories.

• Journal of the Korean Data and Information Science Society
• /
• 제21권3호
• /
• pp.605-619
• /
• 2010

Caching of frequently accessed data in multi-hop ad hoc environment is a technique that can improve data access performance and availability. Cooperative caching, which allows sharing and coordination of cached data among several clients, can further en-hance the potential of caching techniques. In this paper, we propose a fuzzy cooperative caching scheme in mobile ad hoc networks. The cache management of the proposed caching scheme not only uses adaptively CacheData or CachePath based on data sim-ilarity and data utility, but also uses the replacement manager based on data pro t. Also, the proposed caching scheme uses a prefetch manager. When the TTL of the cached data expires, the prefetch manager evaluates the popularity index of the data. If the popularity index is larger than a threshold, the data is prefetched. Otherwise, its space is released. The performance of the proposed scheme is evaluated analytically and is compared to that of other cooperative caching schemes.