• Title/Summary/Keyword: Link-22

Search Result 322, Processing Time 0.021 seconds

Multi-layer restoration strategy to restore the multi-link and node failures in DCS mesh networks (DCS mesh 네트워크에서 다중 선로 장애와 노드 장애를 복구하기 위한 다중 계층 복구 전략)

  • 김호진;조규섭;이원문
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2744-2754
    • /
    • 1997
  • Recently, the Multi-Layer Restoration(MLR) algorithm was proposed by British Telecom(BT) to restore the network failures in Digital Cross-connect System(DCS) mesh survival network[1, 2]. This algorithm has multi restoration stage which is composed of the pre-planned and dynamic restoration. This algorithm is effective its ability in link or node failures. This reason is that it does not restore in the pre-planned rstoration stage but in dynamic restoration stage. In this paper, we propose the MLR with pre-planned Multi-Chooser(PMC) and successive restoration ratio algorithm. This proposed algorithm has a excellent performance for restortion time and ratio, spare channel availability and fast restoration from multiple link failure or node failure. This paper proposed the modeling and restoration algorithm, and analyzed the performance of the algorithm by simulation using OPNET(OPtimized Network Engineering Tools).

  • PDF

Performance Evaluation of Service-Aware Optical Transport System

  • Youn, Ji-Wook;Yu, Jea-Hoon;Yoo, Tae-Whan
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.241-247
    • /
    • 2010
  • We propose and experimentally demonstrate a service-aware optical transport system. The proposed service-aware optical transport system makes a flow based on service type and priority of traffic. The generated flow is mapped to a corresponding sub-${\lambda}$ for transport over an optical network. Using sub-${\lambda}$ provided by the centralized control plane, we could effectively provide quality-of-service guaranteed Ethernet service and best-effort service simultaneously in a single link. The committed information rate (CIR) traffic and best-effort traffic are assigned to different sub-${\lambda}s$. The bandwidth of the CIR traffic is guaranteed without being affected by violation traffic because the bandwidth is managed per each sub-${\lambda}$. The failure detection time and restoration time from a link failure is measured to be about 60 ${\mu}s$ and 22 ms, respectively, in the ring network. The measured restoration time is much smaller than the 50 ms industry requirement for real-time services. The fast restoration time allows the proposed service-aware optical transport system to offer high availability and reliability which is a requirement for transport networks.

A Study on Indirect Adaptive Decentralized Learning Control of the Vertical Multiple Dynamic System (수직다물체시스템의 간접적응형 분산학습제어에 관한 연구)

  • Lee Soo Cheol;Park Seok Sun;Lee Jae Won
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.22 no.4
    • /
    • pp.92-98
    • /
    • 2005
  • The learning control develops controllers that learn to improve their performance at executing a given task, based on experience performing this specific task. In a previous work, the authors presented an iterative precision of linear decentralized learning control based on p-integrated learning method for the vertical dynamic multiple systems. This paper develops an indirect decentralized teaming control based on adaptive control method. The original motivation of the teaming control field was loaming in robots doing repetitive tasks such as on an assembly line. This paper starts with decentralized discrete time systems, and progresses to the robot application, modeling the robot as a time varying linear system in the neighborhood of the nominal trajectory, and using the usual robot controllers that are decentralized, treating each link as if it is independent of any coupling with other links. Some techniques will show up in the numerical simulation for vertical dynamic robot. The methods of learning system are shown up for the iterative precision of each link.

