• Title/Summary/Keyword: Path cost evaluation

Search Result 64, Processing Time 0.024 seconds

Virtual Network Embedding based on Node Connectivity Awareness and Path Integration Evaluation

  • Zhao, Zhiyuan;Meng, Xiangru;Su, Yuze;Li, Zhentao
    • 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.

Propagation Path-Loss Model for TV White Space of Korea

  • Lee, Seungyoun;Lee, JungHoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.116-121
    • /
    • 2020
  • With the recent development of the 4th Industrial Revolution, efforts have been made to carry out communication in a smart factory, farm, etc. at low cost and reliably. Methods for utilizing empty frequencies using TVWS(TV White Space) have been studied which can be used locally within 30 km. However, there have not been many studies on Path-Loss model considering Korean environment. In this paper, the Path-Loss model is divided into LOS (Line Of Sight) and NLOS (None LOS). In case of LOS model, we checked the difference between Free space model, Friis model, 2-ray model and Hata model with measured data. In the case of NLOS model, we checked the difference between Lee Model, ITU-R526-3 Model with measured data. In order to overcome the difference in Korean environment, we derived a model that can be applied in LOS and NLOS and prove its usefulness through performance evaluation through simulation.

Optimal Seam-line Determination for the Image Mosaicking Using the Adaptive Cost Transform (적응 정합 값 변환을 이용한 영상 모자이크 과정에서의 최적 Seam-Line 결정)

  • CHON Jaechoon;KIM Hyongsuk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.3
    • /
    • pp.148-155
    • /
    • 2005
  • A seam-line determination algorithm is proposed to determine image border-line in mosaicing using the transformation of gray value differences and dynamic programming. Since visually good border-line is the one along which pixel differences are as small as possible, it can be determined in association with an optimal path finding algorithm. A well-known effective optimal path finding algorithm is the Dynamic Programming (DP). Direct application of the dynamic programming to the seam-line determination causes the distance effect, in which seam-line is affected by its length as well as the gray value difference. In this paper, an adaptive cost transform algorithm with which the distance effect is suppressed is proposed in order to utilize the dynamic programming on the transformed pixel difference space. Also, a figure of merit which is the summation of fixed number of the biggest pixel difference on the seam-line (SFBPD) is suggested as an evaluation measure of seamlines. The performance of the proposed algorithm has been tested in both quantitively and visually on various kinds of images.

Cost-Efficient Framework for Mobile Video Streaming using Multi-Path TCP

  • Lim, Yeon-sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1249-1265
    • /
    • 2022
  • Video streaming has become one of the most popular applications for mobile devices. The network bandwidth required for video streaming continues to exponentially increase as video quality increases and the user base grows. Multi-Path TCP (MPTCP), which allows devices to communicate simultaneously through multiple network interfaces, is one of the solutions for providing robust and reliable streaming of such high-definition video. However, mobile video streaming over MPTCP raises new concerns, e.g., power consumption and cellular data usage, since mobile device resources are constrained, and users prefer to minimize such costs. In this work, we propose a mobile video streaming framework over MPTCP (mDASH) to reduce the costs of energy and cellular data usage while preserving feasible streaming quality. Our evaluation results show that by utilizing knowledge about video behavior, mDASH can reduce energy consumption by up to around 20%, and cellular usage by 15% points, with minimal quality degradation.

Motion planning of a steam generator mobile tube-inspection robot

  • Xu, Biying;Li, Ge;Zhang, Kuan;Cai, Hegao;Zhao, Jie;Fan, Jizhuang
    • Nuclear Engineering and Technology
    • /
    • v.54 no.4
    • /
    • pp.1374-1381
    • /
    • 2022
  • Under the influence of nuclear radiation, the reliability of steam generators (SGs) is an important factor in the efficiency and safety of nuclear power plant (NPP) reactors. Motion planning that remotely manipulates an SG mobile tube-inspection robot to inspect SG heat transfer tubes is the mainstream trend of NPP robot development. To achieve motion planning, conditional traversal is usually used for base position optimization, and then the A* algorithm is used for path planning. However, the proposed approach requires considerable processing time and has a single expansion during path planning and plan paths with many turns, which decreases the working speed of the robot. Therefore, to reduce the calculation time and improve the efficiency of motion planning, modifications such as the matrix method, improved parent node, turning cost, and improved expanded node were proposed in this study. We also present a comprehensive evaluation index to evaluate the performance of the improved algorithm. We validated the efficiency of the proposed method by planning on a tube sheet with square-type tube arrays and experimenting with Model SG.

Route Optimization Algorithm Based on Game Theory for Tourism Routes at Pseudo-Imperial Palace

  • Liu, Guangjie;Zhu, Jinlong;Sun, Qiucheng;Hu, Jiaze;Yu, Hao
    • Journal of Information Processing Systems
    • /
    • v.17 no.5
    • /
    • pp.879-891
    • /
    • 2021
  • With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.

