• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.29-38
• /
• 2018

This study aims to propose a method for the estimation of operational delay cost using transportation card data in bus accidents. Average operational delay time from bus accidents was surveyed among 12 bus companies through an interview method. Then, the operational delay cost was estimated using actual traffic accident data and transportation card data. Results showed that average loss time per bus accident was found to be 45 minutes. In addition, total occupancy of 659 was estimated for the accidents investigated using transportation card data, resulting a total loss time of 494.25 hours. An estimated operational delay cost was 186.9 thousand won per accident, which was 6.37% of social agency cost. The magnitude of this number implied that operational delay cost may have a significant impact on traffic accident cost if included.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.750-753
• /
• 2000

본 연구에서는 정적시간하에서 다품종을 생산하는 다수의 공장과 수요지가 있을 때, 각 공장의 생산량과 각 수요지로의 수송단위의 수를 결정하는 문제에서 납기지연비용 및 수송비용을 최소화하는 수송량을 결정하는 새로운 수리 최적화모형을 제안한다. 이 모형에서는 기존과는 달리 제품수송단위별 비용을 적용하고, 또한 납기지연에 따른 벌칙비용을 고려함으로써 보다 실제적인 응용이 가능토록 하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• Proceedings of the Safety Management and Science Conference
• /
• 2005.11a
• /
• pp.511-515
• /
• 2005

기업은 고객이 원하는 시기에 원하는 제품을 구매할 수 있도록 항상 준비가 되어 있어야 한다. 고객의 수요를 만족시키기 위하여 기업은 다양한 수요예측방법을 통하여 적절한 재고 수준과 수요예측을 하고 있다. 제조 기업의 경우에는 다른 산업에 비하여 정확한 수요예측과 낮은 재고 수준의 유지가 비용과 직접적인 연관이 있기 때문에 제조 기업은 경제적인 주문량 결정(Economic Order Quantity: EOQ)이 매우 중요한 문제이다. 주문량을 결정하는 방법에는 여러 가지가 있지만, 본 논문에서는 고객 지연을 방지하기 위하여 경제적 주문량 결정에 고객 지연과 관련된 비용을 포함시키는 것은 물론 고객 지연이라는 상황을 방지하는 노력의 한 방법으로 가격 할인(discount system)을 이용하고자 한다. 가격 할인을 이용하여 고객으로 하여금 빠른 주문을 유도하고 그로 인하여 고객 지연 상황의 발생을 줄여보려고 한다.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.397-404
• /
• 2002

We propose a heuristic distributed unicast routing algorithm for minimizing the total cost of the path in a point to point network with do]ay constraint. The algorithm maintains a delay vector and a cost vector about the network states and finds the path using this information. In this paper, we show that our algorithm always finds a delay-constrained path if such a path exists and has O(│E│) message complexity(│E│is the number of links in the network). Also, simulation results show that the proposed algorithm has better cost performance than other delay-constrained routing algorithms.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.263-268
• /
• 2004

The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2001.12a
• /
• pp.37-47
• /
• 2001

분산형 공급체인(Supply Chain) 시스템에서 각 기업체의 주문처리 과정에서의 지연은 시스템에게 많은 비용을 발생시키게 된다. 이러한 물질과 정보의 흐름을 효과적으로 관리하는 것이 바로 공급체인관리(SCM: Supply Chain Management)의 기본적인 목적이다. 또한, 항시 존재하는 정보의 지연이 공급체인 내의 여러 기업에 주는 영향이나 SCM에 미치는 효과는 매우 크다. 소매업, 도매업, 물류센터, 제조공장 등으로 이어지는 공급체인에서 정보시스템의 개선 등으로 주문처리 과정이 단축되면 분산형 시스템에서 각 디비젼의 재고량과 비용 면에서 얼마만큼의 변화가 있는지는 연구해 볼 필요가 있다. 이 논문에서는 공급체인 전체를 하나의 통합된 개체로 보고 이를 최적화하고자 하는 경영 방식인 SCM(Supply Chain Management)에서 기업들의 재고변화와 비용 면에서 주문처리 지체가 얼마만큼의 영향이 있는지 알아보며, 두 가지의 정보지연 개선 방안을 가지고 시나리오를 설정하여 30주의 고객 수요를 가지고 실험분석을 한다. 그것을 통해서 SCM(Supply Chain Management)의 비용최소화 전략 수립에 밑바탕이 되는 대안들을 연구결과로 제안한다.