• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.517-526
• /
• 2001

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). While active queue management in routers and gateways can potentially reduce total packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In this paper, in order to solve this problem, a new active queue management algorithm called MRED(Modified Random Early Detection) is proposed. MRED computes the packet drop probability based on our heuristic method rather than the simple method used in RED. Using simulation, MRED is shown to perform better than existing queue management schemes. To analyze the performance, we also measure throughput of traffics under the FIFO control, and compared the performance with that of this MRED system.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.307-310
• /
• 2004

As computers and networks become popular, distributing information on the Internet is common in our daily life. Also, the explosion of the Internet, of wireless digital communication and data exchange on Internet has rapidly changed the way we connect with other people. But current firewall and IDS(Intrusion Detection System) of the network level suffers from many vulnerabilities in internal computing informations and resources. In this paper, we design of ICMP-based Traceback System using a ICMP Traceback Message for efficiently traceback without change structure of routers. ICMP-based Traceback System.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.29-32
• /
• 2000

MPLS stands for “Multi-protocol Label Switching”. It's a layer 3 switching technology aimed at greatly improving the packet forwarding performance of the backbone routers in the Internet or other large networks. We compare the performance of unlabeled IP traffic and labeled IP traffic. In this paper, by varying the packet rate and measuring throughput of the flows we analyze the performance of labeled IP packet traffic and unlabeled IP packet traffic in IP over MPLS.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.37-40
• /
• 2000

Multi Protocol Label Switching (MPLS) is a high performance method for forwarding packets (frames) through a network. It enables routers at the edge of a network to apply simple labels to packets (frames). we use MPLS in the core network for internet. MPLS provide high speed switching and traffic engineering in MPLS domain but at the Label Edge Router(LER) there is frequently cell discarding via congestion and buffer management method. It is one of the most important reasons retransmission and congestion. In this paper we propose advanced LER scheme that provide less cell loss rate also efficient network infrastructure.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.429-432
• /
• 2000

With the unprecedented growth in internet traffic, demand for larger, more scaleable IP backbone networks is seemingly limitless. This critical requirement is leading the DACOM to investigate architectural alternatives for cost effective, scaleable and flexible IP backbones. In this paper, we present three alternatives for IP backbones using DWDM systems and multi-gigabit IP Routers in the DACOM metro networks, and then compare them by performing an economic analysis.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1049-1052
• /
• 1999

As the Internet traffic increases, the demand for higher performance routers continues to grow, and it makes switch chips more complex. To make matters worse, these chips also need to handle high-level services. In this paper, we introduce an efficient verification methodology that can support real network traffics to satisfy the verification requirement of real complex situation even at the early design phase of switch chips.

• Proceedings of the CALSEC Conference
• /
• 2002.01a
• /
• pp.353-354
• /
• 2002

Horizontal Portal ·대중시장을 겨냥하며 다양한 어플리케이션을 제공·다양한 파트너들과 협력하여 브랜드 강화에 역점 ·Omnitel 2000, Halebop, Genie Internet Vertical Portal ·특정시장을 중심으로 전문화된 어플리케이션을 제공 ·Routers, Football365, Clubnation Personal Communication Portal ·개인통신 어플리케이션 즉, e-mail, 추가정보, 통합메시징, PIM 어플리케이션을 집중적으로 제공 ·고객풍성도 제고 및 자연적 특성에 적합한 서비스 제공 ·Breathe Mobility, Space2 GO Business Portal ·고객정보 및 어플리케이션의 통합과 맞춤 연락페이스를 위한 포맷 ·Extranet 어플리케이션 포함(중략)

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4512-4526
• /
• 2018

The Internet of Things (IoT) has become an emerging industry that is broadly used in many fields from industrial and agricultural manufacturing to home automation and hospitality industry. Because of the sheer number of connected devices transmitting valuable data, the IoT infrastructures have become a main target for cyber-criminals. One of the key challenges in protecting IoT devices is the lack of security measures by design. Although there are many hardware and software based security solutions (firewalls, honeypots, IPDS, anti-virus etc.) for information systems, most of these solutions cannot be applied to IoT devices because of the fact that IoT devices have limited computing resources (CPU, RAM,). In this paper, we propose a honeypot system called HoneyThing for modem/router devices (i.e. a kind of IoT device). HoneyThing emulates TR-069 protocol which is prevalent protocol used to remotely manage customer-premises equipment (CPE) devices, e.g. modems, routers. Honeything also serves an embedded web server simulating a few actual, critical vulnerabilities associated with the implementation of TR-069 protocol. To show effectiveness of the HoneyThing in capturing real world attacks, we have deployed it in the Internet. The obtained results are highly promising and facilitate to reveal network attacks targeting to CPE devices.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1536-1546
• /
• 2008

RSVP-capable router supporting guaranteed services on the internet generally uses a packet scheduler based on the Weighted Fair Queuing (WFQ) algorithm to secure required qualities of traffic flows. A RSVP-capable router based on the LOFQ (Latency optimized fair queuing) algorithm had been proposed to improve the performance of the WFQ-based RSVP-router, but it required not only the RESV message to be expanded but also its performance could be evaluated only through simulation. This paper proposed a LOFQ based RSVP-capable router using the conventional RESV message and developed an algorithm to analyze the performance of the LOFQ based RSVP-capable routers. The performance evaluation using the developed algorithm showed that in terms of performance improvement the proposed router is inferior to the one using the expanded RESV message under a small packet size, but on the range of a large packet size both routers provide the same improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1285-1296
• /
• 2011

Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.