A study on a schedule-cost analysis model for defense R&D project planning (국방 R&D프로젝트의 일정-비용분석모델의 연구)

  • 황홍석;류정철;정덕길
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.213-216
    • /
    • 1996
  • R'||'&'||'D project management is a process of decisions concerned with the achievement of goals of objectives. Especially, defense R'||'&'||'D project planning is the key in the successfull management of defense development. The defense project managers are constantly having to perform "what if\ulcorner" exercise, such as what if the project is extended out for an additional cost\ulcorner In this reserch, we developed a schedule-cost analysis model based upon Critical Path Method(CPM) and Venture Evaluation and Review Technique(VERT) for schedule-cost trade off analysis defense R'||'&'||'D projects. In the first step, a deterministic model is developed as a heuristic which deterministic model is developed as a heuristic which determines the schedule extension and reduction cost as a function desired schedule. In the second step, a stochastic network simulation model is developed to analyse the project risk (sucess and failure). The expected time and cost can be determined for desired schedule under the assumptions of stochastic arc data (time and cost) with a various precedence relationships. This model provides the defense R'||'&'||'D managers with an estimated and expected cost for curtailing or extending a project a given amount of time. The effectiveness and efficiency of the proposed methods, a heuristic and stochastic networks simulations, have been demonstrated through examples.

  • PDF

Effectiveness of a Clinical Pathway for Breast Cancer Patients Undergoing Surgical Operation on Clinical Outcomes and Costs

  • Jeong Hyun Park;Danbee Kang;Seok Jin Nam;Jeong Eon Lee;Seok Won Kim;Jonghan Yu;Byung Joo Chae;Se Kyung Lee;Jai Min Ryu;Yeon Hee Park;Mangyeong Lee;Juhee Cho
    • Quality Improvement in Health Care
    • /
    • v.30 no.1
    • /
    • pp.120-131
    • /
    • 2024
  • Purpose: This study aimed to evaluate the impact of implementing a clinical pathways (CPs) on the clinical outcomes and costs of patients undergoing breast cancer surgery. Methods: This retrospective cohort study included patients who were newly diagnosed with primary breast cancer at the Samsung Medical Center between 2014 and 2019 (N=8482; 2931 patients in the pre-path and 5551 patients in the post-path). Clinical outcomes included reoperation during hospitalization, readmission, and emergency room visits within 30 days of discharge. The cost data for each unit were obtained from an activity-based management accounting system. We performed an interrupted time series analysis. Results: The post-path period showed a significantly shorter hospital length of stay (LOS) than the pre-path period (6.3 days in pre-path vs. 5.0 days in post-path; -1.3 days' difference; p=.001), and fewer reoperations during hospitalization and within 30 days after discharge than the pre-path period. After adjusting for inflation rates and relative value scores, the model demonstrated savings of $146 per patient in the post-path for total costs, and $537 per patient for patient out-of-pocket costs (p=.001). Conclusion: CPs can help reduce costs without compromising the quality of care by reducing the number of reoperations, readmissions, and complications.

A Fault-Tolerant QoS Routing Scheme based on Interference Awareness for Wireless Sensor Networks (무선 센서 네트워크를 위한 간섭 인지 기반의 결함 허용 QoS 라우팅 기법)

  • Kim, Hyun-Tae;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.2
    • /
    • pp.148-153
    • /
    • 2012
  • In this paper, we propose a fault-tolerant QoS routing scheme based on interference awareness for providing both high throughput and minimum end-to-end delay for wireless sensor networks. With the proposed algorithm, it is feasible to find out the optimal transmission path between sensor nodes to the sink node by using cumulative path metric where real-time delivery, high energy efficiency and less interference are considered as in path selection. Finally, simulation results show that network throughput and delay can be improved by using the proposed routing scheme.

EVALUATION OF VEHICLE DYNAMIC CONTROL FOR ROLOVER PREVENTION

  • Ungoren, A.Y.;Peng, H.
    • International Journal of Automotive Technology
    • /
    • v.5 no.2
    • /
    • pp.115-122
    • /
    • 2004
  • Evaluation of active safety control systems usually relies heavily on field testing and is time-consuming and costly. Advances in computer simulations make it possible to perform exhaustive design trials and evaluations before field testing, and promise to dramatically reduce development cost and cycle time. In this paper, a comprehensive simulation-based evaluation procedure is proposed, which combines standard evaluation maneuvers, worst-case techniques, and a driver model for closed-loop path following evaluations. A vehicle dynamic controller (VDC) for a popular Sport Utility Vehicle is evaluated using the proposed procedure. Simulation results show that the proposed procedure can be used to assess the performance of the VDC under various conditions and provides valuable information for the re-design of the VDC.