• Title/Summary/Keyword: queuing system

Search Result 163, Processing Time 0.023 seconds

Integrating Resilient Tier N+1 Networks with Distributed Non-Recursive Cloud Model for Cyber-Physical Applications

  • Okafor, Kennedy Chinedu;Longe, Omowunmi Mary
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.7
    • /
    • pp.2257-2285
    • /
    • 2022
  • Cyber-physical systems (CPS) have been growing exponentially due to improved cloud-datacenter infrastructure-as-a-service (CDIaaS). Incremental expandability (scalability), Quality of Service (QoS) performance, and reliability are currently the automation focus on healthy Tier 4 CDIaaS. However, stable QoS is yet to be fully addressed in Cyber-physical data centers (CP-DCS). Also, balanced agility and flexibility for the application workloads need urgent attention. There is a need for a resilient and fault-tolerance scheme in terms of CPS routing service including Pod cluster reliability analytics that meets QoS requirements. Motivated by these concerns, our contributions are fourfold. First, a Distributed Non-Recursive Cloud Model (DNRCM) is proposed to support cyber-physical workloads for remote lab activities. Second, an efficient QoS stability model with Routh-Hurwitz criteria is established. Third, an evaluation of the CDIaaS DCN topology is validated for handling large-scale, traffic workloads. Network Function Virtualization (NFV) with Floodlight SDN controllers was adopted for the implementation of DNRCM with embedded rule-base in Open vSwitch engines. Fourth, QoS evaluation is carried out experimentally. Considering the non-recursive queuing delays with SDN isolation (logical), a lower queuing delay (19.65%) is observed. Without logical isolation, the average queuing delay is 80.34%. Without logical resource isolation, the fault tolerance yields 33.55%, while with logical isolation, it yields 66.44%. In terms of throughput, DNRCM, recursive BCube, and DCell offered 38.30%, 36.37%, and 25.53% respectively. Similarly, the DNRCM had an improved incremental scalability profile of 40.00%, while BCube and Recursive DCell had 33.33%, and 26.67% respectively. In terms of service availability, the DNRCM offered 52.10% compared with recursive BCube and DCell which yielded 34.72% and 13.18% respectively. The average delays obtained for DNRCM, recursive BCube, and DCell are 32.81%, 33.44%, and 33.75% respectively. Finally, workload utilization for DNRCM, recursive BCube, and DCell yielded 50.28%, 27.93%, and 21.79% respectively.

A New Key Management Mechanism and Performance Improvement for Conditional Access System (제한수신시스템을 위한 키 관리 메카니즘과 성능향상 방안)

  • 조현숙;이상호
    • The KIPS Transactions:PartC
    • /
    • v.8C no.1
    • /
    • pp.75-87
    • /
    • 2001
  • The Conditional Access System is the complete system for ensuring that broadcasting services are only accessible to those who are entitled to receive them. Four major parts to this system are scrambling, descrambling, authentication and encryption. For the proper operation, which means hard-to- break and uninterrupted service, secure key management and efficient delivery mechanism are very important design factors to this system. Performance analysis is another important factor to this system that is used in massive subscriber environment. In this thesis, one of the secure and efficient key management mechanisms is proposed. For the secrecy of this mechanism, hierarchical stacking of keys and key generation matrix are proposed. For the proof of efficient delivery of those keys, simulation results and performance analysis. which is based on queuing analysis, are presented. Lastly, optimal key generation and delivery period, maximal and minimal key deliver time, and communication capacity for data collection are presented for various subscriber volume.

  • PDF

Some Properties of Heterogeneous Multi-server Systems with the Switching Rules

  • Ahn, Yunkee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.4 no.1
    • /
    • pp.41-51
    • /
    • 1979
  • The Classical multi-server heterogeneous queuing system can be more generalized by using the concept of the switching rules. The descriptions of these systems, the relations among the state probebilities at the various points of interest, and comparisons with the single-server system will be presented. Instead of using the imbedded markov chain we set up the simultaneous equations for the state probabilites by the supplementary variable method.

  • PDF

A Design of Real-time VOD Server Simulator (실시간 VOD 서버 시뮬레이터 설계)

  • 정지영;김성수
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.3
    • /
    • pp.65-75
    • /
    • 2000
  • In recent years, significant advances in computers and communication technologies have made multimedia services feasible. As a result, various queuing models and cost models on architecture and data placement for multimedia server have been proposed. However, these analytical techniques use only probabilistic models to represent the behavior of a system, and then they have several limitations like accuracy. Simulation is a viable alternative to analytical model. It avoids many of the limitations associated with analytical techniques, allowing for more precise representation of system attributes like workload in program code. In this paper, we propose a simulation test bed that can evaluate performance of real-time multimedia server by using simulation model.

  • PDF

Study on Task Scheduling for Parallel Processing of Nested Loops (다중 루프문의 병렬처리를 위한 타스크 스케줄링에 관한 연구)

  • 허정연;손윤구
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.1
    • /
    • pp.11-17
    • /
    • 1992
  • This paper is to propose an analytical queuing model for parallel processing of sequential program with nested loops. The analytical results are compared with the results from the implemented multiprocessor system composed of four intel 8088 microprocessor, eight 2KB shared common memories, and a hardware token ring. At results, this study shows that the processed results are almost similar in proposed analytical model and real system. Proposed analytical model can be applied to evaluate parallel processing of sequential program with nested loops.

  • PDF

