• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.5
• /
• pp.76-85
• /
• 1999

The intuitive understanding of the dynamic pattern generation in asymmetric networks may be useful for developing models of dynamic information processing. In this paper, dynamic behavior of the cyclic connection neural network, in which each neuron is connected only to its nearest neurons with binary synaptic weights of $\pm$ 1, has been investigated. Simulation results show that dynamic behavior of the network can be classified into only three categories: fixed points, limit cycles with basin and limit cycles with no basin. Furthermore, the number and the type of limit cycles generated by the networks have been derived through analytical method. The sufficient conditions for a state vector of $n$-neuron network to produce a limit cycle of $n$- or 2$n$-period are also given. The results show that the estimated number of limit cycles is an exponential function of $n$. On the basis of this study, cyclic connection neural network may be capable of storing a large number of dynamic information.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.73-80
• /
• 2010

The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.1
• /
• pp.68-76
• /
• 1999

The intuitive understanding of the dynamic pattern generation in asymmetric networks may be useful for developing models of dynamic information processing. In this paper, dynamic behavior of the ring connection neural network in which each neuron is only to its nearest neurons with binary synaptic weights of ±1, has been inconnected vestigated Simulation results show that dynamic behavior of the network can be classified into only three categories: fixed points, limit cycles with basin and limit cycles with no basin. Furthermore, the number and the type of limit cycles generated by the networks have been derived through analytical method. The sufficient conditions for a state vector of n-neuron network to produce a limit cycle of n- or 2n-period are also given The results show that the estimated number of limit cycle is an exponential function of n. On the basis of this study, cyclic connection neural network may be capable of storing a large number of dynamic information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.45-57
• /
• 2005

In this paper, we extend the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. Even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congetion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps. By analyzing the periodic bursty behavior of the source IP queue, we derive estimated for the maximum queue size and arrive at a simple predictor for the degraded throughput, applicable for relatively general situations.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.110-114
• /
• 1999

In this paper, we present formal three methodologies for intranet connection to remote and mobile user. The most important issue is information communication security in intranet solution. The structure of this methodology is composed of several remote and mobile connection methods. By three methodologies and experimental building network, we suggest direction for valid solution of intranet connection.

• Electronics and Telecommunications Trends
• /
• v.30 no.4
• /
• pp.120-128
• /
• 2015

최근 인터넷의 거대화와 더불어 기본적으로 ISP의 오버헤드를 최소화하는 요구사항을 만족시켜 줄 수 있는 역추적기술 보장에 큰 비중을 두고 있으며, 현재 또는 차세대 인터넷에서 적용 가능한 역추적기술이 필요하다. 본 논문은 사이버 표적공격(Advanced Persistent Threats: APT)에 적용 가능한 역추적(Traceback)기술에 대한 동향을 살펴본다. 특히 기존 IP 및 TCP Connection 기반 역추적방법 중 Network 기반 Connection 추적기술인 Timing-based Approach에 대해서 상세히 살펴보며 아울러 본 논문에서 제안하는 Netflow 기반의 ON-OFF 모델 확장을 통한 Timing-based Connection Traceback Approach의 기술적 적용을 통하여 공격 시스템의 위치와 실제 해킹을 시도하는 해커의 위치가 서로 다르다 하더라도 실제 해커의 위치인 공격 근원지를 추적할 수 있는 기술적 가능성 및 전망을 소개한다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.1
• /
• pp.135-139
• /
• 2014

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.55-62
• /
• 2023

Slotted-Aloha (S-Aloha) has been widely employed in random access networks owing to its simple implementation in a distributed manner. To enhance the throughput performance of the S-Aloha, connection-based slotted-Aloha (CS-Aloha) has been proposed in recent years. The fundamental principle of the CS-Aloha is to establish a connection with a short-sized request packet before transmitting data packets. Subsequently, the connected node transmits long-sized data packets in a batch of size M. This approach efficiently reduces collisions, resulting in improved throughput compared to the S-Aloha, particularly for a large M. In this paper, we address the short-term fairness of the CS-Aloha, as quantified by Jain's fairness index. Specifically, we evaluate how equitably the CS-Aloha allocatestime slots to all nodes in the network within a finite time interval. Through simulation studies, we identify the impact of system parameters on the short-term fairness of the CS-Aloha and propose an optimal transmission probability to support short-term fairness.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.120-129
• /
• 1992

In this paper we propose a fuzzy-neural network(FNN) which includes both advantages of the fuzzy logic and the neural network. The basic idea of the FNN is to realize the fuzzy rule-base and the process of reasoning by neural network and to make the corresponding parameters be expressed by the connection weights of neural network. After constructing the FNN, a novel controller consisting of a conventional P-controller and a FNN is explained. In this control scheme, the rule-base of a FNN are automatically generated by error back-propagation algorithm. Also the parallel connection of the P-controller and the FNN can guarantee the stability of a plant at initial stage before the rules are completely created. Finally the effectiveness of the proposed strategy will be verified by computer simulations using a 2 degree of freedom robot manipulator.