• Title/Summary/Keyword: Centralized operation

Search Result 113, Processing Time 0.037 seconds

Implementation of CAMA for M10cn switch (M10CN 교환기의 집중과금처리방식 (CAMA) 구현)

  • 최윤수;김동훈;정성문;이명재
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.4
    • /
    • pp.30-39
    • /
    • 1998
  • Currently, LAMA(Local Automatic Message Accounting) is a billing mechanism which is being used for billing process, in which billing dat is written on MT(Magnetic Tape), collected at each regional billing center and then processed once a month. However, in order to prepare further development of telecommunication network and future new services, computerization of billing process and new daily billing processing system are urgently needed. Therefore Korea Telecom had developed a CAMA (Centralized Automatic Message Accounting) system for M10CN switch. In the CAMA system, billing data generated in switches is transfered on-line using approproate protocols and various transmission media and immediately processed. The CAMA system for M10CN switch consists of three parts such as ED (Extraction Device), TD(Transmission Device) and HC(Host Collector). The system also has redundancy to maintain continuance and confidence of system operation.

  • PDF

Authentication Scheme in Wireless Mobile Multi-hop Networks (무선 모바일 멀티 홉 네트워크에서의 인증 기법 고찰 및 개선)

  • Lee, Yong;Lee, Goo Yeon
    • Journal of Industrial Technology
    • /
    • v.27 no.B
    • /
    • pp.43-51
    • /
    • 2007
  • In mobile multi-hop wireless networks, the authentication between a base station and a mobile multi-hop node, between multi-hop nodes, and between user a station and a multi-hop node is needed for the reliable and secure network operation. In this paper, we survey various authentication schemes which can be considered to be adopted in mobile multi-hop wireless networks and propose a concept of novel mutual authentication scheme applicable to mobile multi-hop network architecture. The scheme should resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which are considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively.

  • PDF

Image Management in High-Volume PACS

  • Ro, Duk-Woo;Ahn, Joong-Ho;Lee, Kyung-Soo;Byun, Hong-Sik;Choo, In-Wook;KimHan, Bo-Kyung;Lim, Jae-Hoon
    • Korean Journal of Digital Imaging in Medicine
    • /
    • v.2 no.1
    • /
    • pp.132-139
    • /
    • 1996
  • The clinical implementation and management of a centralized PACS for efficient softcopy operation is presented. Exam requests from OS, NS, NR, ER and ICUs which account for 50% of all radiological exams are read and archived in PACS. PACS is a clinical tool used by the radiologists and clinicians in daily practice, and without their full support and cooperation, PACS would Indeed be impossible to manage.

  • PDF

Balance-Swap Optimization of Economic Load Dispatch Problem using Quadratic Fuel Cost Function (이차 발전비용함수를 사용한 경제급전문제의 균형-교환 최적화)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.243-250
    • /
    • 2014
  • In this paper, I devise a balance-swap optimization (BSO) algorithm to solve economic load dispatch with a quadratic fuel cost function. This algorithm firstly sets initial values to $P_i{\leftarrow}P_i^{max}$, (${\Sigma}P_i^{max}$ > $P_d$) and subsequently entails two major processes: a balance process whereby a generator's power i of $_{max}\{F(P_i)-F(P_i-{\alpha})\}$, ${\alpha}=_{min}(P_i-P_i^{min})$ is balanced by $P_i{\leftarrow}P_i-{\alpha}$ until ${\Sigma}P_i=P_d$; and a swap process whereby $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_i+{{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}$ = 1.0, 0.1, 0.1, 0.01, 0.001 is set at $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$. When applied to 15, 20, and 38-generators benchmark data, this simple algorithm has proven to consistently yield the best possible results. Moreover, this algorithm has dramatically reduced the costs for a centralized operation of 73-generators - a sum of the three benchmark cases - which could otherwise have been impossible for independent operations.

Design and Analysis of Role-based Security Management Model for Policy-based Security Management in SNMPv3 Network (SNMPv3 통신망의 정책기반 보안관리를 위한 역할기반 보안관리 모델의 설계 및 분석)

  • Ju, Gwang-Ro;Lee, Hyeong-Ho;No, Bong-Nam
    • The KIPS Transactions:PartC
    • /
    • v.8C no.5
    • /
    • pp.573-584
    • /
    • 2001
  • Policy-Based Network Management (PBNM) architecture is to meet various needs of network users and to provide effective management facilities in distributed and large scale networks to network managers. In PBNM, network managers perform network management operations by stipulating a set of rules rather than control each network component. On the other hand, providing security services such as authentication, privacy of messages as well as a new flexible and extensible administration framework, SNMPv3 enables network managers to monitor and control the operation of network components more secure way than ever before. Despite of its enhanced security services, SNMPv3 has difficulties in managing distributed, large-scaled network because it does not provide centralized security management facilities. In this paper, we propose a new security model called Role-based Security Management model (RSM) with security management policy to support scalable and centralized security management for SNMP-based networks. Also, the structure and the operation of the security system as well as the efficiency analysis of RSM in terms of security management are also described.

  • PDF

