1 / 20

A Control Theory Approach to Self-Stabilizing in Large Distributed System

A Control Theory Approach to Self-Stabilizing in Large Distributed System. Student: Fang Hui Supervisor: Teo Yong Meng. Outline. Objective Measurement model Dynamical analysis Algorithm based on parameters Conclusion. Objective.

moses-sutton
Télécharger la présentation

A Control Theory Approach to Self-Stabilizing in Large Distributed System

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Control Theory Approach to Self-Stabilizing in Large Distributed System Student: Fang Hui Supervisor: Teo Yong Meng sma5510-research methodology

  2. Outline • Objective • Measurement model • Dynamical analysis • Algorithm based on parameters • Conclusion sma5510-research methodology

  3. Objective • Find a way to describe the distributed system stability, and how to measure stability • Analyze the stability bound and finite convergence. sma5510-research methodology

  4. Stability of Distributed System • The conception of self-stabilizing distributed computation was first proposed and explored by Dijkstra in 1974. • A distributed system is self-stabilizing if, • when started from an arbitrary initial state, it is guaranteed to reach a legitimate state. • Once in a legal state, the system does not switch to an illegal state in the absence of failures. sma5510-research methodology

  5. Assumptions • Node can only communicate with neighbors whose pointer contained in its routing table • The links and node both may fail and recover during normal operation • The recovery should be without global intervention, but system will consider the stability in global state sense • Each node will keep some extent stability sma5510-research methodology

  6. Measurement • Global stability is accumulated by each node’s stability. • The node stability is derived from its connectivity knowledge. sma5510-research methodology

  7. Measurement (contd) • Divides the system stability into two types: • vertex stability (considering node failure/leave) , • edge stability (considering routing information) • G= (V, E), where | V | = n is network size • Stability distribution matrix: (D : link, w :node) sma5510-research methodology

  8. Node & Global Stability The value of node-i stability Global stability sma5510-research methodology

  9. Stability examples sma5510-research methodology

  10. Model of Dynamical System • Consider routing inconsistency • An incoming message updates or adds new routing entries (new pointer to other node). This can also be caused by node’s periodically maintanence messages besides query messages. The extra message will consume bandwidth to some extent. • The node flushes the outdated entries in its routing table, in terms of out-going message timeout or other possible way. sma5510-research methodology

  11. Two parameters (p,q) • p: model the factor contributing to improving stability. • q: model the factor contributing to decreasing stability. sma5510-research methodology

  12. Profile of node stability tendency • Max: p/(p+q) Node stability sma5510-research methodology

  13. When (p,q) vary • Now we consider the p and q the functions of abstract time t. where p(t), q(t) in [0,1] sma5510-research methodology

  14. Proved Property 2 sma5510-research methodology

  15. (p,q)-feedback • Based on above, design a feed-back system and algorithm by dynamically adjusting factor p(t) and q(t) in each step. Node stability can be maintained in certain level efficiently. sma5510-research methodology

  16. Algorithm 1:achieve node stability x* in finite time sma5510-research methodology

  17. Algorithm 2: achieve global stability in finite time sma5510-research methodology

  18. The advantage of algorithm • No explicit node coordination after global stability requirement sent out. • Termination-detection unnecessary due to finite time. sma5510-research methodology

  19. Conclusion • Analyze the node behavior of distributed system and give a practical evaluation on the global stability, local stability and expected convergence time. • Sort out the parameters which impact the stability dynamically, by disseminating the global stability requirement and each node reach/maintain local stability in finite time. sma5510-research methodology

  20. Open issues • Introduce more advanced parameters to describe the global stability of system in control theory perspective. • A predefined threshold value of stability may not enough. More accuracy on the global stability also depends on the network topology, or stability distribution (specified in previous section). sma5510-research methodology

More Related