A study on the Reliability Experiment and the Structural Improvement of Sliding Cover (슬라이딩 커버의 신뢰성 시험 및 구조개선 연구)

  • Song Jun Yeob;Kang Jae Hun;Kim Tae Hyung;Kim Ok Koo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.22 no.7 s.172
    • /
    • pp.146-154
    • /
    • 2005
  • Recently, the high-speed and intelligence technology of machine tools are developed for the high efficiency of productivity Under the operating condition from the high-speed of machine tools, the various failure modes can occur in core units of manufacturing system. Therefore it is for the reliability concept of machine tool to be required in a design level. And the above-stated technology must be accommodated in the feeding and spindle subsystem, etc those are the core units of machine tools. In this study, we are developed the test-bed of sliding cover (C-plate) in order to evaluating reliability and estimating failure modes of feeding subsystem under operating conditions. The reliability experiment using the developed test-bed and the additional structural analysis executed on single and double structure. We found out the weak parts of sliding cover and were able to predict a life cycle from the experiment results. In this study, we propose the new C-plate model with double link structure to apply the high-speed machine tool in the fundamental guideline.

Kinematic Parameter Optimization of Jumping Robot Using Energy Conversion of Elastic Body (탄성체의 에너지 변환을 이용한 점프 로봇의 기구변수 최적화)

  • Choi, JaeNeung;Lee, Sangho;Jeong, Kyungmin;Seo, TaeWon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.1
    • /
    • pp.53-58
    • /
    • 2016
  • Various jumping robot platforms have been developed to carry out missions such as rescues, explorations, or inspections of dangerous environments. We suggested a jumping robot platform using energy conversion of the elastic body like the bar of a pole vault, which is the main part in which elastic force occurs. The compliant link was optimized by an optimization method based on Taguchi methodology, and the robot's leaping ability was improved. Among the parameters, the length, width, and thickness of the link were selected as design variables first while the others were fixed. The level of the design variables was settled, and an orthogonal array about its combination was made. In the experiment, dynamic simulations were conducted using the DAFUL program, and response table and sensitivity analyses were performed. We found optimized values through a level average analysis and sensitivity analysis. As a result, the maximum leaping height of the optimized robot increased by more than 6.2% compared to the initial one, and these data will be used to design a new robot.

Development of a Packet-Switched Public computer Communication Network -PART 1: KORNET Overview and Development of Network Management Center (Packet Switching에 의한 공중 Computer 통신망 개발 연구 -제1부: Kornet 개요 및 NMC 개발)

  • 은종관;이경근
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.6
    • /
    • pp.103-113
    • /
    • 1985
  • This is the first part of the four-part paper describing the development of a packet-switched computer network named the KORNET In this paper, we present the overview of the KORNET, and discuss various aspects on the development of the netwo management center (NMC). The NMC acts as a nerve center of the network, performing such functions as network monitoring, subscriber and network management and routing manage-ment using operator dialogues. In the implementation of the NMC, we have developed various application softwares that include operator interface, primary/srcondary pan, session layer and packet level adaptor. As for packet, link and physical level protocols, we have modified the XODIAC X.25 originally developed by Data General, Inc. All the net-work protocols we have developed comply completely with the CCITT recommendations.

  • PDF

Performance analysis of a MC-CDMA cellular system with antenna arrays in a fading channel (페이딩 채널 환경에서 안테나 어래이를 갖는 MC-CDMA 셀룰라 시스템의 성능 분석)

  • 김찬규;조용수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2686-2695
    • /
    • 1997
  • The MC-CDMA(multi-carrier code division multiple access) technique is known to be appropriate for high data-rate wireless communications such as mobile multimedia communication due to its robustness to multipath fading and its capability of handing high data rates with a simple one-tap equalizer. In this paepr, the performance of a MC-CDMA cellular system employing antenna arrays at the based station in a fading channel is presented. It is whown that the interference from other users within the cell can be significantly reduced for both reverse link (mobile to base station) and forward link (base station to mobile) using a MC-CDMA with antenna arrays, thus incresig the system's user-capacity. Computer simulations that demonstrate user-capacity improvement of the proposed approach are discussed.

  • PDF

