• Title/Summary/Keyword: Control packet

Search Result 1,137, Processing Time 0.038 seconds

Networked $H_{\infty}$ Approach and Power System Stabilization (Networked $H_{\infty}$ Approach에 의한 전력계통안정화)

  • Lee, Sang-Seung
    • Proceedings of the KIEE Conference
    • /
    • 2005.07a
    • /
    • pp.226-228
    • /
    • 2005
  • This paper deals with power system stabilization problem using a network control system in which the control is applied through a communication channel in feedback form. Analysis and synthesis issues are investigated by modeling the packet delivery characteristics of the network as a Bernoulli random variable, which is described by a two state Markov chain. This model assumption yields an overall system which is described by a discrete-time Markov jump linear system. These employ the norm to measure the performance of the system, and they compute the norm via a necessary and sufficient matrix inequality condition.

  • PDF

Design and Implementation of Monitoring Software for Heterogeneous Control Network (이종 제어 네트워크를 위한 모니터링 소프트웨어의 설계 및 구현)

  • Heo, Jong-Man;Ha, Jae-Yeol;Kim, Nam-Hoon;Jeon, Joseph;Lee, Kam-Rok;Chung, Bum-Jin;Kwon, Wook-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.114-116
    • /
    • 2006
  • XCP (eXtensive Control Protocol) is an information oriented protocol which delivers information with high reliability according to the predefined rule. XCP network system can be implemented on top of several physical layer such as power line, IEEE 802.15.4 and so on. In this paper. a monitoring software that evaluates the reliability and performance of the XCP network is designed and implemented. This paper presents the structure and method of the packet monitoring in the network through several interfaces such as RS-232, ethernet.

  • PDF

Flow Aggregation of Rate Controlled Round-Robin Scheduler

  • Kim, Ki-Cheon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.351-359
    • /
    • 2004
  • Flow aggregation is a scalable method to provide quality of service (QoS) guarantees to a large number of flows economically. A round-robin scheduler is an efficient scheduling algorithm. We investigate flow aggregation using a round-robin scheduler and propose the use of periodic timer interrupts for rate control of the round-robin scheduler. The proposed flow aggregator is a single-stage scheduler compared to Cobb's two-stage flow aggregator consisting of an aggregator and non-aggregating scheduler. It is possible to implement flow aggregation in the existing routers with only a software upgrade. We also present a simulation study showing the delay behaviors of the proposed algorithm.

  • PDF

Realization of a Scalable and Reliable Multicast Transport Protocol for Many-to-Many Sessions

  • Lee, Seung-Ik;Ko, Yang-Woo;Lee, Dong-Man
    • ETRI Journal
    • /
    • v.29 no.6
    • /
    • pp.745-754
    • /
    • 2007
  • In this paper, we present the Enhanced Communication Transport Protocol-Part 5 (ECTP-5), which provides scalable and reliable multicast communication service for many-to-many applications by constructing high quality recovery trees from two-layer logical trees and repairing the losses via unicast automatic repeat request-based error control. In order to realize the protocol, we developed feasible protocol architectures and building blocks including additional functions which deal with engineering details, such as membership dynamics and sender coordination. Experimental results show that ECTP-5 scales well with various session sizes and packet loss rates in terms of control overhead and recovery latency.

  • PDF

A Study on the Performance Analysis and Comparision of Channel Access Protocols in LAN (LAN에서 채널 접속프로토콜의 성능해석 및 비교에 관한 연구)

  • 김평육;김정선;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.6
    • /
    • pp.402-410
    • /
    • 1986
  • The Media Access Control(MAC) Technologies in IEEE 802 Local Area Network(LAN) reference model include CSMA/CD, Token Ring and Token Bus methodes. The channel throughput of LAN can be affected by some parameters such as channel length, transmission rate and packet size, and station numbers. In this paper, the effect of these parameters to channel throughput are analyzed by normalized parameters. And the token ring and token bus method are analyzed by using the normalized parameter, and relatinonship bwtween channel thorughput and parameters is discussed. Finally, results are compared.

  • PDF

