• Steel and Composite Structures
• /
• v.27 no.3
• /
• pp.285-295
• /
• 2018

In this paper, the bearing capacity of a non-eccentric and eccentric tubular, concrete-filled, steel bridge pier was studied through the finite element method. Firstly, to verify the validity of the numerical analysis, the finite element analysis of four steel tube columns with concrete in-fill was carried out under eccentric loading and horizontal cyclic loading. The analytical results were compared with experimental data. Secondly, the effects of the eccentricity of the vertical loading on the seismic performance of these eccentrically loaded steel tubular bridge piers were considered. According to the simulated results, with increasing eccentricity ratio, the bearing capacity on the eccentric side of a steel tubular bridge pier (with concrete in-fill) is greatly reduced, while the capacity on the opposite side is improved. Moreover, an empirical formula was proposed to describe the bearing capacity of such bridge piers under non-eccentric and eccentric load. This will provide theoretical evidence for the seismic design of the eccentrically loaded steel tubular bridge piers with concrete in-fill.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.55-60
• /
• 1992

The IEEE 802.4 priority mechanism can be used to handle multiple data access classes of traffic. Several timers are used to realize the priority mechanism. The performance and stability of a token bus network depend on the assignment of such timers. In this peper, we present a dynamic timer assignment algorithm for the token passing bus network. The presented algorithm has simple structure for real-time applications and adaptively controls the set of initial timer values according to the offered traffic load. The assignment of the set of timers becomes easy due to the presented algorithm. Based on the iterative algorithm, some solutions such as mean waiting time are derived.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.32-39
• /
• 1995

In this paper, a timer thresholds tuning algorithm is proposed, satisfying the required response time for traffic with time-critical applications and asynchronous traffic in FDDI network. Under light and medium load, priorities and timer thresholds play a minor role for medium access control. In these cases all quenes are served exhaustively with a ver high service probability and the packet loss probability approaches almost zero. Under overload condition, however, the performance of the FDDI Network is completely determined by the selection of the timer thresholds. The timer thresholds tuned by mathematical results is confirmed by simulation results using SIMAN/UNIX package. The allocation of guaranteed bandwidth can be controlled easily by tuning the timer thresholds according to the proposed rules.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.235-247
• /
• 1997

In this study, the performance of ATM multiplexer with MPEG(Motion Pictures Experts Group) video is analyzed by considering the effect of the MPEG GOP(Group of Pictures) structure. By assuming that frame starting times are synchronized, aggregated traffics are considered to be transmitted at the beginning of each frame time units. The aggregated number of cells generated during a frame time unit is, therefore, derived from distributions of individual sources. The stationary probability of buffer occupancy can be easily obtained by using a property of the periodicity of aggregated traffics. Simulation approach is also used to determine the traffic load for a given probability of satisfying QoS(Quality of Service).

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.10 no.2
• /
• pp.1-12
• /
• 1992

This paper presents an approach for analysis of traffic accidents based on close-range Photogrammetry and Simulation of computer graphics. By using the Photographic data analysis, physical characteristics and friction factors of load, we simulated the collision form and speeds at the time of accident.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.118-127
• /
• 2002

This paper proposes a new scheme - parallel control scheme with feedback control (PCFC) for ABR services in ATM networks. The information from a source is split into a number of streams, for delivery over separate parallel connections with particular coding. At the receiver, the original information is reconstructed by the received packet from the parallel connections. The effects of PCFC on the network performance are due to two factors: Traffic splitting and load balancing. By combinations of analysis and simulation, this paper studies the implications of PCFC for how the ABR parameters should be scaled and the advantages of PCFC compared with other existing schemes.

• Journal of the Optical Society of Korea
• /
• v.13 no.3
• /
• pp.373-378
• /
• 2009

An Ethernet passive optical network (EPON) is a low-cost, high-speed solution to the bottleneck problem of a broadband access network. This paper analyzes the delay and the jitter performance of dynamic bandwidth allocation (DBA) schemes for differentiated services in EPONs. Especially, the average packet delay and the delay jitter of the expedited forwarding (EF) traffic class are compared, with consideration as to whether a cyclic or an interleaved polling scheme is superior. This performance evaluation reveals that the cyclic polling based DBA scheme provides constant and predictable average packet delay and improved jitter performance for the EF traffic class without the influence of load variations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.144-151
• /
• 2002

Future wireless communication systems are expected to provide a broad range of multimedia services in which the asymmetry of traffic load between uplink and downlink is a significant feature. The rode division multiple access system with tune division duplex mode (CDMA/TDD) is a good solution to cope with the traffic asymmetry problem. However. the TDD system is subject to inter-cell interference compared to frequency division duplex (FDD) system. Since both uplink and downlink share the same frequency in TDD. uplink and downlink may interfere each other especially when neighboring cells require different rates of asymmetry. Thus, time slot allocation for tells is an important issue in TDD. In this paper. we propose a genetic algorithm based time slot allocation scheme which maximizes the residual system capacity. The proposed scheme allows that each cell employ different level of uplink/downlink asymmetry and satisfies the interference requirement.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.426-433
• /
• 2002

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.