"Leisure Life Satisfaction:" Will It Have a Beneficial Impact on Depression Among Older Adults in Community Care Settings in Korea?

  • Kim, Il-Ho;Kim, Cheong-Seok
    • Journal of Preventive Medicine and Public Health
    • /
    • v.55 no.4
    • /
    • pp.398-406
    • /
    • 2022
  • Objectives: While the risk of depression is expected to substantially increase among older adults receiving community care, leisure life satisfaction can be regarded as a key component in enhancing the mental health of those receiving community care. However, it is not yet known whether community care utilization increases the risk of depression, or what role is played by leisure life satisfaction in these settings. This study investigated the relationship between community care utilization and depression, as well as the main effect and the moderating role of leisure life satisfaction on the link between community care utilization and depression among older adults. Methods: This study, using the 2019 Korean Welfare Panel Survey, conducted multiple regression analysis on data from 4494 elderly people aged 65 years or older. Results: After controlling for potential covariates, older community care recipients were more likely to report symptoms of depression than those who did not receive community care. Meanwhile, leisure life satisfaction was negatively associated with depression in older adults. The test for interaction between community care utilization and leisure life satisfaction revealed that leisure life satisfaction significantly attenuated the link between depression and community care utilization. Conclusions: The findings of this study imply that leisure life satisfaction could play a meaningful role in improving the mental health of older adults receiving community care. Welfare policies affecting older adults should consider leisure life satisfaction as an important resource for reducing depression in community care settings.

A Study on Behavior of Post-integrated Abutment Bridge When Abutment and Bridge Decks are Jammed (교대 협착 발생 시 무조인트화 교량의 거동 분석 연구)

  • Park, Yang Heum;Nam, Moon S.;Jang, Il Young
    • Journal of the Korean GEO-environmental Society
    • /
    • v.22 no.3
    • /
    • pp.31-35
    • /
    • 2021
  • The expansion joints installed on the bridge for the accommodation of expansion and contraction of the supper structure are essential members of the bridge. However, the expansion joints are deteriorated over time and the waterproof function weakens, causing rainwater to penetrate and deteriorate the structure. In order to solve the traffic congestion caused by frequent replacement of the old expansion joints along with the deterioration of the structure, a post-integrated abutment bridge in which the existing expansion joints are removed and replaced with reinforced concrete link connection has been applied to highway bridges since 2016. After the post-integrated abutment method was applied, it was partially applied to bridges in which the superstructure and abutment were jammed. In this study, the causes of problems that may occur when the post-integrated abutment method is applied to the jammed bridge were analyzed numerically. It was analyzed that damage occurred in the link connection part. Based on the results of this study, the application condition for the post-integrated abutment method is reinforced as it is not possible to apply the post-integrated abutment method to bridges are already jammed.

Development of a n-path algorithm for providing travel information in general road network (일반가로망에서 교통정보제공을 위한 n-path 알고리듬의 개발)

  • Lim, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.4 s.75
    • /
    • pp.135-146
    • /
    • 2004
  • For improving the effectiveness of travel information, some rational paths are needed to provide them to users driving in real road network. To meet it, k-shortest path algorithms have been used in general. Although the k-shortest path algorithm can provide several alternative paths, it has inherent limit of heavy overlapping among derived paths, which nay lead to incorrect travel information to the users. In case of considering the network consisting of several turn prohibitions popularly adopted in real world network, it makes difficult for the traditional network optimization technique to deal with. Banned and penalized turns are not described appropriately for in the standard node/link method of network definition with intersections represented by nodes only. Such problem could be solved by expansion technique adding extra links and nodes to the network for describing turn penalties, but this method could not apply to large networks as well as dynamic case due to its overwhelming additional works. This paper proposes a link-based shortest path algorithm for the travel information in real road network where exists turn prohibitions. It enables to provide efficient alternative paths under consideration of overlaps among paths. The algorithm builds each path based on the degree of overlapping between each path and stops building new path when the degree of overlapping ratio exceeds its criterion. Because proposed algorithm builds the shortest path based on the link-end cost instead or node cost and constructs path between origin and destination by link connection, the network expansion does not require. Thus it is possible to save the time or network modification and of computer running. Some numerical examples are used for test of the model proposed in the paper.