• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.963-973
• /
• 2005

Increasing attention is being recently devoted to various problems inherent in the topological design of networks systems. The topological structure of these networks can be based on service centers, terminals (users), and connection cable. Lately, these network systems are well designed with tiber optic cable, because the requirements from users become increased. But considering the high cost of the fiber optic cable, it is more desirable that the network architecture is composed of a spanning tree. In this paper, we present a GA (Genetic Algorithm) for solving bicriteria network topology design problems of wide-band communication networks connected with fiber optic cable, considering the connection cost, average message delay, and the network reliability We also employ the $Pr\ddot{u}fer$ number (PN) and cluster string in order to represent chromosomes. Finally, we get some experiments in order to certify that the proposed GA is the more effective and efficient method in terms of the computation time as well as the Pareto optimality.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.244-253
• /
• 2000

Since no single routing-switching combination performs the best under various different types of applications, a flexible network is required to support a range of polices. This paper introduces an implementation of a look-up table routing engine offering flexible routing and switching polices without performance degradation unlike those based on microprocessors. By deciding contents of look-up tables, the engine can implement wormhole routing, virtual cut-through routing, and packet switching, as well as hybrid switching, under a variety of routing algorithms. Since the routing engine has a piplelined look-up table architecture, the routing delay is as small as one flit, and thus it can overlap multiple routing actions without performance degradation in comparison with hardwired routers dedicated to a specific policy. Because four pipeline stages do not induce a hazard, expensive forwarding logic is not required. The routing engine can accommodate four physical links with a time shared cut-through bus or single link with a cross-bar switch. It is implemented using Xilinx 4000 series FPGA.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.31-38
• /
• 2004

In mobile agent environments, migration of an agent occurs continuously due to the mobility of agents. So cascaded delegation can occur among places for delegating the privilege to execute the agent. Because the existing delegation scheme considers only the delegation between two places that participate in migration of an agent, it does not support secure cascaded delegation. In this paper, we propose a cascaded delegation scheme that provides agents with secure cascaded delegation in mobile agent environments. Depending on the trust-relationship among places, the proposed scheme achieves the goal by nesting each delegation token or by nesting only initial token signed by creator of the agent within the signed part of the next immediate delegation token. And we prove that the proposed scheme is secure against the attack of replaying a message and the attack of substituting a delegation token.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1370-1376
• /
• 2000

Consider the problem to updata breadth-First Spanning Tree in response to topology change of the network. The paper proposes an efficient distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(p√q+q+a+n') respectively, where n' is the number fo processors in the network after the topology change, a is the number of added links, p is the total number of links in the biconnected component (of the network before the topology change) including the detected links or added links, and q is the total number of processors in the biconnected component (of the network before the topology change) including the deleted links or added links, and q is the total number of processors in the biconnected component including the deleted links or added links.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.55-64
• /
• 2007

Behind the popularity of VoIP in these days, it may present significant security challenges in privacy and accounting. Authentication and message encryption are considered to be essential mechanisms in VoIP to be comparable to PSTN. SIP is responsible for setting up a secure call in VoIP. SIP employs TLS, DTLS or IPSec combined with TCP, UDP or SCTP as a security protocol in VoIP. These security mechanisms may introduce additional overheads into the SIP performance. However, this overhead has not been understood in detail by the community. In this paper we present the effect of the security protocol on the performance of SIP by comparing the call setup delays among security protocols. We implement a simulation of the various combinations of three security protocols and three transport layer protocols suggested for SIP. UDP with any combination of security protocols performs a lot better than the combination of TCP. TLS over SCTP may impose higher impact on the performance in average because TLS might have to open secure channels as the same number of streams in SCTP. The reasons for differences in the SIP performances are given.

• The KIPS Transactions:PartD
• /
• v.17D no.5
• /
• pp.317-326
• /
• 2010

Service Oriented Architecture (SOA), which supports various features such as interoperability and reusability of IT resources, comes into the spotlight as an effective approach for adapting new business environmental changes. SOA, however, has some problems including the high realization complexity and low Return on Investment (ROI). To solve these problems, Web Oriented Architecture (WOA) has gained attention. However, it also has some drawbacks about security concerns and unstable message transmissions. In this paper, we design a novel integrated architecture that classifies services into inside and outside ones and applies SOA for the former and WOA for the latter, respectively. By converging the advantages of SOA and WOA simultaneously, the proposed architecture becomes more simple and service-oriented, and can satisfy diverse requirements of customers. The usefulness evaluation of the proposed architecture is conducted through the Analytic Hierarchy Process (AHP) scheme.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.307-318
• /
• 2008

One of the primary issues confronting XML message brokers is the difficulty associated with processing a large set of continuous XPath queries over incoming XML seams. This paper proposes a novel system designed to present an effective solution to this problem. The proposed system transforms multiple XPath queries before their run-time into a new region-based data structure, called an XP-table, by sharing their common constraints. An XP-table is matched with a stream relation (SR) transformed from a target XML stream by a SAX parser. This arrangement is intended to minimize the runtime workload of continuous query processing. Also, system performance is estimated and verified through a variety of experiments, including comparisons with previous approaches such as YFilter and LazyDFA. The proposed system is practically linear- scalable and stable for evaluating a set of XPath queries in a continuous and timely fashion.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.674-679
• /
• 2017

In big-data environments wherein large amounts of text documents are produced daily, titles are very important clues that enable a prompt catching of the key ideas in documents; however, titles are absent for numerous document types such as blog articles and social-media messages. In this paper, a title-generation model for which sequence-to-sequence RNNs with attention and copying mechanisms are employed is proposed. For the proposed model, input sentences are encoded based on bi-directional GRU (gated recurrent unit) networks, and the title words are generated through a decoding of the encoded sentences with keywords that are automatically selected from the input sentences. Regarding the experiments with 93631 training-data documents and 500 test-data documents, the attention-mechanism performances are more effective (ROUGE-1: 0.1935, ROUGE-2: 0.0364, ROUGE-L: 0.1555) than those of the copying mechanism; in addition, the qualitative-evaluation radiative performance of the former is higher.

• Journal of Game and Entertainment
• /
• v.2 no.3
• /
• pp.24-29
• /
• 2006

Nowadays, 'Interaction' is discussed not only in the multimedia field but also as a topic of daily life at the various viewpoints. And as the permmited limit of Interaction by Mutimedia Technology and audiovisual function is getting more activated, It is the time for us to have new understanding of a 'POSTER'. The Poster, as a one-sided information transmission media till now, is faced with its limitation in transmitting messages due to its unconformity between satisfaction of receiver' sdesire for information and installation space. This fact speaks for need of study about Digital Poster as an alternative communication method, and activation of Digital Poster Design Field. Therefore, I would like to present Design process and Examples by using Digital Poster for Maximizing the Communication Effect. And I expect the activation of Digital Poster Field by studying the possibility of development and various method of practical use of digital posters through presenting the examples.