• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.443-461
• /
• 2014

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.199-206
• /
• 2008

In this paper, we propose a novel Route_Reconf message as the RSVP message to maintain an RSVP session for hard handoff and consider path-comparing route (PCR) a PCR algorithm to find an intermediate node in the charge of downlink re-establishment. And, we consider information form each mode for the PCR algorithm, which also reduces the frequency and amount of exchanged RSVP message to minimize packet loss and delay between an intermediate node and a receiver. According to the proposed algorithm, a new support node (NSN) and an existing support node (ESN) along the RSVP path can be found; the former is a supporting RSVP session node newly searched and the latter is the last supporting node holding the previous session after handoff. On receiving the Route_Reconf message at the ESN, a new allocated route from a NSN to the MN waiting for the handoff via a new AR is configured by the ESN.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.126-129
• /
• 2007

Recently the use of wireless network increases according to it solves the hand-off and with path loss, pading, noise etc of wireless network the research for transmission error improvement is developed. TCP and SCTP of standard where it guarantees the reliability of wire network apply in wireless network the congestion control, flow control mechanism used it decreases the efficiency of data transfer throughputs. In this paper, It mixes SCTP and SNOOP for SCTP apply on wireless network, to improve BS(Basic Station) operation processes when the transmission error occurs in wireless network. BS send ZWP(Zero Window Probe) to MN(Mobile Node) when the transmission error occurs so, check path and status and update RWND and error status checked. It selects the new path, send ZWA(Zero Window Advertisement) to FH(Fixed Host) and the prevents call to congestion control or flow control and it does to make wait status standing. Continuously of data transfer after the connection of wireless network is stabilized, it make increase about 10% the transmission throughput of data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12A
• /
• pp.1111-1119
• /
• 2005

A single fiber cut can potentially influence a total of 1.6 Tbps of traffic and is surprisingly frequent and results in significant loss of traffic. The survivability as we as the resource utilization of the connection in optical networks is important. Existing protection mechanisms to rapidly recover the failures allocate the backup path just SRLG-disjointed with working path. Those did not consider the unbalanced resource share of backup paths. The backup paths can be centralized on the specific link so that the idle resource is not used. As a result, as those do not efficiently use the resource the whole resource utilization is not so good. So we propose the mechanism to enhance the resources utilization as settling down the unbalanced resource share. Our purpose is to improve the link utilization as distributing the maximum link load.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.4
• /
• pp.436-447
• /
• 2013

In this paper, Integrated circuit(IC) electromagnetic(EM) conducted immunity measurement and simulation using bulk current injection(BCI) and direct power injection(DPI) methods were conducted for 1.8 V I/O buffers. Using the equivalent circuit models developed for IC electromagnetic conducted immunity tests, we investigated the reliability of the frequency region where IC electromagnetic conducted immunity test is performed. The insertion loss for the noise injection path obtained from the simulation indicates that using only one conducted immunity test method cannot provide reliable conducted immunity test for broadband noise. Based on the forward power results, we analyzed the actual amount of EM noise injected to IC. We propose a more reliable immunity test methods for broad band noise.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.143-148
• /
• 2006

This paper presents a high isolation and power-handling single-pole double-throw(SPDT) switch for dual band wireless LAN applications. The switch circuit has asymmetric topology which uses stacked-gate to have high power-handling and isolation for the Tx path. The proposed SPDT switch has been designed with optimum gate-width, bias, and number of stacked-gate FET. This SPDT switch has been implemented with $0.25{\mu}m$ GaAs pHEMT process which has Gmmax of 500mS/mm and fmax of 150GHz. The designed SPDT switch has the measured insertion loss of better than 0.9dB and isolation of better than 40dB for the Tx path and 25dB for the Rx path and the high power handling capability with PldB of about 23dBm for control voltage of -3/0V. The fabricated SPDT switch chip size is $1.8mm{\times}1.8mm$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.204-211
• /
• 2012

Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.11-19
• /
• 2011

In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information for source routing in transport networks that conduct hierarchical QoS routing. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. This method selects the main path weight in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some path weight during aggregation process. In this paper, the main path weight is defined as outlier. Service Boundary Line has 2k+5parameters. k is the number of outliers. The number of storage spaces of Service Boundary Line changes according to the number of outliers. Simulation results show that our approximation method requires a storage space that 1.5-2 times larger than those in other known techniques depending on outlier selection method, but its information accuracy of proposed method in the ratio between storage space and information accuracy is higher.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.255-263
• /
• 2015

The sensor registry system has been developed for instant use and seamless interpretation of sensor data in a heterogeneous sensor network environment. However, the existing sensor registry system cannot provide information for interpretation of the sensor data in situations in which the network is unstable. This limitation causes several problems such as sensor data loss, inaccuracy of processed results, and low service quality. A method to resolve such problems in the aspect of software is presented herein. In other words, an extended sensor registry system is proposed to enable the stable use of sensor information, even under conditions of unstable network connection, by providing sensor information with a mobile device in advance through the user path prediction. The results of experiments and evaluation are also presented. The extended sensor registry system proposed in this paper enhances the stable usability of sensor information as well as improves the quality of sensor-based services.

• Journal of the Korea Society for Simulation
• /
• v.21 no.1
• /
• pp.9-17
• /
• 2012

War-game simulation models the situation of a battlefield and has been used for evaluating fighting power and analyzing the occupation of a troop. However, in war-game simulation environment, it is very complex to consider all factors which can be influenced in real battlefields. To solve the problem of the consideration, we propose an ontology-based path finding model. This model uses an ontology to conceptualize the situation data of a battlefield and represents the relations among the concepts. In addition, we extract new knowledge from the war-game ontology by defining some inference rules and share knowledge by the established rules. For the performance evaluation of the proposed model, we made a limitation on the simulation environment and measure the moving time of a troop, the fighting capability of a troop, and the necessary cost while a troop is moving. Experimental results show that this model provides many advantages in aspects of the moving time, a loss of fighting capability, and the necessary cost.