{"title":"The FDDI MAC meets self-stabilization","authors":"Adam M. Costello, G. Varghese","doi":"10.1109/SLFSTB.1999.777480","DOIUrl":"https://doi.org/10.1109/SLFSTB.1999.777480","url":null,"abstract":"A self-stabilizing protocol is one that can continue to operate correctly after arbitrary corruption of protocol state variables and the injection of arbitrary messages. Self-stabilizing protocols are extremely robust and can be simpler than other protocols (because they use a uniform mechanism to deal with a large number of possible faults). We demonstrate these advantages by modifying the Fiber Distributed Data Interface Media Access Control (FDDI MAC), a widely used token-ring protocol, to make it self-stabilizing. Our modifications are simple: the major step is to add a token rotation counter and a phase bit that are carried in all messages. Not only is our modified protocol more robust (for example, our protocol recovers from multiple tokens in less than 5.75 ms, while the existing MAC might never recover), but it also recovers from lost tokens more quickly (0-0.36 ms versus 2.5-4.1 ms). We describe the modest changes made to the existing MAC state machine.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120963392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Self-stabilizing clock synchronization in a hierarchical network","authors":"A. Ciuffoletti","doi":"10.1109/SLFSTB.1999.777491","DOIUrl":"https://doi.org/10.1109/SLFSTB.1999.777491","url":null,"abstract":"We are aiming at introducing a solution to a consensus problem, which models the asynchronous part of a clock synchronization problem. The solution is based on the diffusion of a request from the peripheral units to the privileged units that respond with the value of a reference clock that is diffused in the opposite direction. The diffusion is controlled by a hierarchical arrangement of the units, which operate following a 3-state self-stabilizing algorithm. The overall behavior is modeled as a series of waves that propagate in the system, and that are periodically triggered by peripheral units. The appendix contains the exhaustive proof of the formal claims contained in the paper.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131667422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stabilization of maximal metric trees","authors":"M. Gouda, Marco Schneider","doi":"10.1109/SLFSTB.1999.777481","DOIUrl":"https://doi.org/10.1109/SLFSTB.1999.777481","url":null,"abstract":"We present a formal definition of routing metrics and provide the necessary and sufficient conditions for a routing metric to be optimizable along a tree. Based upon these conditions, we present a generalization of the shortest path tree which we call the \"maximal metric tree\". We present a stabilizing protocol for constructing maximal metric trees. Our protocol demonstrates that the distance-vector routing paradigm may be extended to any metric that is optimizable along a tree and in a self-stabilizing manner. Examples of minimal metric trees include shortest path trees (distance vector), depth first search trees, maximum flow trees, and reliability trees.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127454059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}