• Title/Summary/Keyword: Delay Request-response Mechanism

Search Result 2, Processing Time 0.017 seconds

Implementation of IEEE 1588v2 PTP for Time Synchronization Verification of Ethernet Network (이더넷 네트워크의 시간 동기화 검증을 위한 IEEE 1588v2 PTP 구현)

  • Kim, Seong-Jin;Ko, Kwang-Man
    • The KIPS Transactions:PartA
    • /
    • v.19A no.4
    • /
    • pp.181-186
    • /
    • 2012
  • The distributed measurement and control system require technology to solve complex synchronization problem among distributed devices. It can be solved by using IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems to synchronize real-time clocks incorporated within each component of the system. In this paper, we implemented the IEEE 1588v2 PTP emulator on BlueScope BL6000A using a delay request-response mechanism to measure clock synchronization.

Central Control over Distributed Service Function Path

  • Li, Dan;Lan, Julong;Hu, Yuxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.577-594
    • /
    • 2020
  • Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.