• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.97-104
• /
• 2005

One of the problems of the currently used IPv4 addressing-structure is the fact that there is a shortage of IP addresses and many addresses are being wasted, especially on sub-netting design. The variable subnet masking is a resolution to reduce IP address wasting. We propose an effective subnet W address calculation and management method on VLSM. Also, with the proposed subnet IP address management method, a web based subnet allocation and management system is introduced.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.173-174
• /
• 2008

In this paper, we study IEEE 802.16 network for IP subnet aspects and propose optimized subnet model in accordance with IEEE 802.16 network in the point of mobility.

• Journal of the Korean Society for Railway
• /
• v.9 no.3 s.34
• /
• pp.313-318
• /
• 2006

In this paper, we propose an efficient Care of Address (CoA) configuration scheme for network mobility support in the railroad environment. Mobile routers in a train visit each access router in the fixed order. Such regular movement characteristic of a train enables a current subnet access router to inform the next subnet access router of the mobile routers' interface identifiers before the mobile routers move to the next subnet access router. So, the next subnet access router can make care of addresses for the mobile routers in advance. The numerical results show that the proposed scheme outperforms the stateless scheme with respect to CoA configuration time.

• Journal of Computing Science and Engineering
• /
• v.11 no.2
• /
• pp.49-57
• /
• 2017

This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

• Journal of Information Processing Systems
• /
• v.2 no.3 s.4
• /
• pp.183-188
• /
• 2006

A RMON agent system, which locates on a subnet, collects the network traffic information for management by retrieving and analyzing all of the packets on the subnet. The RMON agent system can miss some packets due to the high packet analyzing overhead when the number of packets on the subnet is huge. In this paper, we have developed a light-weight RMON agent system that can handle a large amount of packets without packet loss. Our RMON agent system has also been designed such that its functionality can be added dynamically when needed. To demonstrate the dynamic reconfiguration capability of our RMON agent system, a simple port scanning attack detection module is added to the RMON agent system. We have also evaluated the performance of our RMON agent system on a large network that has a huge traffic. The test result has shown our RMON agent system can analyze the network packets without packet loss.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.334-336
• /
• 2004

If Network에서 mobility의 보장은 효과적인 network 동작을 위해 중요하다. Mobile IP와 SIP를 사용할 경우 MH가 위치변경 시 마다 MH로부터 먼 곳에 위치할 가능성이 있는 MH의 Home network내 Home Agent나 Redirect Server에 registration을 수행해야 하는데 이 경우 이전 subnet에서 새로운 subnet으로의 registration이 완료되기 전까지는 correspondent node에 대한 연결성을 잃어 버리게 되어 이로 인해 발생되는 Packet 손실과 delay 생기게 된다. 이런 Registration Problem을 효과적으로 해결하기 위해 Presence System을 이용한 효율적인 network architecture를 제안한다.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.88-99
• /
• 2007

P2P systems are distributed data sharing systems, and each node in them plays the role of client as well as server. There are several studies using Distributed Hash Table, such as Chord, CAN, Tapestry, Pastry, but these systems don't consider the physical latency, therefore they have a weakness of difficulty to guarantee stable performance. To improve this problem, we present the TP2P system. This system is a self-organizing hierarchical overlay system and it uses Chord routing mechanism for lookup data. This system is organized by several subnets, each subnet is organized by physically close nodes, and global network organized by all nodes. In each subnet, one node finds a data, it saves in a node in the subnet, therefore it has higher probability to reduce physical lookup latency than Chord system. And each node has global information of some nodes in its subnet, and it is used to lookup data, therefore the number of hops decrease about 25% as well as the physical lookup latecy are reduced.

• Journal of Digital Convergence
• /
• v.13 no.9
• /
• pp.201-208
• /
• 2015

With services such as SNS and facebook, Big Data popularize the use of small size such as micro blogs are increasing. However, the problem of accuracy and computational cost of the search result of big data of a small size is unresolved. In this paper, we propose a subnet selection techniques based probability to improve the browsing speed of the small size of the text information from big data environments, such as micro-blogs. The proposed method is to configure the subnets to give to the attribute information of the data increased the probability data search speed. In addition, the proposed method improves the accessibility of the data by processing a pair of the connection information between the probability of the data constituting the subnet to easily access the distributed data. Experimental results showed the proposed method is 6.8% higher detection rates than CELF algorithm, the average processing time was reduced by 8.2%.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.31-36
• /
• 2007

This paper proposes Co-MAC (Coexistence MAC), an energy efficient medium access control protocol designed for large-scale sensor networks. In Co-MAC protocol, an overall network is divided into independent subnets, and each subnet orthogonally operates on time line in a temporal fashion. The basic idea of Co-MAC is to evenly distribute sensor nodes in a certain geographic area based on subnets to minimize overhearing which means the reception of unnecessary data packets from neighboring nodes. In our simulation, it was observed that energy efficiency of Co-MAC outperforms conventional MAC protocols under the given conditions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.535-538
• /
• 2002

InfiniBand is a switched-fabric architecture for next generation I/O systems and data centers. The InfiniBand Architecture (IBA) promises to replace bus-based architectures, such as PCI, with a switched-based fabric whose benefits include higher performance, higher RAS (reliability, availability, scalability), and the ability to create modular networks of servers and shared I/O devices. The switched-fabric InfiniBand consists of InfiniBand subnets with channel adapters, switches, and routers. In order to fully grasp the operational characteristics of InfiniBand architecture (IBA) and use them in ongoing design specification, simulation of subnet management of IBA is inevitable. In this paper, thus, we implement an IBA simulator and test some practical sample networks using it. The simulator shows the flow of operation by which the correctness and effectiveness of the system can be verified.