• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.664-674
• /
• 1996

In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2839-2846
• /
• 2014

New VHF band for use in VDE is determined by WRC-12 due to the overload of AIS VDL, and the system characteristics of the VDE is recommended as ITU-R M. 1842-1. CS-TDMA, a multiple access method of AIS class B, is recommended as that of the VDE. It is inefficient for CS-TDMA just applying the report interval used in AIS class B to transmit high speed data with higher payload in the aspect of efficiency. In this paper, a simulation is executed in order to determine adequate report interval according to the number of active ships that affects directly network traffic. To this end, the performance of CS-TDMA, which includes the number of received packets, reception success rate, channel utilization, and collision rate, is investigated via a simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.2
• /
• pp.99-113
• /
• 1992

In general, TDMA and FDMA have been used for multiple access communication methods. Recently. However, ALOHA and CSMA protocols came to exist as new schemes for VSAT data networks and LANs, respectively. These schemes are proven to be effective for packet switched communication systems that has bursty traffic but packet collisions. In this paper we analyze capture statistics arising from fading channels in packet radio communication systems in the context of ALOHA protocol. We derive general results of the exact form of capture probabilities and present numerical data for wide range of fading parameters. Since the capture probabilities are found to approach zero when the number of transmitted signals become larger, we are able to determine the achievable channel throughput by a least squares fitting of an exponential-type function to the probabilities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.153-161
• /
• 2005

In a multi-channel network based of wavelength division multiplexing (WDM) technology, an efficient protocol is needed in order for the transmitter and receiver to be tuned to the same wavelength during message transmission time. This paper proposes a priority-based reservation protocol that can efficiently support variable-length messages that require different QoS requirements. In this proposed protocol, high-priority nodes can reserve the data channel before low-priority nodes. However, once a node reserves a data channel successfully, it can persistently use the reserved channel till message transmission is finished regardless of the priority of the node. Moreover, the protocol can operate independently of the number of nodes, and any new node can join the network anytime without requiring network re-initialization. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.6
• /
• pp.1315-1324
• /
• 2012

Security visualization is a form of the data visualization techniques in the field of network security by using security-related events so that it is quickly and easily to understand network traffic flow and security situation. In particular, the security visualization that detects the abnormal situation of network visualizing connections between two endpoints is a novel approach to detect unknown attack patterns and to reduce monitoring overhead in packets monitoring technique. However, the session-based visualization doesn't notice a difference between normal traffic and attacks that they are composed of similar connection pattern. Therefore, in this paper, we propose an efficient session-based visualization method for analyzing and detecting between normal server activities and attacks by using the IP address splitting and port attributes analysis. The proposed method can actually be used to detect and analyze the network security with the existing security tools because there is no dependence on other security monitoring methods. And also, it is helpful for network administrator to rapidly analyze the security status of managed network.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.2
• /
• pp.101-110
• /
• 2011

Recently, an attack to an application incapacitates the intrusion detection rule, the defense policy for a network and database and induces intrusion incidents. Thus, it is necessary to study integration security to ensure the security of an internal network and database from that attack. This article is about building an integration security system to prevent an attack to an application set with intrusion detection rules. It responds to network-based attack through detection, disperses attack with the internal integration security system through virtual clustering and load balancing, and sets up defense policy for attacking destination packets, analyzes and records attack packets, and updates rules through monitoring and analysis. Moreover, this study establishes defense policy according to attacking types to settle access traffic through virtual machine partition policy and suggests an integration security system applied to prevent attack and tests its defense. The result of this study is expected to provide practical data for integration security defense for hacking attack from outside.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.153-161
• /
• 2022

This paper analyzes the economic effects when platform provider including CP contributes to broadband universal service and uses broadband bandwidth providing high quality network service. In this model, the contribution rate of broadband universal service is determined by ISP and platform provider sets its price of contents. The main results are as follows. First, the traffic usages is less than social optimum when the market of contents is monopoly. The sum of contribution fee and network usage rate must be less than marginal cost of network operation to get social optimum traffic. Second, the rate set by ISP is equal to social optimum when the market of contents is competitive. Third, when platform provider does not charge contents provided, ISP sets social optimum prices and the network usage rate for contents user is decreasing as advertisement revenue becomes larger. These results suggest that the platform provider should contribute to universal service funding to encourage the network investment of ISP.

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

Increase of internet users and new type of applied traffic such as game, news, distributed computing, online image conference, and real time audio and video have leaded to demand for more bandwidth for each application. This algorithm represents a complex optical exchanger having typical wavelength switching function and time-slotted transmission function. Performance assessment of the proposed OXC (Optical Cross connect) sttucture defines LFS (Limit Frame Size) and VFS (Variable Frame Size) for classification by packet type and calculates the channel effect and loss probability depending the demanded bandwidth by access node increase. Optical exchanger in this type of structure can guarantee future network expansion as well as decrease of frame collision resulted from node increase.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.849-856
• /
• 2004

This paper proposes a novel superframe formation algorithm for wireless systems with time-slotted superframe structure. The design objective of the proposed algorithm is to provide high performance, stability, error tolerance, as well as power-saving features. The paper presents a comprehensive performance analysis of the Proposed superframe formation algorithm with different types of traffic applied. During analysis several performance metrics are investigated. The error tolerance to beacon loss and the behavior of CBR flows are also studied. We show that the proposed algorithm inherits the advantages of the previously used algorithms, while providing additional features.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.555-562
• /
• 2002

Increasing of electronic commerce users and high-capacity multimedia data is the main causes of increasing of load and network traffic in electronic commerce system. Increasing of load and network traffic brings the delay of service about client's request. And it's becoming factor that decreases customer satisfaction and corporation's competitive ability. So it is needed to research that consider efficient management and response time of electronic commerce system. In this paper, we designed electronic commerce system based on local server with web cashing function in order to solve load problem of electronic commerce system. And we proposed web cashing algorithm for local web server and analyzed performance by an experiment.