• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2943-2953
• /
• 1998

As communication networks become very fast, the scope of applications is varied and applications using multi-party communications in which more than one communication station participate, have been increased. In this paper, multicast servers are designed and implemented by two different schemes (centralized multicast server scheme and distributed multicast server scheme). Both scheme contain three operation for joining/leaving of a node, operation for transmitting the name of the group and messages to the server, and operation for a node to read messages and clear shared memory. Based on their implementations, two multicast server schemes are compared in terms of complexity, extendibility, efficiency and real-time aspects. As a result, the average transfer time of the distributed multicast server scheme is shorter than that of the centralized multicast server scheme. Finally, we designed the multi-party real-time communication method to guarantee QoS in multicast.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.117-126
• /
• 2006

Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. In order to overcome such disadvantages, bytecode analysis and optimization must be performed. First control flow of the bytecode should be analyzed, after which information is required regarding where the variables are defined and used to conduct data flow analysis and optimization. There may be cases where variables with an identical name contain different values at a different location during the execution according to the value assigned to a variable in each location. Therefore, in order to statically determine the value and type, the variables must be separated according to allocation. In order to do so, the variables can be expressed using a static single assignment form. After the transformation into a static single assignment form, the type information of each node expressed by each variable and expression must be configured to perform static analysis and optimization. Based on the basic type information, this paper proposes a method for finding related equivalent nodes, setting the nodes with strongly connection components and efficiently assigning each node the type.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.729-741
• /
• 1999

ATM networks are widely deployed as the network that is capable of supporting multimedia services efficiently now. To date, a large portion of ATM connections, particularly in the WAN environment, have been of a permanent virtual circuits-requiring management intervention for set-up and tear-down. However, switched virtual circuits are required to support a range of desired characteristics on demand, to a reachable end user. To establish, maintain and release on-demand call/connections, the user-network interface(UNI) and node-node interface(NNI) signalling capabilities are required. Two protocols have been specified for NNI signalling within a public network: the broadband integrated-services user part(B-ISUP) protocol specified by the ITU-T, and the private network-network interface(PNNI) protocol specified by the ATM Forum. PNNI offers different type of internetwork or internodal interface from the traditional B-ISUP approach favored to date public network operators. In spite of its name, PNNI may find its place in network service provide networks as well as in private networks. Thus many public network operators and ATM equipment manufacturers are still unable to choose the NNI interface architecture of their system. In this paper, we survey the characteristics of the B-ISUP and PNNI protocols, and investigate the applicability issue of these specifications to the ATM-based Information Infra-Network of Korea. Analyzing the characteristics of the two protocols and clarifying the NNi requirements of the ATM-based Information Infra-Network of Korea, we propose that the B-ISUP protocol is more suitable than PNNI.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.50-62
• /
• 2009

In wireless and mobile environments, data broadcasting is recognized as an effective way for data dissemination due to its benefits to bandwidth efficiency, energy-efficiency, and scalability. In this paper, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of the mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data which enable energy and latency-efficient broadcast of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains tag name, attributes, and text content of an element as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the wireless stream in a shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing over the stream in the mobile clients. Through extensive performance experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.77-84
• /
• 2024

Over the past few years, IoT edges have begun to emerge based on new low-latency communication protocols such as 5G. However, IoT edges, despite their enormous advantages, pose new complementary threats, requiring new security solutions to address them. In this paper, we propose a cloud environment-based IoT edge architecture model that complements IoT systems. The proposed model acts on machine learning to prevent security threats in advance with network traffic data extracted from IoT edge devices. In addition, the proposed model ensures load and security in the access network (edge) by allocating some of the security data at the local node. The proposed model further reduces the load on the access network (edge) and secures the vulnerable part by allocating some functions of data processing and management to the local node among IoT edge environments. The proposed model virtualizes various IoT functions as a name service, and deploys hardware functions and sufficient computational resources to local nodes as needed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.10
• /
• pp.1115-1122
• /
• 2015

