• Title/Summary/Keyword: Path Management

Search Result 1,696, Processing Time 0.031 seconds

Methodology of Resilient Dynamic Path Management in GMPLS Network under Multiple Link Failures (GMPLS 네트워크에서 다중 경로 장애 발생시 Resilience를 만족하는 동적 경로 관리 방법)

  • Park Jong-Tae;Lee Wee-Hyuk;Kwon Jung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.397-404
    • /
    • 2006
  • As an increase in recent optical network-based IP services, GMPLS management framework becomes more important than ever before. In this paper, we propose the dynamic GMPLS path management algorithm, which can satisfy the users with their traffic engineering recovery requirements and find out the best backup service path under multiple link failures. To be more specific, we are deriving the soluble conditions of a backup path which is satisfied in a GMPLS network. In addition, through proposing the fast backup path selection algorithm, we can sufficiently satisfy a user's recovery requirement and minimally protect the suspension of the service against a link failure.

Application of a PERT-Type System on Work Management in Home-Delivered Meals Service Program for Elderly (가정배달 노인급식서비스 작업공정관리 모형개발을 위한 PERT-Type System의 적용)

  • 양일선;채인숙;유일근
    • Journal of Nutrition and Health
    • /
    • v.34 no.6
    • /
    • pp.701-714
    • /
    • 2001
  • The purpose of this study was to apply a PERT-type system, a combination of the project evaluation and review technique(PERT) and critical path method(CPM) on the employees' work time management of flood preparation, assembly, transportation and cleaning in home-delivered meals program for elderly The resources allotment heuristic program was developed by considering the number of employees and cooking utilities, being limited resources of home- delivered meals program. This program could assign the employees to perform the works included in flood preparation, assembly, transportation ind cleaning. Critical path and activities ware identified by PERT-type system on the basic of work time investigation in five senior centers. Work sheets were invented to perform the work by the shortest path with flexible employees'maximum flow As a result of the work time investigation, the most prevalent activities were ones of preparation in center C and E. Besides, the preparation(over fifty percent) was the most proportion among flood preparation, assembly, transportation and cleaning in center C and E. Critical path and activities of 'C'center were cucumber in sauce preparation path and assembly, wrapping in assembly path and case delivery in transportation path. Critical path and activities of 'E'center were Pan-fried Potato Preparation Path and assembly, case covering, wrapping in assembly Path. The work sheet invented by the heuristic program and PERT-type system reduced the work completion time and man hours in both centers.

  • PDF

Adaptive Reversal Tree Protocol with Optimal Path for Dynamic Sensor Networks

  • Hwang, Kwang-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.1004-1014
    • /
    • 2007
  • In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

Patient Safety Management Activities of Korean Nurses: A Meta-Analytic Path Analysis (국내 간호사의 환자안전관리활동에 대한 메타경로분석)

  • Jeong, Seohee;Jeong, Seok Hee
    • Journal of Korean Academy of Nursing
    • /
    • v.52 no.4
    • /
    • pp.363-377
    • /
    • 2022
  • Purpose: This study aimed to test a hypothetical model of Korean nurses' patient safety management activities using meta-analytic path analysis. Methods: A systematic review, meta-analysis, and meta-analytic path analysis were conducted following the PRISMA and MOOSE guidelines. Seventy-four studies for the meta-analysis and 92 for the meta-analytic path analysis were included. The R software program (Version 3.6.3) was used for data analysis. Results: Four variables out of 49 relevant variables were selected in the meta-analysis. These four variables showed large effect sizes (ESr = .54) or median effect sizes (ESr = .33~.40) with the highest k (number of studies) in the individual, job, and organizational categories. The hypothetical model for the meta-analytic path analysis was established using these variables and patient safety management activities. Twelve hypothetical paths were set and tested. Finally, the perception of the importance of patient safety management and patient safety competency directly affected patient safety management activities. In addition, self-efficacy, the perception of the importance of patient safety management, patient safety competency, and patient safety culture, indirectly affected patient safety management activities. Conclusion: Self-efficacy, the perception of the importance of patient safety management, patient safety competency, and the organization's patient safety culture should be enhanced to improve nurses' patient safety management activities.

