• Title/Summary/Keyword: Priority Control

Search Result 933, Processing Time 0.033 seconds

Cell Priority Control with 2-Level Thresholds in ATM Switch Network (ATM 스위치 네트워크에서의 2-레벨 임계치를 갖는 셀우선순위 제어방식)

  • 박원기;한치문;최형진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.3
    • /
    • pp.479-491
    • /
    • 1994
  • In this paper, we proposed cell priority control with 2-level thresholds, which was considered cell loss and cell delay requirement, in ATM switch with output buffer. Priority control mechanism presented in this paper improved cell loss rate for cell loss censitive cell and cell delay for delay censitive cell. In this mechanism cell loss rate and mean cell delay of cell priority control mechanism were obtained theoretically. The results show that cell loss rate and mean cell delay improvement become better by adjusting two thresholds according to QOS characteristics.

  • PDF

A Dynamic Precedence Queue Mechanism of CAN for An Efficient Management of Automobile Network System (자동차 네트워크 시스템의 효율적 관리를 위한 CAN의 동적 선행대기 열 기법)

  • Choi Ho-Seek;Choi Hyo-Seek;Lee Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.6
    • /
    • pp.614-620
    • /
    • 2006
  • Today the automobile has been changed from a mechanical system to an electronic control system fly the development of the electronic technology. In the automobile body, most of these electronic control devices are networked and managed fully by the CAN protocol. But, when a network system is overloaded, unexpected transmission delay for relative low priority objects occurs due to the static priority definition of the CAN protocol. To resolve this problem, this paper proposes a dynamic precedence queue mechanism that creates a queue for the low priority object and its relevant objects to be transmitted, which becomes urgent in an overloaded network system to keep the maximum allowable time delay. For the generated queue, the highest priority is assigned to transmit the queued objects within the shortest time. The mechanism is implemented in the logical link layer of CAN, which does not require any modification of the old CAN hardware. Effectiveness of the proposed mechanism is verified by the real experiments with an automobile network system.

Performance analysis of a loss priority control scheme in an input and output queueing ATM switch (입출력 단에 버퍼를 가지는 ATM 교환기의 손실우선순위 제어의 성능 분석)

  • 이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.6
    • /
    • pp.1148-1159
    • /
    • 1997
  • In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.

  • PDF

The VLSI Implementation of A Usage Parameter Control based on Cell Loss Priority (셀손실 우선순위 기반의 사용 변수제어의 VLSI 구현)

  • 권재우;조태경;최명렬
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.210-212
    • /
    • 2000
  • In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks and implemented it with VLSI Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can solve the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP=0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. The result of performance evaluation shows that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.

  • PDF

VLSI implementation of Usage Parameter Control Based on Cell Loss Priority (셀손실 우선순위 기반의 사용 변수제어의 VLSI 구현)

  • 권재우;조태경;최명렬
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.196-199
    • /
    • 2000
  • In this paper has studied an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. The proposed algorithm is based on the CLP(Cell Loss Priority) bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. The proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of eel]s which may be generated in the multiplexing and demultiplexing procedure. For the performance evaluation, we have simulated the proposed algorithm with discrete time input traffic model and the results show that the performance of the proposed algorithm is better than that of ITU-T usage parameter control algorithm.

  • PDF

Optimal Period and Priority Assignment Using Task & Message-Based Scheduling in Distributed Control Systems (분산 제어 시스템에서의 태스크와 메시지 기반 스케줄링을 이용한 최적 주기와 우선순위 할당)

  • 김형육;이철민;박홍성
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.6
    • /
    • pp.506-513
    • /
    • 2002
  • Distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks. An assignment method of the optimal period of each loop and a heuristic assignment rule of each message's priority are proposed and the integrated scheduling method is developed based on them.

Design of Smart Plug based Media Platform interlocking with ESS (ESS 연동형 스마트 플러그 기반의 미디어 플랫폼 설계)

  • Kang, Mingoo
    • Smart Media Journal
    • /
    • v.3 no.2
    • /
    • pp.37-42
    • /
    • 2014
  • In this paper, the function design of smart media platform control with smart monitoring, and displaying modules which have the priorities of smart plug based smart outlet, is proposed for electrical suppliance of essential information appliance in emergency power consumption situation(blackout, peaktime etc). The effect of power management will be maximized by this smart gateway interlocking with ESS(energy storage system) which has bi-directional power transmission control modules, and smart outlet based on the priority control actions.

A Congestion Control Method for Real-Time Communication Based on ATM Networks

  • Zhang, Lichen
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1831-1834
    • /
    • 2002
  • In this paper, we present results of a study of congestion control for real-time communication based on ATM networks. In ATM networks, congestion usually results in cell loss. Based on the time limit and priority, the cells that compete for the same output line could be lined according to the character of real-time service. We adopt priority control algorithm for providing different QoS bearer services that can be implemented by using threshold methods at the ATM switching nodes, the cells of different deadline and priority could be deal with according to the necessity. Experiments show the proposed algorithm is effective in the congestion control of ATM real-time networks

  • PDF

Flow Control with Hysteresis effect in ATM Network (ATM망의 히스테리시스 특성을 이용한 흐름제어기법)

  • 정상국;진용옥
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.9
    • /
    • pp.10-17
    • /
    • 1994
  • In this paper, a priority schedling and a flow control algorithm with hysteresis effect are proposed for high-speed networks. A mathematical model for the flow control is proposed and a cell transition probability from this model is found. And the performance of the proposed algorithm is analyzed by a computer simulation. According to the simulation results, it can be shown that the priority scheduling and the flow control with hysteresis effect get the cell loss probability 0.061 better and the average delay 100ms better and the average delay 100ms beter than those of single threshold.

  • PDF

Priority-based Overlay Multicast for Distributed Interactive Application (Distributed Interactive Application을 위한 우선 순위 기반 오버레이 멀티캐스트)

  • Lee, Hyung-Ok;Nam, Ji-Seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.1367-1369
    • /
    • 2013
  • Applying Application-Level Multicast technology (ALM) to Distributed Interactive Applications (DIAs) becomes more and more popular. Especially for DIAs embedded priority that the sender forwards data to receivers due to their respective priorities. The priority-based directed minimum spanning tree (PST) algorithm was designed for these DIAs. However, the PST has no efficient priority selection and filtering mechanism. The system will consume a tremendous amount of resource for reconstructing distribution tree and becomes unstable and unscalable. In this paper, First, We propose a novel priority-based application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict efficient priorities for the receivers and quantize the predicted priorities to build the multicast distribution tree. Second, we propose Priority Discrepancy Heuristic Mechanism (PDHM), which sets different thresholds of priority discrepancy within the priority discrepancy interval to control the distribution tree construction can efficiently decrease the repeated distribution tree construction, and we get the best heuristic priority discrepancy interval by PQPST. According to the simulation results, the PQPST and PDHM can efficiently improve the performance of the PST algorithm.