Design and Implementation of Simulator of Launch Control System (발사관제시스템 시뮬레이터의 설계 및 구현)

  • An, Jae-Chel;Moon, Kyung-Rok;Oh, Il-Seok
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.8
    • /
    • pp.657-665
    • /
    • 2016
  • Launch Control System(LCS) performs the pre-launch preparation and launch operation during launch campaign. The successful launch operation is basically influenced by hardware and software of LCS. Especially, a trivial errors in control algorithm can cause critical problem or disaster in launch operation. Therefore, the hidden or implicit errors should be distinguished and eliminated by the verification test in advance. In this paper, the design and implementation of hardware and software simulator which have already been used in LCS verification will be introduced. By presenting the detailed design and flowchart-based algorithms, we make other similar systems adopt the implementation philosophies of this paper. Especially, this paper emphasizes that all the simulation algorithms work on the self-controller in LCS without using separated computer or PLC.

Preliminary Hazard Analysis for Development of ICT-Based Local Control Center (ICT기반 지역제어센터 개발을 위한 예비위험원 분석)

  • Sung, Yu-Suk;Baek, Jong-Hyen;Kim, Gonyop;Kim, Youngju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1819-1827
    • /
    • 2015
  • ICT-based on-board oriented train control system has been proposed to improve operation efficiency in low-density railway line. It is also needed to develop a new ICT-based local control center which relates to existing centralized traffic control lines. In order to meet the qualitative target of these developing system, RAMS activities are required. In this paper, through preliminary hazard analysis, hazards and their contributing factors are addressed, then countermeasures are established to control the risk to an acceptable level.

A Device Authentication Mechanism Reducing Performance Cost in Mobile P2P Networks

  • Jeong, Yoon-Su;Kim, Yong-Tae;Shin, Seung-Soo;Lee, Sang-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.923-948
    • /
    • 2013
  • The main concern in mobile peer-to-peer (P2P) networks is security because jamming or eavesdropping on a wireless link is much easier than on a wired one and such damage can be incurred without physical access or contact. In particular, authentication has increasingly become a requirement in mobile P2P environments. This paper presents a new mutual authentication mechanism which requires less storage space and maintains a high level of security in mobile P2P networks. The proposed mechanism improves efficiency by avoiding the use of centralized entities and is designed to be agile in terms of both reliability and low-cost implementation. The mechanism suggested in the simulation evaluates the function costs occurring in authentication between the devices under mobile P2P network environment comparing to existing method in terms of basic operation costs, traffic costs, communications costs, storage costs and scalability. The simulation results show that the proposed mechanism provides high authentication with low cryptography processing overhead.

The development of the high effective and stoppageless file system for high performance computing (High Performance Computing 환경을 위한 고성능, 무정지 파일시스템 구현)

  • Park, Yeong-Bae;Choe, Seung-Hwan;Lee, Sang-Ho;Kim, Gyeong-Su;Gong, Yong-Jun
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2004.11a
    • /
    • pp.395-401
    • /
    • 2004
  • In the current high network-centralized computing and enterprising environment, it is getting essential to transmit data reliably at very high rates. Until now previous client/server model based NFS(Network File System) or AFS(Andrew's Files System) have met the various demands but from now couldn't satisfy those of the today's scalable high-performance computing environment. Not only performance but data sharing service redundancy have risen as a serious problem. In case of NFS, the locking issue and cache cause file system to reboot and make problem when it is used simply as ip-take over for H/A service. In case of AFS, it provides file sharing redundancy but it is not possible until the storage supporting redundancy and equipments are prepared. Lustre is an open source based cluster file system developed to meet both demands. Lustre consists of three types of subsystems : MDS(Meta-Data Server) which offers the meta-data services, OST(Objec Storage Targets) which provide file I/O, and Lustre Clients which interact with OST and MDS. These subsystems with message exchanging and pursuing scalable high-performance file system service. In this paper, we compare the transmission speed of gigabytes file between Lustre and NFS on the basis of concurrent users and also present the high availability of the file system by removing more than one OST in operation.

  • PDF

Identification of scheduling problems for CSCW-based shop floor control in agile manufacturing

  • Cha, Soohyun;Cho, Hyunbo;Jung, Mooyoung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.208-215
    • /
    • 1995
  • Numerous solution methods for scheduling problems such as part dispatching problem, operation sequence problem have been suggested as a means to be embedded in hierarchical or centralized shop floor control. Under the preceding control philosophies, however, response to changes in the shop floor status is quite slow and timely decision is sometimes impossible. Moreover, the control software becomes too large and it is almost impossible to modify the control software when the configuration of the shop floor changes. In agile manufacturing which emerged recently to cope with quick response and easy modifiability when unexpected changes occur, a new control policy is needed. CSCW[Computer Supported Cooperative Work] based shop floor control casts a different view on scheduling problems. Decisions are made locally when requested and useful information is scattered among agents for its efficient use. Adaptation is easy because agents are -'plug compatible or portable. In this paper, scheduling problems occurring under CSCW based shop floor control are identified and characterized. Traditional scheduling problems are reviewed from the CSCW viewpoint. All the control entities involved in the shop floor can be found and used to defined agents. With these entities and CSCW concept, possible scheduling problems are identified.

  • PDF