• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.3
• /
• pp.225-231
• /
• 1992

In this paper, queuing networks with open chains are considerd to analyze the performance of packet switching networks. Networks are classified into backbone and local access networks. Networks for performance analysis are distributed to twelve regions and DNS is the backbone. Analysis was conducted using the real values from the input to existing networks and mathematical estimation values. As the result of analysis, the mean of end-to-and delay for each chain was presented. Except special regions, we found that there was a little difference between real values and mathematical estimation values. However, there could be a performance problem in total networks due to the increase of communication volumes in each region. So we proposed some solutions to this problem.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.369-371
• /
• 2012

Wireless sensor networks have taken immense interest in healthcare systems in recent years. One example of it is in an in vivo sensor that is deployed in critical and sensitive healthcare applications like artificial retina, cardiac pacemaker, drug delivery, blood pressure, internal heat calculation, glucosemonitoring etc. In vivo sensor nodes exhibit temperature that may be very dangerous for human tissues. However, existing in vivo thermal aware routing approaches suffer from hotspot creation, delay, and computational complexity. These limitations motivate us toward an in vivo virtual backbone, a small subset of nodes, connected to all other nodes and involved in routing of all nodes, -based solution. A virtual backbone is lightweight and its fault-tolerant version allows in vivo sensor nodes to disconnect hotspot paths and to use alternative paths. We have formulated the problem as m-connected k-dominating set problem with minimum temperature cost in in vivo sensor network. This is a combinatorial optimization problem and we have been motivated to use evolutionary approach to solve the problem.

• Journal of the Korean Magnetic Resonance Society
• /
• v.5 no.2
• /
• pp.130-137
• /
• 2001

Backbone dynamics of the catalytic residues in free and steroid-bound $\Delta$$^{5}$ -3- ketosteroid isomerase from Pseudomonas testosteroni has been examined by $^{15}$ N relaxation measurements. The relaxation data were analyzed using the model-free formalism to extract the model-free parameters (S$^2$, $\tau$$_{e}$, and R$_{ex}$). Tyr-34 and Asp-99 exhibit enhanced high-frequency (pico- to nanosecond) internal motions in the free enzyme, which are restricted upon ligand binding, while Asp-38 experiences severe restriction of the internal motions in the fee enzyme, suggesting that Tyr-14 and Asp-99 are more actively involved in the ligand binding than Asp-38. The results also indicate that the H-bond network in the catalytic cavity might be slightly strengthened upon ligand binding, which may have some implications on the enzyme mechanism.he enzyme mechanism.m.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.552-557
• /
• 2004

Mobile Ad Hoc Network (MANET) is a network architecture, which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, previously developed routing algorithms in wired networks cannot be used. And many new algorithms have been undergone. This study proposes the secondary leader approach to the cluster based routing protocol(CBRP). In case, the primary leader becomes abnormal status so that the primary leader cannot participate the communications between network entities, the secondary leader immediately replaces the primary header without selecting process of the new primary leader. The performances of proposed algorithm ACBRP(Advanced Cluster. Based Routing Protocol;CBRP using secondary leader) are compared with CBRP and results are presented in order to show the effectiveness of the algorithm.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.240-248
• /
• 2003

This paper analyzes mobile agent performance in network management compared to the client-server model used in the Simple Network Management Protocol (SNMP). Prototypes of an application that gathers MIB-II (Management Information Base-II) variables have been created and tested on a LAN. After acquiring implementation parameters related to network management and to the mobile agent infrastructure, simulation results have been obtained on large topologies similar in shape to the Internet. Response time results show that mobile agents perform better than SNMP when the number of managed elements ranges between two specific limits, an inferior bound and a superior one, determined by the number of messages that pass through a backbone and by the mobile agent size which grows along with MIB-II variables collected on network elements. The results also show that a significant improvement is achieved when the mobile agent returns or sends data to the management station after visiting a fixed number of nodes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.358-361
• /
• 2021

In order to improve the accuracy of small target detection more effectively, this paper proposes an improved single shot detector (SSD) target detection and recognition method based on cspdarknet53, which introduces lightweight ECA attention mechanism and Feature Pyramid Network (FPN). First, the original SSD backbone network is replaced with cspdarknet53 to enhance the learning ability of the network. Then, a lightweight ECA attention mechanism is added to the basic convolution block to optimize the network. Finally, FPN is used to gradually fuse the multi-scale feature maps used for detection in the SSD from the deep to the shallow layers of the network to improve the positioning accuracy and classification accuracy of the network. Experiments show that the proposed target detection algorithm has better detection accuracy, and it improves the detection accuracy especially for small targets.

• Journal of Information Science Theory and Practice
• /
• v.10 no.spc
• /
• pp.123-134
• /
• 2022

Existing network cryptography systems are threatened by recent developments in quantum computing. For example, the Shor algorithm, which can be run on a quantum computer, is capable of overriding public key-based network cryptography systems in a short time. Therefore, research on new cryptography systems is actively being conducted. The most powerful cryptography systems are quantum key distribution (QKD) and post quantum cryptograph (PQC) systems; in this study, a network based on both QKD and PQC is proposed, along with a quantum key management system (QKMS) and a Q-controller to efficiently operate the network. The proposed quantum cryptography communication network uses QKD as its backbone, and replaces QKD with PQC at the user end to overcome the shortcomings of QKD. This paper presents the functional requirements of QKMS and Q-Controller, which can be utilized to perform efficient network resource management.

• Journal of Korea Multimedia Society
• /
• v.10 no.8
• /
• pp.1052-1059
• /
• 2007

Network security system used in the large scale network composes individual security system which protects only own domain. Problems of individual security system are not to protect the backbone network and to be hard to cope with in real-time. In this paper we proposed a security system which includes security function at the router, and the access point, which exist at the backbone network, to solve the problems. This security system sends the alert messages to an integrated security management system after detecting intrusions. The integrated security management system releases confrontation plan to each suity system. Thus the systematic and immediate confrontation is possible. We analyzed function verification and efficiency by using the security system and the integrated security management system suggested in this paper. We confirmed this integrated security management system has a possibility of a systematic and immediate confrontation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.680-699
• /
• 2015

The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.225-234
• /
• 2009

Recently IPTV service is penetrating to the ordinary home users very swiftly. One of the first phase of IPTV service is considered to be VoD, and a nationwide availability of the VoD service imposes tremendous pressure to the network resource due to its requirements for the broad bandwidth, the inherent nature of unicast technology, and the large scalability, etc. This work suggests a novel and practical method to the design of network resource for the VoD service. Especially, we explore the distributed content storage problem that takes into account the popularity of the video contents and its corresponding link dimensioning problem that takes into account the grade of service for the flow level quality of service about the VoD service. By assuming a realistic topology for the nationwide IP backbone network of Korea, which is a typical tree topology, we suggest an analytic method for the design of VoD service.