• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.19-23
• /
• 2008

The AQM (Active Queue Management) starts dropping packets earlier to notify traffic sources about the incipient stage of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), and it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (Queue Variation Adaptive RED) algorithm to respond to bursty traffic more actively. It is possible to provide more smoothness of average queue length and the maximum packet drop probability compared to RED and ARED (Adaptive RED). Therefore, it is highly adaptable to new congestion condition. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This results in shorter end-to-end delay by decreasing the number of retransmitted packets. Also, the QVARED reduces a bias effect over 18% than that of drop-tail method; therefore packets are transmitted stably in the bursty traffic condition.

• Journal of the Korean Society of Industry Convergence
• /
• v.19 no.4
• /
• pp.216-222
• /
• 2016

Thus, this study aimed to develop a gear-type vane damper in order to replace the link-type vane damper. To achieve this goal, the torque generated in a gear-type vane damper was analyzed, and a structural analysis was conducted. In addition, the fluid flow was analyzed according to the changes in the vane's angle, and experimental tests such as a dry-heat test and cold test were conducted considering the operating conditions of the vessels. Moreover, an appropriate actuator was selected for the developed gear-type vane damper, and studies on the reduction in the backlash due to the facing-pressure adjustment length and flow rate and leakage test due to the vane's angle were conducted.

• Journal of Advanced Navigation Technology
• /
• v.12 no.3
• /
• pp.201-207
• /
• 2008

Design rule of optical transmission link consisted of dispersion management (DM) controlling accumulated dispersion in total fiber length by precompensation and postcompensation, and optical phase conjugator (OPC) positioned at mid-way are proposed. DM schemes investigated in this paper are 2 types depending on the position of precompensation and postcompensation; bi-end type and concentration type. It is confirmed that effective residual dispersion ranges, as a design parameter of optical link, of transmission section from transmitter to OPC and transmission section from OPC to receiver are independence on the positions of dispersion compensating fiber (DCF) accomplishing precompensation and postcompensation, if both DCF position is symmetry with respect to OPC.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.275-281
• /
• 2003

Random Early Detection (RED) [1] is an active queue management scheme which has been deployed extensively to reduce packet loss during congestion. Although RED can improve loss rates, its performance depends severely on the tuning of its operating parameters. The idea of adaptively varying RED parameters to suit the network conditions has been investigated in [2], where the maximum packet dropping probability $max_p$ has been varied. This paper focuses on adaptively varying the queue weight $\omega_q$ in conjunction with $max_p$ to improve the performance. We propose two algorithms viz., $\omega_q$-thresh and $\omega_q$-ewma to adaptively vary $\omega_q$. The performance is measured in terms of the packet loss percentage, link utilization and stability of the instantaneous queue length. We demonstrate that varying $\omega_q$ and $max_p$ together results in an overall improvement in loss percentage and queue stability, while maintaining the same link utilization. We also show that $max_p$ has a greater influence on loss percentage and queue stability as compared to $\omega_q$, and that varying $\omega_q$ has a positive influence on link utilization.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.55-61
• /
• 2001

In this paper, a synchronous reverse link DS-CDMA system with cdma2000 standard is simulated to analyze performance of system and to find the optimum power ratio between pilot channel and traffic channel. In the cdma2000 the pilot channel is used to estimate fading channel, in contract to IS-95 and it compensates phase variation of received signal due to channel environment. When the length of channel estimation is 31pcg symbols, we can find the optimum power ratio of pilot channel to traffic channel. And also we find Eb/No satisfying target FER when the power control is applied and analyze performance of system with multiuser transmission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.2
• /
• pp.20-29
• /
• 2022

This study intends to present a traffic node-based and link-based accident prediction models using XGBoost which is very excellent in performance among machine learning models, and to develop those models with sustainability and scalability. Also, we intend to present those models which predict the number of annual traffic accidents based on road types, weather conditions, and traffic information using XGBoost. To this end, data sets were constructed by collecting and preprocessing traffic accident information, road information, weather information, and traffic information. The SHAP method was used to identify the variables affecting the number of traffic accidents. The five main variables of the traffic node-based accident prediction model were snow cover, precipitation, the number of entering lanes and connected links, and slow speed. Otherwise, those of the traffic link-based accident prediction model were snow cover, precipitation, the number of lanes, road length, and slow speed. As the evaluation results of those models, the RMSE values of those models were each 0.2035 and 0.2107. In this study, only data from Sejong City were used to our models, but ours can be applied to all regions where traffic nodes and links are constructed. Therefore, our prediction models can be extended to a wider range.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.12
• /
• pp.3310-3329
• /
• 2023

This work designs an eighteen-channel bidirectional Intensity Modulation with Direct Detection (IM/DD) Wavelength Division Multiplexing-Passive Optical Network (WDM-PON) system. The proposed system meets the requirement of the ITU-T 5G fronthaul link suggested design in G-series Recommendations-Supplement 66. The newly designed system, with a 25Gb/s/λ data rate (450Gbps as a system capacity), has been tested and simulated using OptiSystem V.19 software. The system has been evaluated by the BER with respect to variable the optical span and CW laser power. Based on the ITU-T recommendations, the simulation results demonstrate that this system might be used as an F1 and as an Fx 5G fronthaul link for functional split choices starting from options 1 to 7a. These options are required under 25Gbps/λ for each upstream and downstream link direction. Furthermore, the proposed system utilized a bidirectional single-mode optical fiber within short optical spans of up to 10 km. The proposed system is characterized by a low-cost, simple, DSP-free and amplifier-free system with a reasonable system capacity.