Route Preserving Stabilization
Identifieur interne : 001478 ( Istex/Corpus ); précédent : 001477; suivant : 001479Route Preserving Stabilization
Auteurs : Colette Johnen ; Sébastien TixeuilSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A distributed system is self-stabilizing if it returns to a legitimate state in a finite number of steps regardless of the initial state, and the system remains in a legitimate state until another fault occurs. A routing algorithm is loop-free if, a path being constructed between two processors p and q, any edges cost change induces a modification of the routing tables in such a way that at any time, there always exists a path from p to q. We present a self-stabilizing loop-free routing algorithm that is also route preserving. This last property means that, a tree being constructed, any message sent to the root is received in a bounded amount of time, even in the presence of continuous edge cost changes. Also, and unlike previous approaches, we do not require that a bound on the network diameter is known to the processors that perform the routing algorithm. We guarantee self-stabilization for many metrics (such as minimum distance, shortest path, best transmitter, depth first search metrics, etc.), by reusing previous results on r-operators.
Url:
DOI: 10.1007/3-540-45032-7_14
Links to Exploration step
ISTEX:59642B5095389C3C9A6EBCF159E2A0AA1473FCFELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Route Preserving Stabilization</title><author><name sortKey="Johnen, Colette" sort="Johnen, Colette" uniqKey="Johnen C" first="Colette" last="Johnen">Colette Johnen</name><affiliation><mods:affiliation>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</mods:affiliation></affiliation></author><author><name sortKey="Tixeuil, Sebastien" sort="Tixeuil, Sebastien" uniqKey="Tixeuil S" first="Sébastien" last="Tixeuil">Sébastien Tixeuil</name><affiliation><mods:affiliation>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>Équipe Grand Large, INRIA Futurs, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:59642B5095389C3C9A6EBCF159E2A0AA1473FCFE</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/3-540-45032-7_14</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-F1K0GXGF-H/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001478</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001478</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Route Preserving Stabilization</title><author><name sortKey="Johnen, Colette" sort="Johnen, Colette" uniqKey="Johnen C" first="Colette" last="Johnen">Colette Johnen</name><affiliation><mods:affiliation>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</mods:affiliation></affiliation></author><author><name sortKey="Tixeuil, Sebastien" sort="Tixeuil, Sebastien" uniqKey="Tixeuil S" first="Sébastien" last="Tixeuil">Sébastien Tixeuil</name><affiliation><mods:affiliation>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>Équipe Grand Large, INRIA Futurs, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A distributed system is self-stabilizing if it returns to a legitimate state in a finite number of steps regardless of the initial state, and the system remains in a legitimate state until another fault occurs. A routing algorithm is loop-free if, a path being constructed between two processors p and q, any edges cost change induces a modification of the routing tables in such a way that at any time, there always exists a path from p to q. We present a self-stabilizing loop-free routing algorithm that is also route preserving. This last property means that, a tree being constructed, any message sent to the root is received in a bounded amount of time, even in the presence of continuous edge cost changes. Also, and unlike previous approaches, we do not require that a bound on the network diameter is known to the processors that perform the routing algorithm. We guarantee self-stabilization for many metrics (such as minimum distance, shortest path, best transmitter, depth first search metrics, etc.), by reusing previous results on r-operators.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Colette Johnen</name><affiliations><json:string>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</json:string></affiliations></json:item><json:item><name>Sébastien Tixeuil</name><affiliations><json:string>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</json:string><json:string>Équipe Grand Large, INRIA Futurs, France</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-F1K0GXGF-H</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: A distributed system is self-stabilizing if it returns to a legitimate state in a finite number of steps regardless of the initial state, and the system remains in a legitimate state until another fault occurs. A routing algorithm is loop-free if, a path being constructed between two processors p and q, any edges cost change induces a modification of the routing tables in such a way that at any time, there always exists a path from p to q. We present a self-stabilizing loop-free routing algorithm that is also route preserving. This last property means that, a tree being constructed, any message sent to the root is received in a bounded amount of time, even in the presence of continuous edge cost changes. Also, and unlike previous approaches, we do not require that a bound on the network diameter is known to the processors that perform the routing algorithm. We guarantee self-stabilization for many metrics (such as minimum distance, shortest path, best transmitter, depth first search metrics, etc.), by reusing previous results on r-operators.</abstract><qualityIndicators><score>9.1</score><pdfWordCount>6415</pdfWordCount><pdfCharCount>31636</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>15</pdfPageCount><pdfPageSize>450.7 x 676.8 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>175</abstractWordCount><abstractCharCount>1067</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Route Preserving Stabilization</title><chapterId><json:string>14</json:string><json:string>Chap14</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2003</copyrightDate><issn><json:string>0302-9743</json:string></issn><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor></serie><host><title>Self-Stabilizing Systems</title><language><json:string>unknown</json:string></language><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/3-540-45032-7</json:string></doi><issn><json:string>0302-9743</json:string></issn><eisbn><json:string>978-3-540-45032-0</json:string></eisbn><bookId><json:string>3-540-45032-7</json:string></bookId><isbn><json:string>978-3-540-40453-8</json:string></isbn><volume>2704</volume><pages><first>184</first><last>198</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Shing-Tsaan Huang</name><affiliations><json:string>College of Electrical Engineering and Computer Science, National Central University, 32054, Chung-Li, Taiwan</json:string><json:string>E-mail: sthuang@csie.ncu.edu.tw</json:string></affiliations></json:item><json:item><name>Ted Herman</name><affiliations><json:string>Dept. of Computer Science, University of Iowa, 52242, Iowa City, IA, USA</json:string><json:string>E-mail: herman@cs.uiowa.edu</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Special Purpose and Application-Based Systems</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Management of Computing and Information Systems</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-F1K0GXGF-H</json:string></ark><publicationDate>2003</publicationDate><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/3-540-45032-7_14</json:string></doi><id>59642B5095389C3C9A6EBCF159E2A0AA1473FCFE</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-F1K0GXGF-H/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-F1K0GXGF-H/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-F1K0GXGF-H/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Route Preserving Stabilization</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="2003">2003</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Route Preserving Stabilization</title><author><persName><forename type="first">Colette</forename><surname>Johnen</surname></persName><affiliation><orgName type="department">Laboratoire de Recherche en Informatique, CNRS UMR 8623</orgName><orgName type="institution">Université Paris-Sud XI</orgName><address><postCode>F-91405</postCode><settlement>Orsay cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">Sébastien</forename><surname>Tixeuil</surname></persName><affiliation><orgName type="department">Laboratoire de Recherche en Informatique, CNRS UMR 8623</orgName><orgName type="institution">Université Paris-Sud XI</orgName><address><postCode>F-91405</postCode><settlement>Orsay cedex</settlement><country key="FR">FRANCE</country></address></affiliation><affiliation><orgName type="department">Équipe Grand Large</orgName><orgName type="institution">INRIA Futurs</orgName><address><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">59642B5095389C3C9A6EBCF159E2A0AA1473FCFE</idno><idno type="ark">ark:/67375/HCB-F1K0GXGF-H</idno><idno type="DOI">10.1007/3-540-45032-7_14</idno></analytic><monogr><title level="m" type="main">Self-Stabilizing Systems</title><title level="m" type="sub">6th International Symposium, SSS 2003 San Francisco, CA, USA, June 24–25, 2003 Proceedings</title><idno type="DOI">10.1007/3-540-45032-7</idno><idno type="book-id">3-540-45032-7</idno><idno type="ISBN">978-3-540-40453-8</idno><idno type="eISBN">978-3-540-45032-0</idno><idno type="chapter-id">Chap14</idno><editor><persName><forename type="first">Shing-Tsaan</forename><surname>Huang</surname></persName><email>sthuang@csie.ncu.edu.tw</email><affiliation><orgName type="department">College of Electrical Engineering and Computer Science</orgName><orgName type="institution">National Central University</orgName><address><settlement>Chung-Li</settlement><postCode>32054</postCode><country key=""></country></address></affiliation></editor><editor><persName><forename type="first">Ted</forename><surname>Herman</surname></persName><email>herman@cs.uiowa.edu</email><affiliation><orgName type="department">Dept. of Computer Science</orgName><orgName type="institution">University of Iowa</orgName><address><settlement>Iowa City</settlement><region>IA</region><postCode>52242</postCode><country key="US">UNITED STATES</country></address></affiliation></editor><imprint><biblScope unit="vol">2704</biblScope><biblScope unit="page" from="184">184</biblScope><biblScope unit="page" to="198">198</biblScope><biblScope unit="chapter-count">15</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation><orgName type="institution">Karlsruhe University</orgName><address><country key="DE">GERMANY</country></address></affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation><orgName type="institution">Cornell University</orgName><address><region>NY</region><country key="US">UNITED STATES</country></address></affiliation></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</surname></persName><affiliation><orgName type="institution">Utrecht University</orgName><address><country key=""></country></address></affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>A distributed system is <hi rend="italic">self-stabilizing</hi> if it returns to a legitimate state in a finite number of steps regardless of the initial state, and the system remains in a legitimate state until another fault occurs. A routing algorithm is <hi rend="italic">loop-free</hi> if, a path being constructed between two processors <hi rend="italic">p</hi> and <hi rend="italic">q</hi>, any edges cost change induces a modification of the routing tables in such a way that at any time, there always exists a path from <hi rend="italic">p</hi> to <hi rend="italic">q</hi>.</p><p>We present a self-stabilizing loop-free routing algorithm that is also <hi rend="italic">route preserving</hi>. This last property means that, a tree being constructed, any message sent to the root is received in a bounded amount of time, even in the presence of continuous edge cost changes. Also, and unlike previous approaches, we do not require that a bound on the network diameter is known to the processors that perform the routing algorithm. We guarantee self-stabilization for many metrics (such as minimum distance, shortest path, best transmitter, depth first search metrics, etc.), by reusing previous results on r-operators.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I13022</label><item><term type="Secondary" subtype="priority-1">Computer Communication Networks</term></item><label>I13030</label><item><term type="Secondary" subtype="priority-2">Special Purpose and Application-Based Systems</term></item><label>I16013</label><item><term type="Secondary" subtype="priority-3">Computation by Abstract Devices</term></item><label>I16021</label><item><term type="Secondary" subtype="priority-4">Algorithm Analysis and Problem Complexity</term></item><label>I24067</label><item><term type="Secondary" subtype="priority-5">Management of Computing and Information Systems</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-F1K0GXGF-H/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45032-7</BookID><BookTitle>Self-Stabilizing Systems</BookTitle><BookSubTitle>6th International Symposium, SSS 2003 San Francisco, CA, USA, June 24–25, 2003 Proceedings</BookSubTitle><BookVolumeNumber>2704</BookVolumeNumber><BookSequenceNumber>2704</BookSequenceNumber><BookDOI>10.1007/3-540-45032-7</BookDOI><BookTitleID>77332</BookTitleID><BookPrintISBN>978-3-540-40453-8</BookPrintISBN><BookElectronicISBN>978-3-540-45032-0</BookElectronicISBN><BookChapterCount>15</BookChapterCount><BookHistory><OnlineDate><Year>2003</Year><Month>5</Month><Day>27</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I13022" Priority="1" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I13030" Priority="2" Type="Secondary">Special Purpose and Application-Based Systems</BookSubject><BookSubject Code="I16013" Priority="3" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="4" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I24067" Priority="5" Type="Secondary">Management of Computing and Information Systems</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Shing-Tsaan</GivenName><FamilyName>Huang</FamilyName></EditorName><Contact><Email>sthuang@csie.ncu.edu.tw</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Ted</GivenName><FamilyName>Herman</FamilyName></EditorName><Contact><Email>herman@cs.uiowa.edu</Email></Contact></Editor><Affiliation ID="Aff4"><OrgDivision>College of Electrical Engineering and Computer Science</OrgDivision><OrgName>National Central University</OrgName><OrgAddress><City>Chung-Li</City><Postcode>32054</Postcode><Country>Taiwan</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgDivision>Dept. of Computer Science</OrgDivision><OrgName>University of Iowa</OrgName><OrgAddress><City>Iowa City</City><State>IA</State><Postcode>52242</Postcode><Country>USA</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap14" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>14</ChapterID><ChapterDOI>10.1007/3-540-45032-7_14</ChapterDOI><ChapterSequenceNumber>14</ChapterSequenceNumber><ChapterTitle Language="En">Route Preserving Stabilization</ChapterTitle><ChapterFirstPage>184</ChapterFirstPage><ChapterLastPage>198</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2003</Year><Month>5</Month><Day>26</Day></RegistrationDate><OnlineDate><Year>2003</Year><Month>5</Month><Day>27</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3-540-45032-7</BookID><BookTitle>Self-Stabilizing Systems</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Colette</GivenName><FamilyName>Johnen</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff6 Aff7"><AuthorName DisplayOrder="Western"><GivenName>Sébastien</GivenName><FamilyName>Tixeuil</FamilyName></AuthorName></Author><Affiliation ID="Aff6"><OrgDivision>Laboratoire de Recherche en Informatique, CNRS UMR 8623</OrgDivision><OrgName>Université Paris-Sud XI</OrgName><OrgAddress><Postcode>F-91405</Postcode><City>Orsay cedex</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgDivision>Équipe Grand Large</OrgDivision><OrgName>INRIA Futurs</OrgName><OrgAddress><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>A distributed system is <Emphasis Type="Italic">self-stabilizing</Emphasis> if it returns to a legitimate state in a finite number of steps regardless of the initial state, and the system remains in a legitimate state until another fault occurs. A routing algorithm is <Emphasis Type="Italic">loop-free</Emphasis> if, a path being constructed between two processors <Emphasis Type="Italic">p</Emphasis> and <Emphasis Type="Italic">q</Emphasis>, any edges cost change induces a modification of the routing tables in such a way that at any time, there always exists a path from <Emphasis Type="Italic">p</Emphasis> to <Emphasis Type="Italic">q</Emphasis>.</Para><Para>We present a self-stabilizing loop-free routing algorithm that is also <Emphasis Type="Italic">route preserving</Emphasis>. This last property means that, a tree being constructed, any message sent to the root is received in a bounded amount of time, even in the presence of continuous edge cost changes. Also, and unlike previous approaches, we do not require that a bound on the network diameter is known to the processors that perform the routing algorithm. We guarantee self-stabilization for many metrics (such as minimum distance, shortest path, best transmitter, depth first search metrics, etc.), by reusing previous results on r-operators.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>This work was supported in part by the French projects STAR and DYNAMO.</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Route Preserving Stabilization</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Route Preserving Stabilization</title></titleInfo><name type="personal"><namePart type="given">Colette</namePart><namePart type="family">Johnen</namePart><affiliation>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Sébastien</namePart><namePart type="family">Tixeuil</namePart><affiliation>Laboratoire de Recherche en Informatique, CNRS UMR 8623, Université Paris-Sud XI, F-91405, Orsay cedex, France</affiliation><affiliation>Équipe Grand Large, INRIA Futurs, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2003</dateIssued><copyrightDate encoding="w3cdtf">2003</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: A distributed system is self-stabilizing if it returns to a legitimate state in a finite number of steps regardless of the initial state, and the system remains in a legitimate state until another fault occurs. A routing algorithm is loop-free if, a path being constructed between two processors p and q, any edges cost change induces a modification of the routing tables in such a way that at any time, there always exists a path from p to q. We present a self-stabilizing loop-free routing algorithm that is also route preserving. This last property means that, a tree being constructed, any message sent to the root is received in a bounded amount of time, even in the presence of continuous edge cost changes. Also, and unlike previous approaches, we do not require that a bound on the network diameter is known to the processors that perform the routing algorithm. We guarantee self-stabilization for many metrics (such as minimum distance, shortest path, best transmitter, depth first search metrics, etc.), by reusing previous results on r-operators.</abstract><relatedItem type="host"><titleInfo><title>Self-Stabilizing Systems</title><subTitle>6th International Symposium, SSS 2003 San Francisco, CA, USA, June 24–25, 2003 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Shing-Tsaan</namePart><namePart type="family">Huang</namePart><affiliation>College of Electrical Engineering and Computer Science, National Central University, 32054, Chung-Li, Taiwan</affiliation><affiliation>E-mail: sthuang@csie.ncu.edu.tw</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Ted</namePart><namePart type="family">Herman</namePart><affiliation>Dept. of Computer Science, University of Iowa, 52242, Iowa City, IA, USA</affiliation><affiliation>E-mail: herman@cs.uiowa.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I13030">Special Purpose and Application-Based Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I24067">Management of Computing and Information Systems</topic></subject><identifier type="DOI">10.1007/3-540-45032-7</identifier><identifier type="ISBN">978-3-540-40453-8</identifier><identifier type="eISBN">978-3-540-45032-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">77332</identifier><identifier type="BookID">3-540-45032-7</identifier><identifier type="BookChapterCount">15</identifier><identifier type="BookVolumeNumber">2704</identifier><identifier type="BookSequenceNumber">2704</identifier><part><date>2003</date><detail type="volume"><number>2704</number><caption>vol.</caption></detail><extent unit="pages"><start>184</start><end>198</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><identifier type="istex">59642B5095389C3C9A6EBCF159E2A0AA1473FCFE</identifier><identifier type="ark">ark:/67375/HCB-F1K0GXGF-H</identifier><identifier type="DOI">10.1007/3-540-45032-7_14</identifier><identifier type="ChapterID">14</identifier><identifier type="ChapterID">Chap14</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2003</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-F1K0GXGF-H/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001478 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001478 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:59642B5095389C3C9A6EBCF159E2A0AA1473FCFE
|texte= Route Preserving Stabilization
}}
| This area was generated with Dilib version V0.6.33. |  |