Clustering Algorithm for a Traffic Control of Wireless Ad Hoc Networks multi-hop (무선 에드혹 망 다중홉 트래픽제어를 위한 Clustering 알고리즘에 관한 연구)

  • 이동철;김기문;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1161-1167
    • /
    • 2003
  • The nodes of Ad hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad hoc.

A software-controlled bandwidth allocation scheme for multiple router on-chip-networks

  • Bui, Phan-Duy;Lee, Chanho
    • Journal of IKEEE
    • /
    • v.23 no.4
    • /
    • pp.1203-1207
    • /
    • 2019
  • As the number of IP cores has been increasing in a System-on-Chip (SoC), multiple routers are included in on-chip-networks. Each router has its own arbitration policy and it is difficult to obtain a desired arbitration result by combining multiple routers. Allocating desired bandwidths to the ports across the routers is more difficult. In this paper, a guaranteed bandwidth allocation scheme using an IP-level QoS control is proposed to overcome the limitations of existing local arbitration policies. Each IP can control the priority of a packet depending on the data communication requirement within the allocated bandwidth. The experimental results show that the proposed mechanism guarantees for IPs to utilize the allocated bandwidth in multiple router on-chip-networks. The maximum error rate of bandwidth allocation of the proposed scheme is only 1.9%.

Overload control mechanism by parameter tuning in FDDI networks (FDDI 네트워크의 파라미터 튜닝에 의한 과부하 제어 메카니즘)

  • 이준호;김경신;강문식;송명렬;이상배
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.4
    • /
    • pp.32-39
    • /
    • 1995
  • In this paper, a timer thresholds tuning algorithm is proposed, satisfying the required response time for traffic with time-critical applications and asynchronous traffic in FDDI network. Under light and medium load, priorities and timer thresholds play a minor role for medium access control. In these cases all quenes are served exhaustively with a ver high service probability and the packet loss probability approaches almost zero. Under overload condition, however, the performance of the FDDI Network is completely determined by the selection of the timer thresholds. The timer thresholds tuned by mathematical results is confirmed by simulation results using SIMAN/UNIX package. The allocation of guaranteed bandwidth can be controlled easily by tuning the timer thresholds according to the proposed rules.

  • PDF

A Medium Access Control Protocol for Voice/Data Integrated Wireless CDMA Systems

  • Lim, In-Taek
    • ETRI Journal
    • /
    • v.23 no.2
    • /
    • pp.52-60
    • /
    • 2001
  • In this paper, a medium access control protocol is proposed for integrated voice and data services in wireless local networks. Uplink channels for the proposed protocol are composed of time slots with multiple spreading codes per slot based on slotted code division multiple access (CDMA) systems. The proposed protocol uses spreading code sensing and reservation schemes. This protocol gives higher access priority to delay-sensitive voice traffic than to data traffic. The voice terminal reserves an available spreading code to transmit multiple voice packets during a talkspurt. On the other hand, the data terminal transmits a packet without making a reservation over one of the available spreading codes that are not used by voice terminals. In this protocol, voice packets do not come into collision with data packets. The numerical results show that this protocol can increase the system capacity for voice service by applying the reservation scheme. The performance for data traffic will decrease in the case of high voice traffic load because of its low access priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.

  • PDF

Suggestion to Improve Power Efficiency by Changing Sleep-Wakeup Period in Wireless Network Environment for Internet of things

  • Woo, Eun-Ju;Moon, Yu-Sung;Choi, Jae-Hyun;Kim, Jae-Hoon;Kim, Jung-Won
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.862-865
    • /
    • 2018
  • The proposed scheme minimizes the Idle time under the residual energy of the sensor node to adjust the Sleep-Wakeup period and minimize unnecessary energy consumption. It is The proposed scheme minimizes the Idle time under the residual energy of the sensor node to adjust the Sleep-Wakeup period and minimize unnecessary energy consumption. It is an important process to control the Application Packet Framework including the PHY and the MAC layer at each node's Idle time with the Idle time mechanism state before the proposed function is executed. The Current Control Level of the Report Attribute is fixed at one sending / receiving node where power consumption can occur, by changing Sleep-Wakeup time, the low power consumption efficiency was improved while satisfying the transmission requirement of the given delay time constraint.