• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• Structural Engineering and Mechanics
• /
• v.65 no.5
• /
• pp.535-546
• /
• 2018

The objective of this study is to understand the behaviour of hollow core slabs strengthened with FRP and hybrid techniques through numerical and analytical studies. Different strengthening techniques considered in this study are (i) External Bonding (EB) of Carbon Fiber Reinforced Polymer (CFRP) laminates, (ii) Near Surface Mounting (NSM) of CFRP laminates, (iii) Bonded Overlay (BO) using concrete layer, and (iv) hybrid strengthening which is a combination of bonded overlay and NSM or EB. In the numerical studies, three-dimensional Finite Element (FE) models of hollow core slabs were developed considering material and geometrical nonlinearities, and a phased nonlinear analysis was carried out. The analytical calculations were carried out using Response-2000 program which is based on Modified Compression Field Theory (MCFT). Both the numerical and analytical models predicted the behaviour in agreement with experimental results. Parametric studies indicated that increase in the bonded overlay thickness increases the peak load capacity without reducing the displacement ductility. The increase in FRP strengthening ratio increased the capacity but reduced the displacement ductility. The hybrid strengthening technique was found to increase the capacity of the hollow core slabs by more than 100% without compromise in ductility when compared to their individual strengthening schemes.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.131-136
• /
• 2013

Multi-core processors can improve parallelism of application processes and thus can enhance the system throughput. Researchers have recently revealed that the processor affinity is an important factor to determine network I/O performance due to architectural characteristics of multi-core processors; thus, many researchers are trying to suggest a scheme to decide an optimal processor affinity. Existing schemes to dynamically decide the processor affinity are able to transparently adapt for system changes, such as modifications of application and upgrades of hardware, but these have limited access to characteristics of application behavior and run-time information that can be collected heuristically. Thus, these can provide only sub-optimal processor affinity. In this paper, we define meaningful system variables for determining optimal processor affinity and suggest a tool to gather such information. We show that the implemented tool can overcome limitations of existing schemes and can improve network bandwidth.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3A
• /
• pp.281-289
• /
• 2009

Wireless relay attracts great attention as a core technology of next generation wireless communication systems since it enables reliable communications and extends cell coverage by supporting shadowed users. In this paper, we Propose transmit power and subcarrier allocation scheme for downlink OFDM systems with multiple decode and forward (DF) relays to increase data rate with fixed bit error rate (BER) and sum power constraint. In simulation results, average data rate based on the proposed schemes are evaluated and compared to that of the other schemes. It is also shown that the performance loss of the proposed scheme is negligible compared to the optimal scheme, while its computational complexity is reduced considerably.

• Steel and Composite Structures
• /
• v.13 no.5
• /
• pp.451-471
• /
• 2012

Concrete filled steel tube (CFST) structures have been used widely in high-rise buildings and bridges due to the efficiency of structurally favourable interaction between the steel tube and the concrete core. In the current design codes only one loading condition in the column members is considered, i.e., the load is applied on the steel tube and concrete core at the same time. However, in engineering practice the tube structures may be subjected to various loading conditions such as loading on the concrete core only, preloading on the steel tube skeleton before filling of concrete core, and so on. In this research, a series of comparative experiments were carried out to study the structural performance of concrete filled circular steel tube columns subject to four concentric loading schemes. Then, a generalized prediction method is developed to evaluate the ultimate load capacity of CFST columns subject to various loading conditions. It is shown that the predictions by the proposed method agree well with test results.

• The Journal of the Korea Contents Association
• /
• v.2 no.2
• /
• pp.85-90
• /
• 2002

This paper presents tuo implementation models for wireless service operators to offer Mobile-IP over IMT-2000 Data service under IMT-2000 network by taking advantage of the existing infrastructure for IMT-2000 services. For this purpose, a new Mobile-IP over IMT-2000-based protocol architectures are introduced and service operation schemes and handoff schemes according to various scenarios of packet data services in the IMT-2000 core network are presented. Also, this paper describes the handoff scheme in terms of channel states.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.223-226
• /
• 2003

In this paper, we propose new agent discovery and route discovery schemes to support Mobile IP (MIP) in Ad Hoc networks with wireless backbone. The wireless backbone consisting of stationary wireless routers and Internet gateways (IGs) is a kind of wireless access network of IP-based core network. The proposed scheme utilizes favorable features of wireless backbone such as stable links and no energy constraints. In the agent discovery scheme, backbone-limited periodic Agent Advertisement (AA) and proxy-AA messages are used, which reduce network-wide broadcasting overhead caused by AA and Agent Solicitation messages and decentralize MIP processing overhead in IGs. In order to reduce delay time and control message overhead during route discovery far the destination outside Ad Hoc network, we propose a cache-based scheme which can be easily added to the conventional on-demand routing protocols. The proposed schemes can reduce control overhead during agent discovery and route discovery, and efficiently support MIP in Ad Hoc network with wireless backbone.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1211-1217
• /
• 2019

Developing methods to search over an encrypted database (EDB) have received a lot of attention in the last few years. Among them, order-revealing encryption (OREnc) and order-preserving encryption (OPEnc) are the core parts in the case of range queries. Recently, some ideally-secure OPEnc schemes whose ciphertexts reveal no additional information beyond the order of the underlying plaintexts have been proposed. However, these schemes either require a large round complexity or a large persistent client-side storage of size O(n) where n denotes the number of encrypted items stored in EDB. In this work, we propose a new construction of an efficient OPEnc scheme based on an OREnc scheme. Security of our construction inherits the security of the underlying OREnc scheme. Moreover, we also show that the construction of a non-interactive ideally-secure OPEnc scheme with a constant client-side storage is theoretically possible from our construction.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.274-285
• /
• 2022

Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2022

Galois field arithmetic is important in error correcting codes and public-key cryptography schemes. Hardware realization of these schemes requires an efficient implementation of Galois field arithmetic operations. Multiplication is the main finite field operation and designing efficient multiplier can clearly affect the performance of compute-intensive applications. Diverse algorithms and hardware architectures are presented in the literature for hardware realization of Galois field multiplication to acquire a reduction in time and area. This paper presents a low complexity semi-systolic multiplier to facilitate parallel processing by partitioning Montgomery modular multiplication (MMM) into two independent and identical units and two-level systolic computation scheme. Analytical results indicate that the proposed multiplier achieves lower area-time (AT) complexity compared to related multipliers. Moreover, the proposed method has regularity, concurrency, and modularity, and thus is well suited for VLSI implementation. It can be applied as a core circuit for multiplication and division/exponentiation.