• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1713-1715
• /
• 2007

Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.47.4-47.4
• /
• 2019

Recent observations on the double red clumps in the bulge validate the close connection in stellar populations between Galactic globular clusters (GCs) and the Milky Way (MW) bulge. Intriguingly, diverse phenomena observed in early-type galaxies (ETGs) and their GC systems are also indicating the similarities with Galactic GCs with multiple populations. Here, we present the population synthesis for the Galactic bulge and ETGs using stellar populations observed in the Galactic GCs with multiple populations. Our new models well explain observations of both the MW bulge and ETGs. Also, the inclusion of GC-originated population to the population synthesis model shows substantial impacts on the age-dating of stellar populations. The implication of this result for the interpretation of the formation history and the age-dating of ETGs will be discussed in detail.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2811-2830
• /
• 2017

In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

• Structural Engineering and Mechanics
• /
• v.38 no.4
• /
• pp.443-457
• /
• 2011

The loss of strength in a structure as a result of cyclic loads over a period of life time is an important phenomenon for the life-cycle analysis. Service loads are accentuated at the areas of stress concentration, mainly at the connection of components. Structural components unavoidably are affected by defects such as surface scratches, surface roughness and weld defects of random sizes, which usually occur during the manufacturing and handling process. These defects are shown to have an important effect on the fatigue life of the structural components by promoting crack initiation sites. The value of equivalent initial flaw size (EIFS) is calculated by using the back extrapolation technique and the Paris law of fatigue crack growth from results of fatigue tests. We try to analyze the effect of EIFS distribution in a multiple site damage (MSD) specimen by using the extended finite element method (XFEM). For the analysis, fatigue tests were conducted on the centrally-cracked specimens and MSD specimens.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.338-350
• /
• 2008

The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6017-6037
• /
• 2017

In a multi-resolution image encoding system, the image is encoded into a single file as a layer of bit streams, and then it is transmitted layer by layer progressively to reduce the transmission time across a low bandwidth connection. This encoding scheme is also suitable for multiple decoders, each with different capabilities ranging from a handheld device to a PC. In our previous work, we proposed an edge adaptive hierarchical interpolation algorithm for multi-resolution image coding system. In this paper, we enhanced its compression efficiency by adding three major components. First, its prediction accuracy is improved using context adaptive error modeling as a feedback. Second, the conditional probability of prediction errors is sharpened by removing the sign redundancy among local prediction errors by applying sign flipping. Third, the conditional probability is sharpened further by reducing the number of distinct error symbols using error remapping function. Experimental results on benchmark data sets reveal that the enhanced algorithm achieves a better compression bit rate than our previous algorithm and other algorithms. It is shown that compression bit rate is much better for images that are rich in directional edges and textures. The enhanced algorithm also shows better rate-distortion performance and visual quality at the intermediate stages of progressive image transmission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4068-4086
• /
• 2014

Due to the prevalence of powerful mobile terminals and the rapid advancements in wireless communication technologies, the wireless video streaming service has become increasingly more popular. Recent studies show that video streaming services via Transmission Control Protocol (TCP) are becoming more practical. TCP has more advantages than User Diagram Protocol (UDP), including firewall traversal, bandwidth fairness, and reliability. However, each video service shares an equal portion of the limited bandwidth because of the fair sharing characteristics inherent in TCP and this bandwidth fair sharing cannot always guarantee the video quality for each user. To solve this challenging problem, an Adaptive Multiple TCP (AM-TCP) scheme is proposed in this paper to guarantee the video quality for mobile devices in wireless networks. AM-TCP adaptively controls the number of TCP connections according to the video Rate Distortion (RD) characteristics of each stream and network status. The proposed scheme can minimize the total distortion of all participating video streams and maximize the service quality by guaranteeing the quality of each video streaming session. The simulation results show that the proposed scheme can significantly improve the quality of video streaming in wireless networks.

• The Journal of the Korean dental association
• /
• v.54 no.3
• /
• pp.191-197
• /
• 2016

In the past, restoration of implant crown, ready-made abutment produced by implant manufacturer could only be used. Using straight, angled abutment, there was a limit in adaptation multiple implants. Recently, with the development of implant and CAD/CAM technology, CAD/CAM customized abutment use has become possible which is different from the past when restoration was possible with only prefabricated abutment. Not only it makes emergence profile possible which is similar to natural teeth, but also it makes insertion path possible on CAD in multiple implant restorations. However, on anterior teeth which dental esthetics is very important, another restorations which are formed with natural colored gingiva area could be required. Titanium-based zirconia prostheses which have titanium connection and zirconia structure from 1mm above fixture platform are alternative. Therefore, the purpose of this review is to analyze the characteristics, advantages and disadvantages of the abutment which is used in multiple implant restorations, and to choose right abutment when clinical trials.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.399-404
• /
• 2010

We propose a seamless IPTV transport technology of mobile device. This technology uses multiple interfaces of wireless communication on mobile device. This proposal for transportation of mobile IPTV contents is more mobile and adaptable than other wireless technologies that are currently being used. Algorithm of proposed technology is as follow. When the signal strength of the connected wireless network interface of mobile device is getting lower than specified level, another wireless network interface is connected to continue downloading the IPTV contents in advance. Another connection is maintained until the signal strength of the first connected interface is stable or the interface is connected to another base station (or AP) that have good signal strength. For more seamless services, we consider classifying the packets of mobile IPTV and using dynamic content quality select techniques. Dynamic content quality selection is based on notifying transfer rate to the content delivery network (CDN) server. The proposed technology is expected to use efficiently with both mobile IPTV and the transportation of mobile P2P/P4P.

• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.51-56
• /
• 2008

A combination of VPNs and dial-up access, such as DSL and Cable, usually provides the cost-effective solution as the substitution of private networks on high-cost leased line. The business demand for high availability has increased with VPN spreading. This paper presents the schemes for a high availability of network access and a load balancing of network traffic in VPN gateways by using multiple links or multihoming capability based on active-active approach. The high availability and load balancing of network links can be achieved by duplicating external network access into multiple independent links. This can provide a continuous network connection to internal users even if one of the links is failed. Moreover, it can provide twice network bandwidth by distributing the traffic into the links. Static and dynamic algorithms are proposed as the load balancing algorithms.