• ETRI Journal
• /
• 제22권1호
• /
• pp.30-37
• /
• 2000

Existing tree construction mechanisms are classified into source-based trees and center-based trees. The source-based trees produce a source-rooted tree with a low delay. However, for the applications with multiple senders, the management overheads for routing tables and resource reservations are too high. The center-based trees are easy to implement and manage, but a priori configuration of candidate center nodes is required, and the optimization mature such as tree cost and delay is not considered. In this paper, we propose a new multicast tree building algorithm. The proposal algorithm basically builds a non-center based shared tree. In particular, any center node is not pre-configured. In the purposed algorithm, a multicast node among current tree nodes is suitably assigned to each incoming user: Such a node is selected in a fashion that tree cost and the maximum end-to-end delay on the tree are jointly minimized. The existing and proposed algorithms are compared by experiments. In the simulation results, it is shown that the proposed algorithm approximately provides the cost saving of 30% and the delay saving of 10%, compared to the existing approaches. In conclusion, we see that the cost and delay aspects for multicast trees can be improved at the cost of additional computations.

• Journal of Korea Multimedia Society
• /
• 제7권1호
• /
• pp.64-72
• /
• 2004

Mobility changes the computing environment of computer users rapidly with the broad use of the Internet. In order to support mobility in the Internet infrastructure, IETF standardized Mobile IP With the use of Mobile IP, the Internet users can use the Internet freely without any change in the IP address configuration when they move from their home networks to foreign networks. In this paper, we implement a test bed for evaluation the performance of Mobile IP to use it in the campus network. By evaluating the effect of the use of Mobile IP on the network performance, we expect that the possible side effect of its direct use in the campus network will be reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

• Journal of Internet Computing and Services
• /
• 제9권4호
• /
• pp.29-41
• /
• 2008

Currently, IETF MANEMO(Mobile Adhoc for NEMO) working group is working on standardization supporting internal routing in nested NEMO networks. Nested NEMO has a independent topology feature that Mobile IP and basic NEMO protocol did not caused. This is the reason that causes exceptional mobility pattern. Such mobility patterns also trigger each other reconfiguration requirements. This paper classified and analyzed probable new mobility patterns in nested NEMO network. In concludion, we derived configuration problem from the new mobility patterns and suggested differential reconfiguration requirements through analytical approach.

• Journal of KIISE:Computing Practices and Letters
• /
• 제6권6호
• /
• pp.643-656
• /
• 2000

MPOA proposed and standardized by the ATM Forum is a protocol tllat provides effective bridging and routing for ATM networks in a diverse network environment. Its plimary goal is to transfer unicast data effectively among the subnets. In this paper, MPOA components are implemented using the SDL(Specification and Description Language) which the ITU has standardized for the development of communication systems. In addition, MPOA procedures for various operations such as address translation for packets from upper layers, Ingress/Egress cache management and shortcut configuration, are examined with tlle help of the SDT(SDL Design Too]) simulator.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.1030-1034
• /
• 2009

IPv6 and Ubiquitous Healthcare Environment (UHE) has become a main stream of the next generation technologies. IPv6 is designed in many ways with enhanced features such as a routing, mobility, scalability, QOS and security as a replacement of IPv4. Also, UHE is developed to provide patients with convenience and efficient healthcare services using the remote home healthcare system. However, IPv4 currently used as an Internet protocol does not have enough capability to fully support UHE. It may result in a restricted implementation of UHE. As a result, research on IPv6 implementations in UHE is increasingly becoming an issue within the healthcare industry. IPv6 has enhanced features to implement the remote healthcare system such as Neighbour Discovery process and address auto-configuration. In this paper, a basic of IPv6 and UHE will be firstly introduced and secondly, benefits brought by IPv6 in UHE will be discussed. In addition, security issues in IPv6 will be analysed to conclude this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권6호
• /
• pp.1657-1673
• /
• 2023

With the advancement of information technology, criminals employ multiple cyberspaces to promote cybercrime. To combat cybercrime and cyber dangers, banks and financial institutions use artificial intelligence (AI). AI technologies assist the banking sector to develop and grow in many ways. Transparency and explanation of AI's ability are required to preserve trust. Deep learning protects client behavior and interest data. Deep learning techniques may anticipate cyber-attack behavior, allowing for secure banking transactions. This proposed approach is based on a user-centric design that safeguards people's private data over banking. Here, initially, the attack data can be generated over banking transactions. Routing is done for the configuration of the nodes. Then, the obtained data can be preprocessed for removing the errors. Followed by hierarchical network feature extraction can be used to identify the abnormal features related to the attack. Finally, the user data can be protected and the malicious attack in the transmission route can be identified by using the Wrapper stepwise ResNet classifier. The proposed work outperforms other techniques in terms of attack detection and accuracy, and the findings are depicted in the graphical format by employing the Python tool.

• Journal of IKEEE
• /
• 제2권1호
• /
• pp.122-133
• /
• 1998

The CL network fer CBDS(Connectionless Broadband Data Service) defined by ITU-(International Telecommunication Union-Telecommunication) consists of CL(ConnectionLess) servers which route frames and links which connect between CL user and CL server or between CL servers[1][2]. In this configuration, two kinds of congestion, CL link congestion and CL server congestion may occur. Therefore this paper has proposed the scheme that can deal with the above congestion state of LAN traffic efficiently in interworking LANs in ATM network. Proposed schemes ale link-by-link scheme and hybrid scheme. Link-by-link scheme uses the ABR feedback loops of AIM layer between CL user and CL server or between CL servers, and the header translation table carrying out the routing function of frame. And hybrid scheme is the scheme that adds end-to-end loop to link-by-link scheme and then uses RM message using CLNAP-PDU(ConnectionLess Network Access Protocol - Protocol Data Units) of CL layer. These schemes can be implemented easily because of using the ABR loop of ATM layer, end-to-end loop of CL layer, and the routing function of CL server. In this paper the characteristic and effects of two schemes in CL server bas been compared and analyzed.

• Convergence Security Journal
• /
• 제12권1호
• /
• pp.35-42
• /
• 2012

Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제40권12호
• /
• pp.2392-2400
• /
• 2015

Zigbee, which was a representative standard technology for dealing low energy and mesh networks in large deployment area such as smart home, smart building, and massive sensor networks, has been developed and deployed for increasing communication area by using Ad hoc method. It has been originally developed based on IEEE 802.15.4 standard so every node needs 48bit unique address defined by IEEE. However, it is absolutely inefficient to assign an unique address to every communication node where it would be deployed through large-scale network area, e.g., smart lighting and massive sensor networks, because there could be variously multiple companies to deploy network infrastructure and they could have different policy to assign node ID. To prevent the problem, this paper proposes a method of dynamic PANID assignment in overall Personal Coordinators, and also proposes a method for addressing PANID conflict problem which could be derived from dynamic PANID assignment.