• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.719-724
• /
• 2004

Recently, since the number of internet users is increasing rapidly and, by using the public hacking tools, general network users can intrude computer systems easily, the hacking problem is getting more serious. In order to prevent the intrusion, it is needed to detect the sign in advance of intrusion in a positive prevention by detecting the various foms of hackers' intrusion trials to know the vulnerability of systems. The existing network-based anomaly detection algorithms that cope with port- scanning and the network vulnerability scans have some weakness in intrusion detection. they can not detect slow scans and coordinated scans. therefore, the new concept of algorithm is needed to detect effectively the various forms of abnormal accesses for intrusion regardless of the intrusion methods. In this paper, SPAD(Session Pattern Anomaly Detector) is presented, which detects the abnormal service patterns by comparing them with the ordinary normal service patterns.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.815-820
• /
• 2004

For providing high quality-guaranteed service over Internet, traffic engineering based on an MPLS technology is being introduced. MPLS traffic engineering performs the computation on the path guaranteeing service`s quality and the reservation on network resources by an MPLS signaling protocol. As one of MPLS signaling protocol, RSVP-TE protocol transmits and receives periodic refresh messages for maintaining the path of a traffic flow. Such characteristic gives a heavy processing overhead to routers for maintaining states of large number of paths. In this paper, we propose a scalable implementation approach for RSVP-TE without dramatically increasing processing overhead. And we eval-uate the processing overhead on periodic messages by implementing the RSVP-TE protocol and the reduction mechanism of periodic messages.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.327-336
• /
• 2003

Recently the rapid growth of Internet and the construction of high speed networks make many kinds of multimedia services possible. But most of current multimedia services are designed being by client/server model, which incurs high load of central server. In order to solve this problem, we propose a peer-to-peer network-based discovery mechanism for multimedia services. In the proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Use of mobile agents can solve the loss problem of the search result that occurs when the network is unsettled in pure peer-to-peer network. It also supports interoperability in heterogeneous system environments. In the proposed scheme, each host maintains the location information of resources which are locally requested or recently requested by other hosts. So, the proposed scheme has faster response time than the pre-existing mechanisms in pure peer-to-peer network environments.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.413-420
• /
• 2002

With the rapid development of computer networks, how to speed up network services and to guarantee QoS (Quality-of-Service) for users has drawn much attention from computer scientists. So has the need to manage network application services in order to manage network resources more effectively and meet the users' demands. In this paper, we present methodology of determining the traffic of application services on the network, so as to manage network resources effectively and thus to make application services more user-oriented. On the basis of this methodology and by using RMON MIB we develop analysis parameters and their algorithm to manage the traffic of application services on the network, thus realizing Web-based Application Management System which allows network managers to extract and analyze the Internet application service traffic beyond the limitation of time and space.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.341-350
• /
• 2002

As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM's Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.317-326
• /
• 2002

The mobile telecommunication system has been growing exponentially after 1990s due to the high population in a city and the growth of mobile user. In this time, the current mobile system mainly concentrates on the voice communication. However, in the next generation, mobile users want to get very diverse services via mobile terminal such as the Internet access, web access, multimedia communication, and etc. For this reason, the next generation system, such as the UMTS system, has to support the packet data service and it will play the major role in the system. In different from the voice service, the packet data service should store packet data in a buffer at base station before it forwards. Consequently, the performance closely related to the buffer management and its operation. However, until now, there are rare study on the buffer behavior and management. In this paper, we will observe the buffer behavior in the UMTS systems by using simulation and analyze the results. For this research, we generate packet data traffics and model the UMTS system for a simulation. Then we analyze the buffer state by a simulation and calculate the buffer overflow probability by mathematical methods.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.683-688
• /
• 2004

NAT is a very useful IP address translation technique that allows two connected networks using different and incompatible IP address schemes. But it is impractical to use NAT for an application which uses the encrypted IP packet, embedding IP addresses inside of data payloads, to guarantee End-to-End Security such as IPSec. In addition to rewriting the source/destination IP addresses in the packet, NAT must modify IP checksum every time, which could lead to considerable performance decrease of the overall system in the process of the address translation. RSIP is an alternative to solve these disadvantages of NAT and the address shortage problems. Both NAT and RSIP divide networks into inside and outside addressing realms. NAT translates addresses between internal network and external network, but RSIP uses a borrowed external address for outside communications. RSIP server assigns a routable public address to a RSIP client temporarily to communicate with public net-work outside of the private network. In this paper, RSIP gateway for intranet environment is designed and its performance is evaluated. From the results of performance evaluation, we knew that RSIP is operated less sensitive to the data traffic. Also, the experiment shows that RSIP performs better than NAT when the transmission data grows larger.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.329-336
• /
• 2002

With the fast development of Internet environment, e-Commerce is rapidly increasing. n the expanding e-Commerce environment, the need for a new e-Commerce systems what will deliver products to the customer rapidly and increase sales is growing bigger. Recently, these requirements brought many researches on recommender systems. However, until now, those recommender systems have a limit because it takes too much time for recommender systems to give customers the recommendations in real time, if the number of purchase data of customers is large. So this paper concerns on the recommender systems using collaborative filtering as one of the solutions to increase the competitive power. We proposed and experimented the more improved recommender systems which could decrease the data size to shorten the recommending time by using the representative category of the product which customers want to buy. Also, we design and implement a recommender system using Enterprise JavaBeans.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.441-446
• /
• 2001

On global interconnectivity, the activation of real-time and worldwide contents will permeate and impact all aspects of day-to-day life well throughout this century. In managing contents and models, we too will see the impact of this rapidly changing environment. The real time availability of contents pertaining to a companys supply chain through means of the Internet and mobile networks(e.g., the IMT-2000) will necessitate a change in decision-making processes for effective management of contents and models. To increase the availability of many contents and models, a management system should have adaptive function in proving adequate content and model for companies. In the respect of management of contents and models, this paper discusses a production mechanism of meta-knowledge for effectively managing contents and models. Through two experimental analyses with the production mechanism, it is proven that the system enabling adaptive contents and models provision goes beyond existing ones in view of efficiency of management of contents and models in the wire and wireless networks.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.359-366
• /
• 2002

Nowadays, the hacking techniques are developed increasingly with wide use of internet. The recent type of scanning attack is appeared in against with multiple target systems on the large scaled domain rather than single network of an organization. The development of scan detection management system which can detect and analyze scan activities is necessary to prevent effectively those attacking at the central system. The scan detection management system is useful for effective utilization of various detection information that received from scan detection agents. Real time scan detection management system that can do the integrated analysis of high lever more that having suitable construction in environment of large scale network is developed.