• 한국정보과학회논문지:정보통신
• /
• 제29권5호
• /
• pp.510-523
• /
• 2002

The routers in an active network perform customized computations on the messages flowing through them, while the role of routers in the traditional packet network, such as the Internet, is to passively forward packets as fast as possible. In contrast to the Internet, the processing in active networks can be customized on a per user or per application basis. Active networks allow users to inject information into the network, where the information describes or controls a program to be executed for the users by the routers as well as the end hosts. So the network users can realize the active networks by "programming" the network behavior via the programming interface exposed to them. In this paper, we devise a network protocol model and present a verification technique for reasoning about the correctness of an active application defined using the model. The technique is developed in a platform- and language-independent way, and it is algorithmic and can be automated by computer program. We give an example dealing with network auction to illustrate the use of the model and the verification technique.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 춘계학술대회
• /
• pp.792-798
• /
• 2003

This paper is about implementation of intelligent robot based on home network. Existing robots are mainly stand alone type. Home network is spreading rapidly and can play an important role as a path for informations between appliances in home. Robot can be more intelligent and have versatile functions with a junction of home network. By distribution of tasks through home network, robot doesn't have to process every task. In addition, robot can access to appliances through network as appliances are added continuously. In the future, smart space in which robot behaves on various types of network is in expectation. In this research, home network based system which consists of home server, embedded robot, and intelligent robot is proposed and implemented.

• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.301-314
• /
• 2013

In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.

• 한국통신학회논문지
• /
• 제19권3호
• /
• pp.434-441
• /
• 1994

본 논문에서는 생산 자동화 네트워크인 MAP에서 네트워크 관리 기능을 실현하기 위해 중용한 변수인 전송 지연과 버퍼크기 그리고 시스템의 안정도등의 트래픽 성능을 분석하였다. 네트워크 관리는 네트워크 상에서 통신이 정상적으로 수행되도록 자원의 제어 및 감독을 담당하는 것으로 네트워크 운영시 필수적으로 요구되는 기능이다. 그러나 MAP 네트워크는 운영시 빠른 응담성을 요구하기 때문에 네트워크 관리 시스템을 구현하여 운영하기 위해서는 네트워크 관리 활동으로 인한 영향을 고려하여야 한다. 네트워크 관리 시스템 동작시 발생하는 불균일한 트래픽을 분석하기 위해, 사이클릭 큐잉 모델을 이용해 해석적 방법과 시뮬레이션을 수행하여 대기 지연 시간과 버퍼 크기를 구했으며, 네트워크 관리 활동에 따른 시스템의 안정도를 분석하였다.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

• 산업경영시스템학회지
• /
• 제46권4호
• /
• pp.53-62
• /
• 2023

Effects-Based Operations (EBO) refers to a process for achieving strategic goals by focusing on effects rather than attrition-based destruction. For a successful implementation of EBO, identifying key nodes in an adversary network is crucial in the process of EBO. In this study, we suggest a network-based approach that combines network centrality and optimization to select the most influential nodes. First, we analyze the adversary's network structure to identify the node influence using degree and betweenness centrality. Degree centrality refers to the extent of direct links of a node to other nodes, and betweenness centrality refers to the extent to which a node lies between the paths connecting other nodes of a network together. Based on the centrality results, we then suggest an optimization model in which we minimize the sum of the main effects of the adversary by identifying the most influential nodes under the dynamic nature of the adversary network structure. Our results show that key node identification based on our optimization model outperforms simple centrality-based node identification in terms of decreasing the entire network value. We expect that these results can provide insight not only to military field for selecting key targets, but also to other multidisciplinary areas in identifying key nodes when they are interacting to each other in a network.

• 전자공학회논문지B
• /
• 제33B권10호
• /
• pp.130-138
• /
• 1996

In this paper, we propose a neural network which detect edges of different orentation and spatial frequency in arbitrary image data. We constructed the proposed neural network iwth two different types neural network. A diffusion network performs the gaussian operation efficiently by the diffusion process. And the spatial difference network has specially designed connections suitble to detect the contours of a specific oriention. Simulation results showed that the proposed neural network can extract the edges of selected orientation efficiently by applying the neural network to a test pattern and the real image.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.189-206
• /
• 2005

Much of work on network externality assumed network effects are dependent on the network size. Therefore, very little consideration is given to the view that marginal benefits from joining the network may not increase with the network size if consumer benefits come from the direct interaction with neighbors, namely local network. In this study, we used the agent-based simulation method to reexamine the effectiveness of the traditional network market strategy under the presence of the local network where two incompatible technologies compete. We found that the strategy of growing an initial customer base is not effective under the presence of the local network. Our study also showed that targeting customers based on their technology Preference is not as effective as targeting customers within the same local network. As a result, the focus of a network market strategy should be directed to taking advantage of the customer network.

• 한국정보통신학회논문지
• /
• 제17권10호
• /
• pp.2281-2287
• /
• 2013

네트워크 코딩은 통신의 새로운 패러다임이다. 네트워크 코딩에서 중간 노드는 입력 패킷을 조합하여 새로운 패킷을 생성하여 이웃 노드에게 방송한다. 네트워크 코딩은 실제 네트워크에 폭넓게 적용될 수 있기 때문에 정보 이론의 주요 연구 분야로 빠르게 떠오르고 있다. 네트워크 코딩은 무선 멀티홉 네트워크에서 처리량과 채널 효율을 향상시킬 것으로 예상된다. 관련 선행연구들이 무선 Ad-hoc 네트워크 분야에서 활발히 이루어지고 있다. 우리의 연구에서 중간노드는 네트워크 코딩을 하기위해서 단일홉 양방향 패킷을 식별한다. 우리는 제안된 기법이 네트워크 패킷의 디코딩 성공률을 증가시킬 수 있을 것으로 기대한다. 컴퓨터 시뮬레이션에서 제안된 네트워크 코딩기법은 코딩 이득과 패킷 전송률에서 기존의 네트워크 코딩기법보다 나은 성능을 얻을 수 있었다.

• 정보처리학회논문지C
• /
• 제16C권4호
• /
• pp.511-520
• /
• 2009

그리드는 지리적으로 분산된 다양한 컴퓨팅 자원을 초고속 네트워크로 연결하여 고속 연산과 대용량 데이터의 처리를 가능하게 하는 기술이다. 서비스 품질이 보장되는 그리드 환경의 작업 수행을 위해서 컴퓨팅 자원뿐만 아니라 네트워크 자원의 관리와 제어가 요구된다. 본 논문에서는 그리드 네트워크 경로 및 자원의 생성과 예약을 지원하기 위하여 그리드 네트워크 자원의 정보 모델과 그리드 네트워크 서비스 인터페이스를 정의하였다. 그리드 네트워크 서비스 인터페이스에는 기존 GLIF의 자원 생성 및 예약 관련 메시지 이외에 그리드 네트워크 경로와 통보 메시지를 추가로 정의하였다. 또한, 두 단계 자원 예약 메커니즘을 지원하기 위하여 관련 상태와 메시지를 정의하였다. 그리드 네트워크 자원의 정보 모델과 그리드 네트워크 서비스 인터페이스를 이용하여 네트워크 자원 관리 시스템을 설계 및 구현하였으며, GMPLS 기반의 제어및 전달망을 갖는 그리드 환경에서 자원의 예약과 할당 및 해제를 실험하였다.