• Journal of Applied Reliability
• /
• v.16 no.2
• /
• pp.90-97
• /
• 2016

Purpose: Majority of bridges and roads in Gangwon Province have been carrying loads associated with heavy materials such as rocks, mining products, and cement. This location-specific live loads have contributed to the present situation of overloading, compared to other provinces in Korea. However, the bridges in Gangwon province are designed by national bridge design specification, without considering the location-specific live load characteristics. Therefore, this study focuses on the real traffic data accumulated on regional weighing station to verify the live load characteristics, including actual live load gross vehicle weight, axle weight axle spacings, and number of trucks. Methods: In order to take into account the location specific live load, a governmental weigh station (38th national highway Miro) have been selected and the passing truck data are processed. Based on the truck survey, trucks are categorized into 3 different shapes, and each shape has been idealized into normal distribution. Then, the resulting survey data are processed to predict the target maximum live load values, including the axle loads and gross vehicle weights in 75 years service life span. Results: The results are compared to the nationally used DB-24 live loads, and the results show that nationally recognized DB-24 live load does not sufficiently represent real traffic in mountaineous region in Gangwon province. Conclusion: The comparison results in the recommendation of location-specific live load that should be taken into account for bridge design and evaluation.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.499-510
• /
• 2004

This paper proposes a heuristic load balancing algorithm for multiprocessor systems. The algorithm minimizes the number of idle links to distribute load traffic and reduces its communication cost. Each processor iteratively tries to transfer unit load to/from every neighbor processors. However, real load transfer is collectively done after complete load traffic calculation to minimize useless traffic. The proposed algorithm can be employed in various interconnection topologies with slight modifications. In this paper, it is applied to both hypercube and mesh environments. For performance evaluation, simulation studies are performed. The performance of proposed algorithm is compared to those of two well-known algorithms. The results show that the proposed algorithm always balances the loads perfectly. Furthermore, it reduces the communication costs by $70{\%}{\~}90{\%}$ in the hypercube ; and it reduces the cost by $\75{\%}$ in the mesh, compared to existing algorithms.

• 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.

• 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.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.39-43
• /
• 2006

In this paper, we proposed TASL-MAC, a medium-access control (MAC) protocol for wireless sensor networks. In wireless sensor networks, sensor nodes are usually deployed in a special environment, are assigned with long-term work, and are supported by a limited battery. As such, reducing the energy consumption becomes the primary concern with regard to wireless sensor networks. At the same time, reducing the latency in multi-hop data transmission is also very important. In the existing research, sensor nodes are expected to be switched to the sleep mode in order to reduce energy consumption. However, the existing proposals tended to assign the sensors with a fixed Sleep/Listening schedule, which causes unnecessary idle listening problems and conspicuous transmission latency due to the diversity of the traffic-load in the network. TASL-MAC is designed to dynamically adjust the duty listening time based on traffic load. This protocol enables the node with a proper data transfer rate to satisfy the application's requirements. Meanwhile, it can lead to much greater power efficiency by prolonging the nodes' sleeping time when the traffic. We evaluate our implementation of TASL-MAC in NS-2. The evaluation result indicates that our proposal could explicitly reduce packet delivery latency, and that it could also significantly prolong the lifetime of the entire network when traffic is low.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.277-282
• /
• 2006

Road traffic noise is not produced by any one factor rather occurs as a composition of various factors. Its occurrence is made by running engine noise, tire frictional, and exhaust noise etc. The quality of the noise depends on the size of the vehicles, rotation and engine speed, vehicle load, package state of the road and incline etc. The occurrence of noise level of heavy trucks appears louder than smaller vehicles and the noise levels produced differs according to speed and load etc between similar size vehicles. Other factors such as traffic density, average speed, mixing rate of heavy vehicles, and the distance between vehicles also generate road traffic noise. In this paper we examine 2, 4, and 6-lane roads in Jeonju. Consequently, this study examined the means used to measure road traffic noise. It was found that when there is a large traffic density and the average velocity is below 70 km/hr, the noise level could receive a relative proper value by the current measuring means. But in the case of night-time, it was found that the current measuring method is inapposite.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2589-2609
• /
• 2021

Segment routing (SR) is a highly implementable approach for traffic engineering (TE) with high flexibility, high scalability, and high stability, which can be established upon existing network infrastructure. Thus, when a network failure occurs, it can leverage the existing rerouting methods, such as rerouting based on Interior Gateway Protocol (IGP) and fast rerouting with loop-free alternates. To better exploit these features, we propose a high-performance and easy-to-deploy method SRUF (Segment Routing under Uncertain Failures). The method is inspired by the Value-at-Risk (VaR) theory in finance. Just as each investment risk is considered in financial investment, SRUF also considers each traffic distribution scheme's risk when forwarding traffic to achieve optimal traffic distribution. Specifically, SRUF takes into account that every link may fail and therefore has inherent robustness and high availability. Also, SRUF considers that a single link failure is a low-probability event; hence it can achieve high performance. We perform experiments on real topologies to validate the flexibility, high-availability, and load balancing of SRUF. The results show that when given an availability requirement, SRUF has greater load balancing performance under uncertain failures and that when given a demand requirement, SRUF can achieve higher availability.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.15-21
• /
• 2004

One of the most important issues in designing a network and realizing a service is dealing with traffic characteristics. Recent experimental research on LAN, WAN, and VBR traffic properties has highlighted that real traffic specificities can not be displayed because the current models based on the Poisson assumption under estimate the long range dependency of network traffic and self-similar peculiarities. Therefore, a new approach using self-similarity characteristics as a real traffic model was recently developed. In This paper we discusses the definition of self-similarity traffic. Moreover, real traffic was collected and we generated self-similar data traffic like real traffic to background load. On the existing ABR congestion control algorithm transmission throughput with the representative ERICA, EPRCA and NIST switch algorithm show the efficient reaction about the burst traffic.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.2 s.344
• /
• pp.1-6
• /
• 2006

This paper proposes association algorithm using load balancing for efficient AP selection under environment of wireless local area network(WLAN). Our scheme measures arrival time of association information when establishing the connection between access points and access terminal, analyzes the load condition of AP, and applies load balancing. AT selects and sets up low traffic AP by measuring traffic of connected access terminal, which can prevent over-franc of access points under hotspot environment that users access simultaneously. According to the above-described selection in a high speed wireless Internet service based on public WLAN technologies that are currently in operations. Further, it is possible to improve the efficiency of network management.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.135-140
• /
• 2002

An efficient QoS routing scheme needs to find a path that satisfies a given QoS requirements while consuming as few resources as Possible. In this paper, we propose two schemes of calculating resources'costs one for on-demand and one for precomputation QoS routing schemes. These schemes are effective in respect to the global 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 K multip1e paths between all pairs of ingress and ogress border routers while considering balancing of the expected load. We, therefore, expect that the paths are bettor than any other paths in respect to reserving the network resources on Paths. The routine: scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. cote that our cost calculation schemes for both kinds of traffic could be used in existing QoS routing protocols without and modification in small and large scale of networks.