A Study of Path Management to Efficient Traceback Technique for MANET (MANET에서 효율적 역추적을 위한 경로관리에 관한 연구)

  • Yang, Hwan Seok;Yang, Jeong Mo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.31-37
    • /
    • 2011
  • Recently, MANET(Mobile Ad-hoc Network) is developing increasingly in the wireless network. MANET has weakness because phases change frequently and MANET doesn't have middle management system. Every node which consists of MANET has to perform data forwarding, but traceback is not reliable if these nodes do malicious action owing to attack. It also is not easy to find location of attacker when it is attacked as moving of nodes. In this paper, we propose a hierarchical-based traceback method that reduce waste of memory and can manage path information efficiently. In order to manage trace path information and reduce using resource in the cluster head after network is formed to cluster, method which recomposes the path efficiently is proposed. Proposed method in this paper can reduce path trace failure rate remarkably due to moving of nodes. It can also reduce the cost for traceback and time it takes to collect information.

A Design of Architecture for Federating between NRNs and Determination Optimal Path

  • Park, Jinhyung;Cho, Hyunhun;Lee, Wonhyuk;Kim, Seunghae;Yun, Byoung-Ju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.678-690
    • /
    • 2014
  • The current networks do not disclose information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to calculate an optimal path to the destination. Also, due to poor information sharing, if an error occurs in the intermediate path, it is very difficult to re-search the path and find the best path. Hence, to manage each domain more efficiently, an architecture with top-level path computation node which can obtain information of separate nodes are highly needed This study aims to investigate a federation of a united network around NRN(National Research Network) that could allow resource sharing between countries and also independent resource management for each country. Considering first the aspects that can be accessed from the perspective of a national research network, ICE(Information Control Element) and GFO(Global Federation Organizer)-based architecture is designed as a top-level path computation element to support traffic engineering and applied to the multi-domain network. Then, the federation for the independent management of resources and resource information sharing among national research networks have been examined.

A Study on a New Algorithm for K Shortest Detour Path Problem in a Directed Network (유방향의 복수 최단 우회 경로 새로운 해법 연구)

  • Chang, Byung-Man
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.60-66
    • /
    • 2006
  • This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

  • PDF

Path Analysis and SERVQUAL for Knowledge Quality Improvement (지식정보 품질향상을 위한 경로 분석 및 SERVQUAL)

  • 박정훈;손소영
    • Journal of Korean Society for Quality Management
    • /
    • v.28 no.3
    • /
    • pp.145-154
    • /
    • 2000
  • Effective management of knowledge is essential to keep up with demands of this challenging information age. The first step for this kind of management would be to define indicators to evaluate the quality of knowledge. In this paper, we use five latent variables (intrinsic quality, representational quality, ease of use of quality, maintainable quality, usage of quality) as basis for a preliminary path analysis for knowledge management. Preliminary study results showed that high intrinsic quality does not necessarily guarantee high frequency of use. A modified questionnaire is made and is used for SERVQUAL. The result of SERVQUAL shows that customers are not relatively happy about both intrinsic quality and its ease of use. Additional path analyses are done for both expected and observed quality indicators. The path model based on the expectation indicated that the presentation method of knowledge would induce its easy maintenance while that based on observation did not back up the same phenomenon.

  • PDF

A Selection of Path Planning Algorithm to Maximize Survivability for Unmanned Aerial Vehicle (무인 항공기 생존성 극대화를 위한 이동 경로 계획 알고리즘 선정)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • Journal of the Korea Safety Management & Science
    • /
    • v.13 no.2
    • /
    • pp.103-113
    • /
    • 2011
  • This research is to select a path planning algorithm to maximize survivability for Unmanned Aerial Vehicle(UAV). An UAV is a powered pilotless aircraft, which is controlled remotely or autonomously. UAVs are currently employed in many military missions(surveillance, reconnaissance, communication relay, targeting, strike etc.) and a number of civilian applications(communication service, broadcast service, traffic control support, monitoring, measurement etc.). In this research, a mathematical programming model is suggested by using MRPP(Most Reliable Path Problem) and verified by using ILOG CPLEX. A path planning algorithm for UAV is selected by comparing of SPP(Shortest Path Problem) algorithms which transfer MRPP into SPP.