• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.84-98
• /
• 2009

Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.37-46
• /
• 2009

The movement of the MR loaded on the train is confined to the bidirectional movement along the rail. Therefore, the AR connected to the MR can use the address information of the neighboring ARs and configure CoA in advance before performing L2 and L3 handoff. The MR can acquire new CoA immediately from the present AR after the movement detection procedure. The performance analysis shows that the proposed scheme can provide CoA to the MR about 1.8(s) at minimum and 4.98(s) at maximum faster than the Stateless scheme because the proposed scheme does not carry out any additional CoA and DAD procedure unlike the Stateless scheme.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.2
• /
• pp.11-22
• /
• 2015

The almost of Web page has been gathered the personal information(Korean resident registration number, name, cell-phone number, home telephone number, E-mail address, home address, etc.) using the membership and log-in. The all most user of Web page are concerned for gathering of the personal information. I-pin is the alternative means of resident registration number and has been used during the last ten-year period in the internet. The accident of I-pin mass illegal issue was happened by hacker at February, 2015. In this paper, we analysis the problems of I-pin system about I-pin mass illegal issue accident and propose a improvement method of it. First, I-pin issue must be processed by the off-line of face certification in spite of user's inconvenience. Second, I-pin use must be made up through second certification of password or OTP. The third, the notification of I-pin use must be sent to the user by the text messaging service of cell-phone or the E-mail. The forth, I-pin must be used an alternative means of Korean resident registration number in Internet. The methods can reduce the problems of I-pin system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.523-541
• /
• 2011

In current IEEE 802.11 wireless LAN, every unicast transmission requires an ACK from the receiver for reliability, though it consumes energy and bandwidth. There have been studies to remove or reduce ACK overhead, especially for energy efficiency. However none of them are practically used now. This paper introduces a noble method of selective unacknowledged transmission, where skipping an ACK is dynamically decided frame by frame. Utilizing the fact that a multicast frame is transmitted without accompanying an ACK in 802.11, the basic unacknowledged transmission is achieved simply by transforming the destination address of a frame to a multicast address. Since removing ACK is inherently more efficient but less strict, its practical profit is dependent on traffic characteristics of a frame as well as network error conditions. To figure out the selective conditions, energy and performance implications of unacknowledged transmission have been explored. Extensive experiments show that energy consumption is almost always reduced, but performance may be dropped especially when TCP exchanges long data with a long distance node through a poor wireless link. An experiment with a well-known traffic model shows that selective unacknowledged transmission gives energy saving with comparable performance.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.81-91
• /
• 2007

Binding update for the routing optimization in MIPv6 can make the involved nodes vulnerable to various attacks. Therefore, secure binding update becomes an important research issue in MIPv6, and several protocols have been proposed for this purpose. In this paper, we compare several existing binding update protocols such as RR, SUCV and OMIPv6 and analyze the vulnerability of nodes to the possible attacks and drawbacks of address management and scalability and overhead of encryption operations. Then, we suggest the design requirements for the secure binding update and propose an advanced protocol based on the design principle. Through the analysis, we show that our protocol can achieve a higher level of security against the various attacks and enable better management of address, provide the location privacy and reduce the computational overhead of mobile nodes with constraint computational power.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.555-559
• /
• 2002

Internet users can input URL in Address window of browser or click address of site that is registered to Bookmark and sail the world of internet. But, need input of ID and password and mouse click action of 4-5 times to reach on target page that users want. This environment is very annoying work to users who approach specification page repeatedly every day. So, Homepage (first screen) of URL that want is not, Web Page Access Manager's development that can approach to target page that want by mouse click of short once. That may make web users can approach fast on target page, and minimise effort by web sailing.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2084-2093
• /
• 2016

It is crucial to predict water temperature for aquatic ecosystem studies and management. In this paper, we first address challenging issues in predicting water temperature in a real time manner and propose a distributed computing model to address such issues. Then, we present an Artificial Neural Network (ANN)-based water temperature prediction model developed for the Soyang River and a cyberinfrastructure system called WT-Agabus to run such prediction models in an automated and real time manner. The ANN model is designed to use only weather forecast data (air temperature and rainfall) that can be obtained by invoking the weather forecasting system at Korea Meteorological Administration (KMA) and therefore can facilitate the automated and real time water temperature prediction. This paper also demonstrates how easily and efficiently the real time prediction can be implemented with the WT-Agabus prototype system.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.49-55
• /
• 2004

This paper studies supplementing the points at issue bye-mail system for displaying real name of the addressee about the e-mail transmission failure that could be occurred by misspelled or mistyped e-mail address using e-mail system. E-mail system for displaying real name of the addressee is the system that increase the transmission probability by displaying searched for real name of the addressee on database. This is the study with intent to minimizes the economy loss of transmission success probability, outflow of data, and the server's over-tasking from the inaccuracy transmission of e-mail system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4555-4571
• /
• 2019

Due to increasing interest in distributed agile software development, there is a need to systematically review the literature on challenges encountered in the agile software development environment. Using the Systematic Literature Review (SLR) approach, 32 relevant publications, dated between 2013 and 2018 were selected from four electronic databases. Data from these publications were extracted to identify the key challenges across the system development life cycle (SDLC) phases, which essentially are short phases in each agile-based iteration. 5 types of key challenges were identified as impacting the SDLC phases; these challenges are Communication, Coordination, Cooperation, Collaboration and Control. In the context of the SLDC phases, the Communication challenge was discussed the most often (79 times, 33%). The least discussed challenges were Cooperation and Collaboration (26 times, 11% each). The 5 challenges occur because of distances which occur in distributed environment. This SLR identified 4 types of distances which contribute to the occurrence of these key challenges - physical, temporal, social-cultural and knowledge/experience. Of the 32 publications, only 4 included research which proposed new solutions to address challenges in agile distributed software development. The authors of this article believe that the findings in this SLR are a resource for future research work to deepen the understanding of and to develop additional solutions to address the challenges in distributed agile software development.