• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.547-554
• /
• 2005

Ethernet has been given a greater attention recently due to tendency of unifying most of transmission technique to ethernet. This paper studied the design of MAC which contains high layer interface, transmit engine, flow control block, receive engine, reconciliation sublayer, configuration block, statistics block, and XGMll interface block. Performance evaluation was performed using C language for 10cbps ethernet Data Link to design the optimum hardware, then internal FIFO and initial parameters were evaluated. When offered load is $95\%$, the size of the internal FIFO is required 512-word. When offered load is $97\%$, the size of the internal FIFO is required 1024-word. Based on the result of performance evaluation, MAC was designed in VHDL Language and verified using simulator. MAC core that processes 64-bit data, operates at 168.549MHz and hence supports the maximum 10.78Gbps. The designed MAC core is applicable to an area that needs a high-speed data processing of 10Gbps or more.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.812-820
• /
• 2006

Ethernet has been given a greater attention recently due to tendency of unifying most of transmission technique(not only LAN, but MAN and WAN) to ethernet. Performance evaluation was performed using C language for 10Gbps ethernet Data Link to design the optimum hardware, then internal FIFO size was evaluated. In this paper, MAC core for 10Gbps ethernet which contains high layer interface, transmit engine, flow control block, receive engine, reconciliation sublayer, configuration block, statistics block, and XGMII interface block was designed using VHDL language and Xilinx 6.2i tool and verified using Model_SIM 5.7G simulator. According to the specification of 10Gbps ethernet, MAC core with 64-bit data path should support 156.25MHz in order to support 10Gbps. The designed MAC core that process 64-bit data, operates at 168.549MHz and hence supports the maximum 10.78Gbps data processing. The designed MAC core is applicable to an area that needs a high-speed data processing of 10Gbps or more.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.113-116
• /
• 2005

In general, multiple mobile hosts (MH) access at a base station (BS) that terminates the wired link and relays data flow to the wireless link in wired and wireless heterogeneous network. In this network, the BS is tend to be a bottleneck and to degrade a network performance. Many studies have been done throughout several protocol layers. Especially on the transport layer, many techniques were studied to enhance TCP performance. But most of them are concerned to enhance TCP throughput and TCP fairness is hardly considered. In this paper, an algorithm for enhancing TCP fairness is proposed and its performance is verified by ns-2 simulation.

• Journal of Korean Society of Transportation
• /
• v.19 no.1
• /
• pp.89-99
• /
• 2001

The conventional studies on equilibrium network design problem(ENDP) with fixed travel demand models assume that the future OD travel demand might not be changed even if the structure and the capacity of the network are improved. But this fixed demand assumption may loose its validity in the long-range network design because OD travel demand actually shifts with the network service level. Thus, it is desirable to involve the variable travel demand which is determined endogenously in the model in the optimal network design. In this paper a hi-level model formulation and solution procedure for ENDP with variable travel demand are presented. Firstly It is considered how to measure the net user benefits to be derived from the improved in link capacities, and the equilibrium network design problem considered here is to maximize the increase of net user benefit which results from a set of lift capacity enhancements within the budget constraints, while the OD travel demands and link travel times are obtained by solving the lower level network equilibrium problem with variable demand. And secondly sensitivity analysis is carried out to find the links to which the network equilibrium flow pattern is the most sensitive. Finally numerical example with simple network is carried out to test the validity of the model.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.5
• /
• pp.1063-1075
• /
• 2019

In recent years, industrial automation has been established and WISN (Wireless Industrial Sensor Network) has been introduced for efficient system management. By introducing WISN, many engineering costs have been reduced and process processors have been optimized. And communication flow using wireless is increasing. An empirical study on industrial wireless sensor networks is actively conducted, but there are few security studies on them and they are exposed to such threats. If there is a problem with the standard of the wireless communication protocol itself, the device that is certified according to the standard may also be subject to security threats including problems. We analyze security functions and threats of ISA 100.11a and WirelessHART protocol stack based on standards. Procedures for distributing the security key are not provided or it is vulnerable using the Global Data Link key when the device enters the network. This paper presents the problems of the standard itself and presents the security requirements accordingly.

• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.97-105
• /
• 2019

The tactical mobile ad-hoc network(MANET) consists of distributed autonomous networks between individual ground nodes, which is effective in terms of network survivability and flexibility. However, due to constraints such as limited power, terrain, and mobility, frequent link disconnection and shadow area may occur in communication. On the other hand, the satellite network has the advantage of providing a wide-area wireless link overcoming terrain and mobility, but has limited bandwidth and high-latency characteristic. In the future battlefield, an integrated network architecture for interworking multi-layer networks through a heterogeneous network gateway (HNG) is required to overcome the limitations of the existing individual networks and increase reliability and efficiency of communication. In this paper, we propose a new HNG architecture and detailed algorithm that integrates satellite network and the tactical MANET and enables reliable data transfer based on flow characteristics of traffic. The simulations validated the proposed architecture using Riverbed Modeler, a network-level simulator.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.5
• /
• pp.9-15
• /
• 2023

In this paper, we propose a method predicting the speed of each lane from the link speed using a neural network. We took three measures for configuring learning data to increase prediction accuracy. The first one is to expand the spatial range of the data source by including 14 links connected to the beginning and end points of the link. We also increased the time interval from 07:00 to 22:00 and included the data generation time in the feature data. Finally, we marked weekdays and holidays. Results of experiments showed that the speed error was reduced by 21.9% from 6.4 km/h to 5.0 km/h for straight lane, by 12.9% from 8.5 km/h to 7.4 km/h for right turns, and by 5.7% from 8.7 km/h to 8.2 km/h for left-turns. As a secondary result, we confirmed that the prediction accuracy of each lane was high for city roads when the traffic flow was congested. The feature of the proposed method is that it predicts traffic conditions for each lane improving the accuracy of prediction.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.38-45
• /
• 2012

Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.29-40
• /
• 2004

In this paper, we propose a new early congestion detection and notification technique called QR-AQM. Unlike RED and it's variation, QR-AQM measures the total traffic rate from TCP sessions, predicts future network congestion, and determine the packet marking probability based on the measured traffic rate. By incorporating the traffic rate in the decision process of the packet marking probability, QR-AQM is capable of foreseeing future network congestion as well as terminating congestion resolution procedure in much more timely fashion than RED. As a result, simulation results show that QR-AQM maintains the buffer level within a fairly narrow range around a target buffer level that may be selected arbitrarily as a control parameter. Consequently, compared to RED and its variations, QR-AQM is expected to significantly reduce the jitter and delay variance of packets traveling through the buffer while achieving nearly identical link utilization.

• Cartoon and Animation Studies
• /
• s.33
• /
• pp.271-291
• /
• 2013

Cartoons exhibit contents and images and deliver them to readers by repeating frames. Frames embody the cross sectional factors of space-time, and the repetition of frames makes those cross sectional factors into a continuous flow. The gutter, which exists between frames, takes the role to make the continuous flow link smoothly, and at the beginning stage of the gutter, the operating of the gutter was usually passive by the frame meanings. However, the gutter is not just a medium for linking the frames, but is an efficient participation device for creating new expression methods of cartoon organization. By producing new directing methods for cartoon organization, the distinctive functions of the gutter have been kept alive with cartoon history. The distinctive functions of the gutter can be divided largely into transition function, reminiscence function, speech balloon function, pen function, and decorative function. And those functions perform actively as direct expression method of the gutter. When those functional methods are expressed by the author's intention and the frequency of them is generalized according to described contents, using each author's individual differences can suggest direction for new directing organization of cartoons.