• Wind and Structures
• /
• v.29 no.3
• /
• pp.177-194
• /
• 2019

While establishing adequate load paths in the light-frame wood structures is critical to maintain the overall structural integrity and avoid significant damage under extreme wind events, the understanding of the load paths is limited by the high redundant nature of this building type. The objective of the current study is to evaluate the system effects and investigate the load paths in the wood structures especially the older buildings for a better performance assessment of the existing building stock under high winds, which will provide guidance for building constructions in the future. This is done by developing building models with configurations that are suspicious to induce failure per post damage reconnaissance. The effect of each configuration to the structural integrity is evaluated by the first failure wind speed, amajor indicator beyond the linear to the nonlinear range. A 3D finite-element (FE) building model is adopted as a control case that is modeled using a validated methodology in a highly-detailed fashion where the nonlinearity of connections is explicitly simulated. This model is then altered systematically to analyze the effects of configuration variations in the model such as the gable end sheathing continuity and the gable end truss stiffness, etc. The resolution of the wind loads from scaled wind tunnel tests is also discussed by comparing the effects to wind loads derived from large-scale wind tests.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.183-191
• /
• 2004

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.893-902
• /
• 2002

MPLS enables efficient explicit routing, and thus provides great advantages in supporting traffic engineering. Exploiting this capability, we Propose a load balancing scheme which deploys a multipath routing. It is named LBM (Load Balancing in MPLS networks), and targets at efficient network utilization as well as performance enhancement. LBM establishes multiple LSP (Label Switched Path)s between a pair of ingress-egress routers, and distributes traffic over these LSPs at the new level. Its routing decision is based on both the length and the utilization of the paths. In order to enhance the efficiency of a link usage, a link is limited to be used by shorter paths as its utilization becomes higher Longer paths are considered to be candidate alternative paths as the utilization of shorter paths becomes higher. Simulation experiments are performed in order to compare the performance of LBM to that of static shortest path only scheme as well as the other representative dynamic multipath traffic distribution approaches. The simulation results show that LBM outperforms the compared approaches, and the performance gain is more significant when the traffic distribution among the ingress-egress pairs is non-uniform.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.1-7
• /
• 2003

In this paper, we propose load balanced routing and wavelength assignment (RWA) algorithm for static model. The proposed algorithm arranges the routing paths over the link uniformly and assigns routing paths according to the length of routing paths orderly. Thus, the proposed algorithm can efficiently utilize the network resources. Through the computer simulation on layered-graph model, we prove that the proposed algorithm improves network throughput and reduces blocking probability comparing to first-fit algorithm [1］. Moreover, the proposed algorithm considerably reduces computational time.

• Steel and Composite Structures
• /
• v.28 no.6
• /
• pp.671-679
• /
• 2018

The paper is devoted to the stability analysis of a simply supported five layer sandwich beam. The beam consists of five layers: two metal faces, the metal foam core and two binding layers between faces and the core. The main goal is to elaborate a mathematical and numerical model of this beam. The beam is subjected to an axial compression. The nonlinear hypothesis of deformation of the cross section of the beam is formulated. Based on the Hamilton's principle the system of four stability equations is obtained. This system is approximately solved. Applying the Bubnov-Galerkin's method gives an ordinary differential equation of motion. The equation is then numerically processed. The equilibrium paths for a static and dynamic load are derived and the influence of the binding layers is considered. The main goal of the paper is an analytical description including the influence of binding layers on stability, especially on critical load, static and dynamic paths. Analytical solutions, in particular mathematical model are verified numerically and the results are compared with those obtained in experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.140-147
• /
• 2001

In this paper, we propose a scheme of calculating resources\` costs for precomputation in QoS routing schemes. This scheme is effective in respect to the g1oba1 network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load and then selects paths with the probability of path selection. We, therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And for analysis of a load balancing cost calculation proposed a simulation is done.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.114-119
• /
• 2003

An efficient QoS routing scheme for improving on-line games services needs to find a path that satisfies a given noS requirements while consuming as few resources as possible. In this paper, we propose a scheme of calculating resources' costs for precomputation QoS routing schemes. For a domain in the networks. the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load. We. therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

• Structural Engineering and Mechanics
• /
• v.82 no.1
• /
• pp.69-79
• /
• 2022

This paper discusses the field testing of two single-span double-tee girder (DTG) bridges in South Dakota to determine live load distribution factors (LLDFs) and the dynamic load allowance (IM). One bridge had seven girders and another had eight girders. The longitudinal girder-to-girder joints of both bridges were deteriorated in a way that water could penetrate and the joint steel members were corroded. A truck traveled across each of the two bridges at five transverse paths. The paths were tested twice with a crawl speed load test and twice with a dynamic load. The LLDFs and IM were determined using strain data measured during the field tests. These results were compared with those determined according to the AASHTO Standard and the AASHTO LRFD specifications. Nearly all the measured LLDFs were below the AASHTO LRFD design LLDFs, with the exception of two instances: 1) An exterior DTG on the seven-girder bridge and 2) An interior DTG on the eight-girder bridge. The LLDFs specified in the AASHTO Standard were conservative compared with the measured LLDFs. It was also found that both AASHTO LRFD and AASHTO Standard specifications were conservative when estimating IM, compared to the field test results for both bridges.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.209-217
• /
• 2005

In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources' costs for precomputation schemes in hierarchical routing is proposed. and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.671-678
• /
• 2002

In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources'costs for precomputation schemes in hierarchical routing is proposed, and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And these schemes make possible both global network resources' utilization and also load balancing.