Hadoop framework was designed to be suitable for processing very large files. On the other hand, when processing the Small Files, it waste the resource of a distributed system, and occur performance degradation. It is shown noticeable the more the Small Files. This problem is caused by the Small Files, it can be solved through the merging of associated Small Files. But a way of merging of Small Files has some limited point. in this paper, examines existing limit of merging method, design merging method Small Files for effective process.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.93-102
• /
• 2011

In this paper we describe an efficient and easy to use network monitoring system which can identify network configuration automatically by means of capturing and analyzing the ARP broadcasting packets. After identifying network nodes, it gathers detail information of each node such as NETBIOS name and number of hop counts using ICMP and then shows subnet configuration with graphical method. This monitoring system also has a subset of intrusion detection system that can monitor any port scanning trial. With this automatic network configuration functions, it helps to lessen address keeping track overhead which is crucial for network monitoring so that it provides efficient network management.

• Journal of Information Management
• /
• v.42 no.1
• /
• pp.47-62
• /
• 2011

While an ideal author graph should have its nodes to represent authors, automatically-generated author graphs mostly use author names as their nodes due to the difficulty of resolving author names into individuals. However, employing author names as nodes of author graphs merges namesakes, otherwise separate nodes in the author graph, into the same node, which may distort the characteristics of the author graph. This study proposes an algorithm which resolves author ambiguities based on co-authorship and then yields an author graph consisting of not author name nodes but author nodes. Scientific collaboration relationship this algorithm depends on tends to produce the clustering results which minimize the over-clustering error at the expense of the under-clustering error. In experiments, the algorithm is applied to the real citation records where Korean namesakes occur, and the results are discussed.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.554-569
• /
• 2005

In the semistructured distributed documents, it is very difficult to formalize and implement the query processing system due to the lack of structure and rule of the data. In order to precisely retrieve and process the heterogeneous semistructured documents, it is required to handle multiple mappings such as 1:1, 1:W and W:1 on an element simultaneously and to generate the schema from the distributed documents. In this paper, we have proposed an query processing algorithm for querying and answering on the heterogeneous semistructured data or documents over distributed systems and implemented with a metadata interface. The algorithm for generating local queries from the global query consists of mapping between g1oba1 and local nodes, data transformation according to the mapping types, path substitution, and resolving the heterogeneity among nodes on a global input query with metadata information. The mapping, transformation, and path substitution algorithms between the global schema and the local schemas have been implemented the metadata interface called DBXMI (for Distributed Documents XML Metadata Interface). The nodes with the same node name and different mapping or meanings is resolved by automatically extracting node identification information from the local schema automatically. The system uses Quilt as its XML query language. An experiment testing is reported over 3 different OEM model semistructured restaurant documents. The prototype system is developed under Windows system with Java and JavaCC compiler.

• Journal of Advanced Navigation Technology
• /
• v.25 no.5
• /
• pp.397-402
• /
• 2021

The real-name electric fishing gear system is one of the important policy capable to build 'abundant fishing ground' and to protect marine environment. And, fishing gear automatic-identification system is one of IoT services that can implement above-mentioned policy by using communication such as low power wide area (LPWA) and multi-sensing techniques. Fishing gear automatic -identification system can gather the location data and lost/hold data from electric buoy floated in sea and can provide them to fishermen and monitoring center in land. We have developed the communication modules and electric buoy consisted of fishing gear automatic-identification system. In this paper, we report the test results of communication distance between electric buoy and wireless node installed in fish boat and location error of electric buoy. It is confirmed that line of sight (LOS) distance between electric buoy and wireless node is obtained to be 62 km, which is two times of the desired value, and location error is obtained to be CEP 1 m, which is smaller than the desired value of CEP 5 m. Therefore, it is expected that service area and accuracy of the developed fishing gear automatic-identification system is more extended.