• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.518-531
• /
• 2004

This paper discusses a testbed architecture for implementing scalable service differentiation in the Internet. The differentiated services (DiffServ) testbed architecture is based on a model in which a bandwidth broker (BB) can control network resources, and the ALTQ can reserve resources in a router to guarantee a Quality of Service (QoS) for incoming traffic to the testbed. The reservation and releasemessage for the ALTQ is contingent upon a decision message in the BE. The BB has all the information in advance, which is required for a decision message, in the form of PIB. A signaling protocol between the BB and the routers is the COPS protocol proposed at the IETF. In terms of service differentiation, a user should make an SLA in advance, and reserve required bandwidth through an RAR procedure. The SLA and RAR message between a user and the BB has implemented with the COPS extension which was used between a router and the BB. We evaluates the service differentiation for the video streaming in that the EF class traffic shows superb performance than the BE class traffic where is a network congestion. We also present the differentiated service showing a better packet receiving rate, low packet loss, and low delay for the EF class video service.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.34-45
• /
• 2013

Recently, world-wide research activities on new network architectures and protocols are being actively progressed. Furthermore, research activities on testbed and related technologies for supporting those activities are being actively performed. In domestic study, research on the OpenFlow protocol based future Internet testbed implementation and research on its virtualization for supporting independent research experiments are being performed at the same time. The network virtualization is a technology which maximizes the testbed utilization without interfering each other for the individual research when many researchers share the testbed. In this paper, we implemented a Enhanced FlowVisor by extending basic FlowVisor by adding QoS functions which are admission control and minimum bandwidth guarantee. On the testbed, we performed a real-time video streaming experiment for verifying the performance of the Enhnaced FlowVisor on the OpenFlow protocol based future internet testbed. The result shows that the Enhanced FlowVisor can provide reliable and stable QoS to the individual researches without disturbing each other traffic on virtualized networks of the future Internet testbed.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.799-806
• /
• 2004

A growing diversity of pervasive devices is gaming access to the Internet and other information. However, much of the rich multimedia contents cannot be easily handled by the client devices because of the limited communication, processing, storage and display capabilities. The in-tegration of voice, data and video service modified the target of networking technologies. Networks must have some the capabilities for in-tegration of various services and also for QoS support as required by each of those service. Because of these reasons, we developed EAGIS(Efficient ATM Gateway for real time Internet Service) to provide seamless multimedia service between the ATM network and the Internet. EAGIS consists of the interworking unit, content server, transcoding server, and the serveice broker to provide seamless multimedia service be-tween the ATM network and the Internet. In this paper, we design the architecture and transcoding service scenario of the EAGIS. When the RTP is used for the bi-directional communication, transcoding time is configured by the time-stamp of RTCP. When HTTP is used for unidirec-tional communication, self-timer is used. By using these reference time, standard transcoding method is applicable according to the frame trans-mission rate and network traffic load. And we can also assure the QoS of the multiple users` effective bandwidth by our algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.653-660
• /
• 2013

This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

• Journal of Advanced Navigation Technology
• /
• v.18 no.4
• /
• pp.325-333
• /
• 2014

An ADS-B system, which is a critical technology in surveillance area of the CNS/ATM, can replace or compensate a conventional radar based surveillance system through the communications among aircrafts. An ADS-B ground system which is to use the ADS-B on the ground air traffic management system consists of various subsystem devices such as ground stations that communicate with the aircrafts, and ADS-B/TIS-B/FIS-B servers. The ADS-B ground system has a form of distributed system and is interconnected through the network. Therefore, a system which can monitor and control the status of the multiple subsystem devices of the ADS-B ground system is essential. In this paper, we designed and implemented a remote status monitor and control system for the ADS-B system that can monitor and control the subsystem devices of the ADS-B system in remote place via SNMP protocol.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.443-451
• /
• 2005

Stateful inspection devices must maintain flow information. These devices create the flow information also for network attack packets, and it can fatally inflate the dynamic memory allocation on stateful inspection devices under network attacks. The memory inflation leads to memory overflow and subsequent performance degradation. In this paper, we present a guideline to set the flow entry timeout for a stateful inspection device to remove harmful embryonic entries created by network attacks. Considering Transmission Control Protocol (TCP) if utilized by most of these attacks as well as legitimate traffic, we propose a parsimonious memory management guideline based on the design of the TCP and the analysis of real-life Internet traces. In particular, we demonstrate that for all practical purposes one should not reserve memory for an embryonic TCP connection with more than (R+T) seconds of inactivity where R=0, 3, 9 and $1\leqq{T}\leqq{2}$ depending on the load level.

• Journal of The Korean Association of Information Education
• /
• v.15 no.1
• /
• pp.129-136
• /
• 2011

The aim of this study is to present the handover procedures and the performance comparisons of layered mobility management schemes for wireless mobile Internet. To investigate efficient mobility management schemes providing seamless information services in a mobile environment, this paper provided the detailed discussions of existing network layered mobility management scheme, including Mobile IPv4, Mobile IPv6, and new transport layer mobility management scheme, stream control transmission protocol (SCTP) based mobility architecture (SMA). Network simulator-2 (ns-2) was used to compare the performance between Mobile IPv6 and SMA in the wireless mobile Internet environment. Simulation results show that for typical network configuration and parameters, SMA has a lower handover latency, lower packet loss rate, and higher throughput than Mobile IPv6.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2733-2740
• /
• 2009

An advanced and proactive response mechanism against diverse attacks on All-IP network should be proposed for enhance its security and reliability on open network. There are two main research works related to this study. First one is the SPIE system with hash function on Bloom filter and second one is the Sinkhole routing mechanism using BGP protocol for verifying its transmission path. In this study, we proposed an advanced IP Tracing mechanism based on Bloom filter and Sinkhole routing mechanism. Proposed mechanism has a Manager module for controlling the regional router with using packet monitoring and filtering mechanism to trace and find the attack packet's real transmission path. Additionally, proposed mechanism provides advanced packet aggregation and monitoring/control module based on existing Sinkhole routing method. Therefore, we can provide an optimized one in All-IP network by combining the strength on existing two mechanisms. And the Tracing performance also can be enhanced compared with previously suggested mechanism.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.37-46
• /
• 2011

Time synchronization plays an important role in mobile communication systems, particularly, when an accurate time-division mechanism among the communication entities is required. We present a new time synchronization algorithm for a wireless mobile ad-hoc network assuming that communication link is managed by a time-slot reservation-based medium access control protocol. The central idea is to reduce time synchronization packet collisions by exploiting the advantages found in reference broadcasting. In addition, we adopt a sophisticated clock updating scheme to ensure the time synchronization convergence. To verify the performance of our algorithm, a set of network simulations has been performed under various mobile ad-hoc network scenarios using the OPNET. The results obtained from the simulations show that the proposed method outperforms the conventional TSF method in terms of synchronization accuracy and convergence time.