ImageVerifierCode 换一换
格式:PPT , 页数:20 ,大小:292KB ,
资源ID:373142      下载积分:2000 积分
快捷下载
登录下载
邮箱/手机:
温馨提示:
快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。 如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝扫码支付 微信扫码支付   
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【http://www.mydoc123.com/d-373142.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录  

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(A Control Theory Approach to Self-Stabilizing in Large .ppt)为本站会员(周芸)主动上传,麦多课文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文库(发送邮件至master@mydoc123.com或直接QQ联系客服),我们立即给予删除!

A Control Theory Approach to Self-Stabilizing in Large .ppt

1、sma5510-research methodology,1,A Control Theory Approach to Self-Stabilizing in Large Distributed System,Student: Fang Hui Supervisor: Teo Yong Meng,2,sma5510-research methodology,Outline,Objective Measurement model Dynamical analysis Algorithm based on parameters Conclusion,3,sma5510-research metho

2、dology,Objective,Find a way to describe the distributed system stability, and how to measure stabilityAnalyze the stability bound and finite convergence.,4,sma5510-research methodology,Stability of Distributed System,The conception of self-stabilizing distributed computation was first proposed and e

3、xplored 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.,5,sma5510-research methodology,Assum

4、ptions,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

5、extent stability,6,sma5510-research methodology,Measurement,Global stability is accumulated by each nodes stability. The node stability is derived from its connectivity knowledge.,7,sma5510-research methodology,Measurement (contd),Divides the system stability into two types: vertex stability (consid

6、ering node failure/leave) , edge stability (considering routing information)G= (V, E), where | V | = n is network size Stability distribution matrix: (D : link, w :node),8,sma5510-research methodology,Node & Global Stability,The value of node-i stability,Global stability,9,sma5510-research methodolo

7、gy,Stability examples,10,sma5510-research methodology,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 nodes periodically maintanence messages besides query messages. The extra mes

8、sage 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.,11,sma5510-research methodology,Two parameters (p,q),p: model the factor contributing to improving stability. q: model the factor contr

9、ibuting to decreasing stability.,12,sma5510-research methodology,Profile of node stability tendency,Max: p/(p+q),Node stability,13,sma5510-research methodology,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,14,sma5510-research methodology,Proved

10、 Property 2,15,sma5510-research methodology,(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.,16,sma5510-research methodology,Algorithm 1: achieve node stab

11、ility x* in finite time,17,sma5510-research methodology,Algorithm 2: achieve global stability in finite time,18,sma5510-research methodology,The advantage of algorithm,No explicit node coordination after global stability requirement sent out.Termination-detection unnecessary due to finite time.,19,s

12、ma5510-research methodology,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 requirem

13、ent and each node reach/maintain local stability in finite time.,20,sma5510-research methodology,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).,

copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
备案/许可证编号:苏ICP备17064731号-1