• Journal of the military operations research society of Korea
• /
• v.2 no.1
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.12
• /
• pp.15-21
• /
• 2004

The Guaranteed Bandwidth Rate scheme has been designed to accomodate non-real-time applications, such as Internet based traffic in Pm networks. The Guaranteed Bandwidth Rate scheme not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this paper, we propose a cell control algorithm which can improve the fairness and the throughput through the traffic control in PM networks. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1099-1107
• /
• 2005

The Guaranteed Frame Rate(GFR) service has been designed to accomodate non-real-time applications, such as TCP/IP based traffic in ATM networks. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this paper, we propose a cell scheduling scheme which can improve the fairness and the goodput through the traffic control in GFR service. For the evaluation of the proposed scheme, we compare the proposed scheme with the existing scheme in the fairness and the goodput. Simulation results show that proposed scheme can improve the fairness and goodput comparing with the existing buffer management scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.1-8
• /
• 2006

Network measurement is a vital part of network traffic engineering. In a network, the metric 'capacity' characterizes the maximum throughput the path can provide when there is no traffic load, or the minimum transmission rate among all links in a path. Pathrate is one of the most widely used network capacity measurement tools nowadays. It's famous for its accurate estimation result and non restriction of the temporal network traffic condition. After several years of development, its performance becomes more stable and reliable. Extant local modes detection algorithm in pathrate is based on statistic methodology histogram. This paper suggests a new algorithm for local modes detection based on ASH (Averaged Shifted Histogram). We have implemented this algorithm and will prove it can accomplish the same task as the original one with a better result.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.1
• /
• pp.49-57
• /
• 2005

ATM Form has defined the guaranteed frame rate (GFR) service to provide minimum cell rate (MCR) guarantees for TCP traffic in ATM networks and allow it to fairly share residual bandwidth. GFR switch implementation consists of the frame-based generic cell rate algorithm (F-GCRA) and a frame forwarding mechanism. The F-GCRA identifies frames that are eligible for an MCR guarantee. The frame forwarding mechanism buffers cells at a frame unit according to information provided by the F-GCRA and forwards the buffered cells to an output port according to its scheduling discipline. A simple GFR mechanism with shared buffer with a global threshold is a feasible implementation mechanism, but has been known that it is insufficient to guarantee the MCR. This paper has estimated performance of GFR service for TCP traffic over ATM switches with the simple FIFO-based mechanism

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.79-83
• /
• 2004

The purpose of ATM traffic management is to protect the network using minimum resources and guarantee the requred QoS and also it is desirable to provide fairness between input channels. In this paper, we propose the TBBM(threshold based buffer management) algorithm to improve fairness between input channels and utilization of ATM networks. TBBM algorithm controls output cell rate dynamically based on threshold. The result shows that the required bandwidth of the TBBM algorithm is 14.3% lower in audio traffic and 41.8% lower in video traffic than that of theoretically calculated equivalent capacity method. and also reveals that the TBBM algorithm provide improved CLR fairness between input channels

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Geomechanics and Engineering
• /
• v.5 no.1
• /
• pp.71-86
• /
• 2013

For rock materials, a transversely isotropic failure criterion established through the extended Lade-Duncan failure criterion incorporating an anisotropic state scalar parameter, which is a joint invariant of deviatoric microstructure fabric tensor and normalized deviatoric stress tensor, is verified with the results of triaxial compressive data on Tournemire shale. For torsional shear mode with $0{\leq}b{\leq}0.75$, rock shear strengths decrease with ${\alpha}$ increasing until the rock shear strength approaches minimum value at ${\alpha}{\approx}40^{\circ}$, and after this point, the rock shear strengths increase as ${\alpha}$ increases further. For the torsional shear mode with b > 0.75, rock shear strengths are almost constant for ${\alpha}{\leq}40^{\circ}$, but it increases with increase in ${\alpha}$ afterwards. The rock shear strength variation against ${\alpha}$ agrees with shear strength changing tendency of heavily OCR natural London Clays tested before. Prediction results show that the transversely isotropic failure criterion proposed in the paper is reasonable.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.799-811
• /
• 2021

This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels (𝛾_w) equal to 35.72 %, 39.09 %, and 36.93 % compared to shortest path first routing and 𝛾_w equal to 29.41 %, 37.35 %, and 27.47 % compared to alternate routing in three different networks.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.2
• /
• pp.167-175
• /
• 2020

In this paper, we propose a traffic accident detection on vehicle-mounted camera. In the proposed method, the minimum bounding box coordinates the central coordinates on the bird's eye view and motion vectors of each vehicle object, and ego-motions of the vehicle equipped with dash-cam are extracted from the dash-cam video. By using extracted 4 kinds features as the input of Bi-LSTM (bidirectional LSTM), the accident probability (score) is predicted. To investigate the effect of each input feature on the probability of an accident, we analyze the performance of the detection the case of using a single feature input and the case of using a combination of features as input, respectively. And in these two cases, different detection models are defined and used. Bi-LSTM is used as a cascade, especially when a combination of the features is used as input. The proposed method shows 76.1% precision and 75.6% recall, which is superior to our previous work.