• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3753-3771
• /
• 2016

Increasingly, numerous and various Internet-capable devices are connected in end user networks, such as a home network. Most devices use the combination of TCP and 802.11 DCF as a system platform, but whereas some devices such as a streaming video persistently generate traffic, others such as a motion sensor do so only intermittently with lots of pauses. This study addresses the issue of performance in this heterogeneous traffic wireless LAN environment from the perspective of fairness. First, instantaneous fairness is introduced as a notion to indicate how immediately and how closely a user obtains its fair share, and a new time-based metric is defined as an index. Second, extensive simulation experiments have been made with TCP Reno, Vegas, and Westwood to determine how each TCP congestion control corresponds to the instantaneous fairness. Overall, TCP Vegas yields the best instantaneous fairness because it keeps the queue length shorter than the other TCPs. In the simulations, about 60% of a fair share of the effective user bandwidth is immediately usable in any circumstance. Finally, we introduce two simple strategies for adjusting TCP congestion controls to enhance instantaneous fairness and validate them through simulation experiments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.129-137
• /
• 2003

As the Internet is quickly evolving from best-effort networks to a very critical communications infrastructure that requires higher quality Internet services and the delivery of such communications services become competitive, large-scale NSPs or ISPs have to concern much more on the performance and efficient resource usages of their networks. This situation naturally leads the providers to seek a possible solution from traffic engineering (TE) methodologies. In this paper, we propose a TE server solution for a large-scale MPLS-based IP autonomous system, which addresses these TE requirements such as the measurement, characterization, modeling and control of Internet traffic.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.1
• /
• pp.82-90
• /
• 2007

We introduce the concept of a remote distributed embedded system to integrated fieldbus based control systems in internet/Intranet. As a result, fieldbus systems are opened up for remote monitoring, remote maintenance, and remote control applications using state of the art Web-technology. This paper addresses the design of a remote distributed embedded system using Internet and CAN for multi-induction motor of Building and Industrial field. The fieldbus used the CAN based networked intelligent multi-motor control system using DSP2812 microprocessor. To build a remote distributed embedded system, the TCP/IP-CAN Gateway which converts a CAN protocol to TCP/IP protocol and vice verse, was designed. A experimental simulation system consists of a TCP/IP-CAN gateway in remote place and a command PC to be connected to Ethernet.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.365-368
• /
• 2008

This paper presents a new concept of IP-based wireless sensor networks and also introduces a routing protocol that is based on clustering for global healthcare information system. Low-power wireless personal area networks (LoWPANs) conform the standard by IEEE 802.15.4-2003 to IPv6 that makes 6lowpan. It characterized by low bit rate, low power, and low cost as well as protocol for wireless connections. The 6lowpan node with biomedical sensor devices fixed on the patient body area network that should be connected to the gateway in personal area network. Each 6lowpan nodes have IP-addresses that would be directly connected to the internet. With the help of IP-address service provider can recognize or analysis patient biomedical data from anywhere on globe by internet service provider equipments such as cell phone, PDA, note book. The system has been evaluated by technical verification, clinical test, user survey and current status of patient. We used NS-2.33 simulator for our prototype and also simulate the routing protocols. The result shows the performance of biomedical data packets in multi-hope routing as well as represents the topology of the networks.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.402-406
• /
• 2007

Rich Internet Application(RIA) is one of the Web 2.0 technologies and is expected to be a next generation user interface technique which allows flexible and dynamic manipulation for Web searches. This paper addresses a personalization mechanism for advanced Web search using RIA for abundant user interactions. We devised a dynamic and graphical user interface instead of previous text-based searches and a client side application for storing personal preference information. In this research, we implemented the graphical personalized search manager using Yahoo web search API and widget, and demonstrated its effectiveness by performing some experiments with various query terms and representative predicates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1442-1462
• /
• 2014

Packet classification is a key technology of the Internet for routers to classify the arriving packets into different flows according to the predefined rulesets. Previous packet classification algorithms have mainly focused on search speed and memory usage, while overlooking update performance. In this paper, we propose PreCuts, which can drastically improve the update speed. According to the characteristics of IP field, we implement three heuristics to build a 3-layer decision tree. In the first layer, we group the rules with the same highest byte of source and destination IP addresses. For the second layer, we cluster the rules which share the same IP prefix length. Finally, we use the heuristic of information entropy-based bit partition to choose some specific bits of IP prefix to split the ruleset into subsets. The heuristics of PreCuts will not introduce rule duplication and incremental update will not reduce the time and space performance. Using ClassBench, it is shown that compared with BRPS and EffiCuts, the proposed algorithm not only improves the time and space performance, but also greatly increases the update speed.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.394-401
• /
• 2007

High speed all optical network is a viable option to satisfy the exponential growth of internet usage in the recent years. Optical networks offer very high bit rates and, by employing technologies like internet protocol over wavelength division multiplexing(IP-over-WDM), these high bit rates can be effectively utilized. However, failure of a network component, carrying such high speed data traffic can result in enormous loss of data in a few seconds and persistence of a failure can severely degrade the performance of the entire network. Designing IP-over-WDM networks, which can withstand failures, has been subject of considerable interest in the research community recently. Most of the research is focused on the failure of optical links in the network. This paper addresses the problem of designing IP-over-WDM networks that do not suffer service degradation in case of a single link failure. The paper proposes an approach based on the framework provided by a recent paper by M. Kurant and P. Thiran. The proposed approach can be used to design large survivable IP-over-WDM networks.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.361-368
• /
• 2005

Internet mail has become a common communication method around the world because of tremendous Internet service usage increment. In other respect, Most Internet users' mail addresses are exposed to spammer, and the damage of Junk mail is growing bigger and bigger. These days, Junk mail delivery problem is becoming more serious, because this is used for an attack or propagation scheme of malicious code. It's a most dangerous dominant cause for computer system accident. This paper shows the Junk mail filtering model and implementation which is based on FQDN (Fully Qualified Domain Name) check and evaluates it for proposing advanced scheme against Junk mail.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3613-3622
• /
• 2000

This paper presents IPv6 evolution strategies toward Next Generation Internet. We define requirements for IPv6 transition, then propose the IPv6 evolution strategies by considering IPv4/1Pv6 interworking, IPv6 development items with superiority compared to foreign technologies, IPv6 network evolution strategy for operation and management in stages by new Internet site or ISPs. the policy for structure and allocation of production IPv6 addresses, and reinforcement methods of the international activities on IPv6 related areas.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2764-2782
• /
• 2021

Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.