• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.339-346
• /
• 1999

When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.95-98
• /
• 2006

Data collected by sensors in field are transmitted to the base station gathering all of data. Because sensors have to gather data in surroundings and periodically transmit data to the base station, it makes energy consumed much. In this paper, we propose the scheme that is to avoid traffic congestion with achievement of energy efficiency, so collected data is transmitted efficiently. This is to adjust transmission rate differently in case of increasing or decreasing traffic and minimize the energy consumption with setting ideal options up basic CSMA(Carrier Sense Multiple Access) protocol in each sensor. Through the simulation, we find the ideal CSMA options and apply the proposed scheme of traffic control mechanism to them, then show energy efficiency and effective traffic control mechanism.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1084-1089
• /
• 2004

This paper describes the improvement of web cache server by scoping in replacement algorithm of data which are collected from the clients. We have found that each replacement algorithm is suitable for each type of data in the web pages. Therefore, we introduce the mechanism to select the replacement algorithm depending on the size of data called the Replacement Algorithm Selection Mechanism (RASM). RASM allows the web cache server to have the suitable replacement algorithm for each type of data. As the result, the byte hit ratio of web cache server can be increased and the congestion in the network can be alleviated.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.95-101
• /
• 2012

As the influence of social networking services across the societies becomes greatly higher, many of the domestic agencies are trying to communicate with users through the introduction of social networking services. In this paper, we present a reliable exhibition-related contents recommendation service to combine social networking service concept with the customized contents recommendation method we previously proposed. The proposed service may effectively and reliably recommend its users exhibition-related contents by exploiting their relationships in the social networks compared with the existing ones.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.186-192
• /
• 2014

Monolithic three-dimensional integrated chips (3D ICs) are an emerging technology that offers an integration density that is some orders of magnitude higher than the conventional through-silicon-via (TSV)-based 3D ICs. This is due to a sequential integration process that enables extremely small monolithic inter-tier vias (MIVs). For a monolithic 3D memory, we first explore the static random-access memory (SRAM) design. Next, for digital logic, we explore several design styles. The first is transistor-level, which is a design style unique to monolithic 3D ICs that are enabled by the ultra-high-density of MIVs. We also explore gate-level and block-level design styles, which are available for TSV-based 3D ICs. For each of these design styles, we present techniques to obtain the graphic database system (GDS) layouts, and perform a signoff-quality performance and power analysis. We also discuss various challenges facing monolithic 3D ICs, such as achieving 50% footprint reduction over two-dimensional (2D) ICs, routing congestion, power delivery network design, and thermal issues. Finally, we present design techniques to overcome these challenges.

• Journal of Advanced Navigation Technology
• /
• v.16 no.3
• /
• pp.463-470
• /
• 2012

This paper proposes a new profit popularity-based segment caching control mechanism for assuring a consecutive streaming QoS (Quality of Service) in the wireless channel. Then, the proposed mechanism operates SSCP (Single Segment Caching Profit) and MSCP (Multiple Segment Caching Profit) for assuring a QoS. SSCP and MSCP is to optimize the cache performance when is performed the streaming in the proxy. The proposed mechanism simulated to evaluate such mechanisms as fixed-partition mechanism, weight-based mechanism, SSCP, and MSCP. Simulation results show that the proposed mechanism has superior performance compared to other mechanisms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.699-706
• /
• 2008

This paper compares throughput performance of TCP and SCTP in a variety of network environments. For experiments, we construct a Linux-based testbed and consider a set of performance metrics such as MSS(Maximum Segment Size), transmission delay, and packet loss rate. In addition, we analyze the effect of SCTP multi-streaming on throughput. From the experimental results, we can see that SCTP provides throughput gain of approximately $20%{\sim}50%$ over TCP. This performance gain comes from the distinctive features of SCTP such as chunk bundling, initial congestion window of 2 MTU and SACK(Selective ACK) based error control. In the lossy networks, we can see that SCTP multi-streaming transmissions can effectively overcome the so-called HoLB(Head-of-Line Blocking) phenomenon of TCP.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.38-45
• /
• 2004

The ABR point-to-multipoint connection is now playing a more important role than before. Many consolidation algorithms have been proposed to solve the consolidation noise problem and the slow transient response problem. But few timeout algorithms are proposed to handle the non-responsive branches for the multicast connections. Chen’s algorithm needs exchanging control messages between switches [9]. Besides, it may mistake a responsive branch as a non-responsive branch because of fast changes in source rates, which causes wrong information in BRM cells and may lead to network congestion and data losses in the responsive branch. We propose a simple timeout algorithm which can handle the non-responsive branches without exchanging message between switches. The timeout value for each switch is computed locally. Simulation results show that the proposed timeout algorithm can efficiently handle the non-responsive branches and utilize the available bandwidth within a small period of time. In addition, our algorithm could handle the situation when the source rates change quickly.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.51-60
• /
• 2011

In this paper, we propose a P4P based P2P system for live multimedia streaming services. In order to satisfy the strict requirement of delay in live multimedia streaming, in the proposed scheme, the P4P server of network provider provides the network status information related to delay and congestion links to P2P system in addition to the information to optimize the network resource utilization. The P2P system server, then, makes the peering suggestion based on the information from the network server. Also, we propose a playback synchronization mechanism that enable each peer to start the playback within the limited variation from the playback positions of source peer. Through the simulation results, it is shown that the proposed scheme not only deals with the original objective of the P4P framework, i.e., effective network utilization, but also the live multimedia streaming requirements. It enhances the playback continuity, and reduces the playback start-up latency and the control overhead. In addition, the proposed scheme reduces the variation in playback positions of the peers.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1057-1064
• /
• 2015

The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.