• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.6
• /
• pp.103-113
• /
• 1985

This is the first part of the four-part paper describing the development of a packet-switched computer network named the KORNET In this paper, we present the overview of the KORNET, and discuss various aspects on the development of the netwo management center (NMC). The NMC acts as a nerve center of the network, performing such functions as network monitoring, subscriber and network management and routing manage-ment using operator dialogues. In the implementation of the NMC, we have developed various application softwares that include operator interface, primary/srcondary pan, session layer and packet level adaptor. As for packet, link and physical level protocols, we have modified the XODIAC X.25 originally developed by Data General, Inc. All the net-work protocols we have developed comply completely with the CCITT recommendations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4661-4676
• /
• 2014

In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intra-authentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.271-280
• /
• 2002

A system to assist call routing task for telephone operators at the Directorate General of Telecommunications (DGT) in Taiwan is reported in this paper. The system was developed based on DGT organization profile with description of its six divisions instead of a corpus of recorded and transcribed call-routing dialogs. An acoustic module and an information retrieval module were built specifically for this task. The construction of IR module was based on term extraction and thesaurus discovery processes. By integrating acoustic and IR module, the system achieves satisfactory performance and provides a promising approach to call routing. Simulation results indicated that the proposed algorithm outperforms standard classification methods. A working system based on the proposed approach has been implemented and experimental results are presented.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.4
• /
• pp.84-89
• /
• 1984

In the design of digital system, designers use multi-layer LSI to connect all signal sets between circuit modules. This paper suggests how to minimize upper street congestions and lower congestions in the single-row routing, a routing method of multi-layer LSI. This paper suggests the heuristic algorithm which minimize upper street congestions and lower street congestions by suggesting interval graph and relational operator and finding out of the order of signal sets The algorithm was implemented on a VAX-11/780 computer and illustrated by means of examples.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.138-141
• /
• 1997

In this study, a simulation model is developed to analyze the effects of routing and scale-economy of transmission facilities on the traffic network topology and investment cost changes in a metropolitan telephone network. Computational experiments showed that the wide deployment of bifurcated routing in a dual-homing configuration reduces significantly the traffic network connectivity and the investment cost. Its enhanced version, when combined with the subscriber network cost model, can be used as a prototype cost proxy model for figuring out the access charges in a multi-operator environment.

• Journal of the Korea Safety Management & Science
• /
• v.10 no.3
• /
• pp.217-225
• /
• 2008

The inventory routing problem (IRP) is an important area of Supply Chain Management. The objective function of IRP is the sum of transportation cost and inventory cost. We propose an Artificial Immune System(AIS) to solve the IRP. AIS is one of natural computing algorithm. An hyper mutation and an vaccine operator are introduced in our research. Computation results show that the hyper mutation is useful to improve the solution quality and the vaccine is useful to reduce the calculation time.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.490-499
• /
• 1999

Vehicle routing problem(VRP) is known to be NP-hard problem, and good heuristic algorithm needs to be developed. To develop a heuristic algorithm for the VRP, this study suggests a parallel genetic algorithm(PGA), which determines each vehicle route in order to minimize the transportation costs. The PGA developed in this study uses two dimensional array chromosomes, which rows represent each vehicle route. The PGA uses new genetic operators. New mutation operator is composed of internal and external operators. internal mutation swaps customer locations within a vehicle routing, and external mutation swaps customer locations between vehicles. Ten problems were solved using this algorithm and showed good results in a relatively short time.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.327-341
• /
• 2006

As we are getting to deal with more applications that generate streaming data such as sensor network, monitoring, and SDI (selective dissemination of information), active research is being conducted to support efficient processing of queries over streaming data. The applications on the Web environment like SDI, among others, require query processing over streaming XML data, and its investigation is very important because XML has been established as the standard for data exchange on the Web. One of the major problems with the previous systems that support query processing over streaming XML data is that they cannot deal adaptively with dynamically changing stream because they rely on static query plans. On the other hand, the stream query processing systems based on relational data model have achieved adaptiveness in query processing due to query operator routing. In this paper, we propose a system of adaptive query processing over streaming XML data in which the model of adaptive query processing over streaming relational data is applied. We compare our system with YFiiter, one of the representative systems that provide XML stream query processing capability, to show efficiency of our system.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.1-16
• /
• 2008

Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.707-721
• /
• 2005

Recently, there has been a dramatic increase in data traffic, driven primarily by the explosive growth of the Internet. Optical networking is believed as a key solution to keep up with the growth, thus, the most pressing issue is how to manage and control large optical networks. Currently, provisioning end-to-end connections across the transport network has involved the network operator, leading to long provisioning times in an era when customers are demanding shorter provisioning time. To address this critical issue, new control intelligence is being studied for use within optical networks to shorten provisioning time. Both the IETF and the ITU-T have been aggressively defining many aspects of a control plane for the next generation convergence transport network. Basically, they are based on the distributed control scheme. In this Paper, we suey the applicability of the centralized control scheme for the provisioning control of optical transport network to utilize its inherent advantages over the distributed control scheme. We discuss new central control architecture, and control procedure. Also, we examine the applicability of the existing IETF routing and signaling protocols to the new control concepts, and then, we propose the additional routing and signaling information elements.