Comparative Study of GPS-Integrated Concrete Supply Management using Discrete Event Simulation

  • Zekavat, Payam Rahnamayie;Mortaheb, Mohammad Mehdi;Han, Sangwon;Bernold, Leonhard
    • Journal of Construction Engineering and Project Management
    • /
    • v.4 no.2
    • /
    • pp.31-40
    • /
    • 2014
  • The management of vehicular supply of "perishable" construction material, such as concrete mixes, faces a series of uncertainties such as weather, daily traffic patterns and accidents. Presented in this paper is a logistics control model for managing a hauling fleet with interrelated processes at both ends and queue capacities. Discrete event simulation is used to model the complex interactions of production units and the randomness of the real world. Two alternative strategies for ready mix concrete delivery, with and without an off-site waiting queue, are studied to compare supply performance. Secondly, the paper discusses the effect of an agent-based GPS tracking system providing real-time travel data that lessens the uncertainty of trucking time. The results show that the combination of GPS information with off-site queuing reduces productivity loss and process wastes of concrete placement as well as the idleness of supply trucks when crew or pump experience an unexpected stoppage.

A Stable Random Access Protocol For A Computer Network (안정된 컴퓨터 통신망을 위한 임의 접근 프로토콜)

  • Lee, Sang-Geon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.515-522
    • /
    • 1997
  • A neat prefect stable random access protocol for a broadcast channel,the distributed queuing random access protocol(DQRAP)is presented and evaluated.The DQRAP prootcol utilizes minisolts to provide termaty chan-nel feedback and two distributed queues to:9a) resolve contention and (b) to schedute the transmission of messages.Three minislots are sufficient to resolve collisions faster than the tranmission times of all inboled mecages.Three minislots are suffcient to resolve collisions faster than the tranmission times of all inbolved arrivals when ternary minislot feedback is used.Modelingand simulation indicate that the DQRAP protocol, using as few as three minislits,achives a performance level which approaches that of hypothetical perfect cheduling protocol,ie,the M/D/I system,with respect to propagation delay,thus offers the potential of improved performance over current protocols in satellite,metropolitan and packet radio networks.

  • PDF

Analysis of the AMQP for Data Message Queueing of Korean e-Navigation Operation System (한국형 e-Navigation 운영 시스템의 데이터 메시지 큐잉을 위한 AMQP 분석)

  • Jang, Won-Seok;Kim, Beom-Jun;Kang, Moon-Seog
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2017.11a
    • /
    • pp.22-24
    • /
    • 2017
  • The Korean e-Navigation operating system is designed to provide various services related to marine safety. These services are not configured to be provided in one software, but are made in separate software. In order to integrate the service software installed in the e-Navigation operating system, it is necessary to define the data message which can exchange data between the service software, Depending on the operating concept of the service, many messages are expected to be transmitted over the network in a short time. There is a need for a buffer or message queue to store messages as a way to manage messages efficiently. Therefore, in this paper, we analyze the types and characteristics of Advanced Message Queuing Protocol(AMQP) suitable for Korean e-Navigation operating system and shows that's result.

  • PDF

A Performance Analysis of I/O Scheduler for NAND Flash File System (NAND 플래시 파일시스템의 I/O 스케줄러 성능분석)

  • Lee, Yeongseok;Lee, Changhee;Chung, Kyungho;Kim, Yonghwan;Ahn, Kwangseon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.2
    • /
    • pp.27-34
    • /
    • 2013
  • NAND Flash Memory has been used in several devices by low cost and high capacity, and the demand for mass NAND Flash Memory has increased due to the multimedia extension of mobile devices. The JFFS2, NILFS2, and YAFFS2 file systems are used mainly in NAND Flash Memory. In this paper, the performance of Sequential read/write of the 3 file systems are analyzed for the 4 I/O schedulers : CFQ(Complete Fair Queuing) I/O scheduler, NOOP(No Operation) I/O scheduler, Anticipatory I/O scheduler, and Deadline I/O scheduler. In JFFS2 file system, Anticipatory I/O scheduler has the best performance by 8% decreasing speed in writing time and 1.5% decreasing speed in reading time compared to the other I/O scheduler. In YAFFS2 file system, it results are similar to performance in reading and writing for the 4 I/O schedulers. In NILFS2 file system, NOOP I/O scheduler has 2% faster in writing and Deadline I/O scheduler has 6% faster in reading than other I/O schedulers.

Agile Performance Simulation Model for a Closed Multi-class System (폐쇄된 다중 클래스 시스템에 대한 신속한 성능 시뮬레이션 모델)

  • Kim, Yong-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.6
    • /
    • pp.11-16
    • /
    • 2009
  • The queuing theory was adopted by Erlang to predict the availability of telephone lines in 1917 and had not been used for computer system performance analysis until late 1960s when Scherr published a performance analysis of time-shared computer system. In 2000s, the explosive Internet usage and the development of IT technology made the business environment speed-centric and analysts should react swiftly to the ever-changing situation to satisfy the user requirement. It's tempting to solve the performance problem by purchasing new devices because the price of computers and peripherals are rapidly decreasing along with their increasing performance. But this scheme not only makes it difficult to understand the overall performance of the system but also wastes money. A coarse performance model that is gotten quickly is sometimes preferred to a complex and precise one that takes longer time to get. This paper examines an analytic model suggested by Menasce based on the measured data and suggests a simulation model using ARENA that takes a short time to build.