dynamically optimizing end to end latency
play

Dynamically Optimizing End-to-End Latency for Time-Triggered - PowerPoint PPT Presentation

Dynamically Optimizing End-to-End Latency for Time-Triggered Networks Zonghui Li NEAT2019 2019/8/19 1 Content Background Motivation Best TT Protocol Evaluation Conclusion and Future Work 2 Background


  1. Dynamically Optimizing End-to-End Latency for Time-Triggered Networks Zonghui Li NEAT2019 2019/8/19 1

  2. Content 一. Background 二. Motivation 三. Best TT Protocol 四. Evaluation 五. Conclusion and Future Work 2

  3. Background ❑ Industrial Ethernet Industry 4.0 Launching Data driven industrial new ecosystem AI Network is an important carrier of data communication, and thus, is essential infrastructure. Ethernet Industrial control Industrial Ethernet networks High Bandwidth Field bus High Bandwidth realtime low Bandwidth no realtime 3

  4. Background ❑ Characteristics of Industrial Ethernet ❖ Integrated Network ❖ For Industry ➢ Realtime control ( Customizable end-to-end latency) ➢ Since different control instructions may have different latency requirements ❖ For Ethernet Users ➢ High bandwidth with QoS such as priority, traffic shaper, etc. Note : QoS based realtime is not the realtime for Industry control because the former provides the upper bound of end-to-end latency that is nearly no customizability.

  5. Background ❑ Time-triggered (TT) Networks ❖ TTEthernet ➢ For aerospace ➢ Provided by the Society of Automotive Engineers Group ❖ Time-sensitive Networking (TSN) ➢ To standardize Industrial Ethernet ➢ Provided by the 802.1Q Group ❖ The common characteristics ➢ Using time-triggered transmission for industrial control ➢ So-called Time-triggered Networks 5

  6. Content 一. Background 二. Motivation 三. Best TT Protocol 四. Evaluation 五. Conclusion and Future Work 6

  7. Motivation ❑ Time-triggered Transmission ❖ For example, a frame from End v 0 to End v 3 End device-v 0 t Sending point Switch-v 1 t Sending point Switch-v 2 t Sending point End device-v 3 t ❖ To customize end-to-end latency ➢ By scheduling these sending points 7

  8. Motivation ❑ Best-effort Transmission ❖ The frame is transmitted from End v 0 to End v 3 again. End device-v 0 t Sending Point Switch-v 1 t Sending Point Switch-v 2 t Sending Point t End device-v 3 This is a big gap! 8

  9. Motivation ❑ The Problem ❖ When transmitting a frame ➢ How to make TT transmission as upper bound ➢ and the same performance (latency) as BE transmission ? t End device-v 3 This is a big gap! ❑ The Solution ❖ The BE Assisted TT Communication Protocol ❖ So-called BEST TT Protocol 9

  10. Content 一. Background 二. Motivation 三. Best TT Protocol 四. Evaluation 五. Conclusion and Future Work 10

  11. Best TT Protocol ❑ TT Transmission VS BE Transmission ❖ TT transmission ➢ Customizing end-to-end latency by scheduling sending points ➢ Order-preserving due to scheduled sending points ➢ BE transmission ➢ Queueing leads to a longer latency than that of TT frames ➢ Even dropping frames leads to the unreachable frames ➢ Rerouting leads to out of order ➢ Congestion may be partial ✓ A switch has frame loss due to congestion but remaining path is free congestion How can we conquer the uncertainty of BE transmission to 11 optimize and maintain the properties of TT transmission?

  12. Best TT Protocol ❑ Basic Idea ❖ To make a copy for each TT frame ❖ To deliver the copy with best effort transmission ❖ Either a TT frame or its copy ➢ the first arriving at the destination device as the final delivery ➢ and ignoring the other one. a copy Make a copy Choose the first one a TT 12

  13. Best TT Protocol ❑ To conquer the uncertainty of BE transmission ❖ For queueing even drop frames ➢ Either a TT frame or its copy, the first arriving at the destination device as the final delivery and ignoring the other one. ❖ For partial congestion ➢ Each switch attempts to make a copy a copy Make a copy Choose the first one a TT 13

  14. Best TT Protocol ❑ To conquer the uncertainty of BE transmission ❖ For rerouting ➢ Static routes with the same paths as TT frames ❖ For surpassing ➢ A sequence-based order-preserving strategy is proposed to drop such surpassing copies and recover the right sequence a copy Make a copy Static Route Choose the recover first one a TT 14

  15. Best TT Protocol ❑ Four properties of Best TT Protocol ❖ Preserving Order ➢ the order of different frames sent by the start device is kept in the end devices ❖ Self-recovery ➢ if a copy is dropped, the transmission of the next copy will not be affected. ❖ Dynamic Optimization ➢ The variable latency optimization due to the dynamic network load ❖ Cost Efficiency ➢ For each TT frame, no more than one copy is transmitted in the whole network. 15

  16. Content 一. Background 二. Motivation 三. Best TT Protocol 四. Evaluation 五. Conclusion and Future Work 16

  17. Evaluation  Experiment Setup ❖ Scenario One ( Latency Optimization ) ➢ To demonstrate copies are always running men in spite of the disturbance of other data ➢ So, to assign copies higher priority than other BE data ❖ Scenario Two ( Upper Bounds ) ➢ To demonstrate latency of TT frames is the upper bounds ➢ So, to assign copies the same priority as other BE data and adjust the bandwidth of other BE data to let copies queueing even loss

  18. Evaluation  Experiment Setup ❖ Scenario Three ( Self-recovery ) ➢ To demonstrate the self-recovery when the congestion has gone ➢ So, to assign copies the same priority as other BE data ➢ to adjust the bandwidth of other BE data to let copies queueing even loss and let queueing even loss only happen in partial switches.

  19. Evaluation  Experiment Setup ❖ The experiment platform

  20. Evaluation  Scenario One (Latency Optimization) ❖ Significant improvement for latency Significant Improvement

  21. Evaluation  Scenario Two (Upper Bounds) ❖ The latency of TT frames are the upper bounds Upper bound

  22. Evaluation  Scenario Three (Self-Recovery) Congestion ❖ Partial optimization(TTS-2,3)

  23. Content 一. Background 二. Motivation 三. Best TT Protocol 四. Evaluation 五. Conclusion and Future Work 23

  24. Conclusion and Future Work  Conclusions ❖ We proposed the BEST TT Protocol ➢ Tackling the uncertainty of BE transmission ➢ Dynamically optimizing the latency of TT transmission ❖ We implemented the protocol in our TT switches ❖ We demonstrated the protocol ➢ By designing three scenarios for latency optimization, upper bounds and self-recovery

  25. Conclusion and Future Work ❑ Future Work ❖ Optimizing the latency but enlarging the jitter of the latency Enlarged Jitter ❖ The next work is to extend the protocol for configurable jitters 25

  26. 26

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend