QoS Routing with Incomplete Information by Analog Computing Algorithms
Identifieur interne : 004386 ( Istex/Corpus ); précédent : 004385; suivant : 004387QoS Routing with Incomplete Information by Analog Computing Algorithms
Auteurs : János Levendovszky ; Alpár Fancsali ; Csaba Végso ; Gábor RétváriSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
Abstract
Abstract: The paper proposes novel algorithms for Quality of Service (QoS) routing in IP networks. The new algorithms can handle incomplete information, when link measures (e.g. link delays, bandwidths... etc.) are assumed to be random variables. Incomplete information can arise due to aggregated information in PNNI and OSPF routing protocols, which make link measures characterized by their corresponding p.d.f. It will be demonstrated that the task of QoS routing can be viewed as quadratic optimization. Therefore, neural based optimization algorithms implemented on an analog computer (CNN) can provide fast routing algorithms even in the case of incomplete information. As a result, real-time routing can be carried out to meet end-to-end QoS (such as end-to-end delay) requirements.
Url:
DOI: 10.1007/3-540-45412-8_10
Links to Exploration step
ISTEX:D349A8CFBF9032967DACA81FDF70140C46FCE4AALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">QoS Routing with Incomplete Information by Analog Computing Algorithms</title><author><name sortKey="Levendovszky, Janos" sort="Levendovszky, Janos" uniqKey="Levendovszky J" first="János" last="Levendovszky">János Levendovszky</name><affiliation><mods:affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: levendov@hit.bme.hu</mods:affiliation></affiliation></author><author><name sortKey="Fancsali, Alpar" sort="Fancsali, Alpar" uniqKey="Fancsali A" first="Alpár" last="Fancsali">Alpár Fancsali</name><affiliation><mods:affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: s6592fan@hszk.bme.hu</mods:affiliation></affiliation></author><author><name sortKey="Vegso, Csaba" sort="Vegso, Csaba" uniqKey="Vegso C" first="Csaba" last="Végso">Csaba Végso</name><affiliation><mods:affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: vegsocs@hit.hit.bme.hu</mods:affiliation></affiliation></author><author><name sortKey="Retvari, Gabor" sort="Retvari, Gabor" uniqKey="Retvari G" first="Gábor" last="Rétvári">Gábor Rétvári</name><affiliation><mods:affiliation>Department of Telecommunications and Telematics, Pázmány Péter sétány 1/D., 1117, Budapest, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: retvari@ttt-atm.ttt.bme.hu</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D349A8CFBF9032967DACA81FDF70140C46FCE4AA</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-45412-8_10</idno><idno type="url">https://api.istex.fr/document/D349A8CFBF9032967DACA81FDF70140C46FCE4AA/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">004386</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">004386</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">QoS Routing with Incomplete Information by Analog Computing Algorithms</title><author><name sortKey="Levendovszky, Janos" sort="Levendovszky, Janos" uniqKey="Levendovszky J" first="János" last="Levendovszky">János Levendovszky</name><affiliation><mods:affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: levendov@hit.bme.hu</mods:affiliation></affiliation></author><author><name sortKey="Fancsali, Alpar" sort="Fancsali, Alpar" uniqKey="Fancsali A" first="Alpár" last="Fancsali">Alpár Fancsali</name><affiliation><mods:affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: s6592fan@hszk.bme.hu</mods:affiliation></affiliation></author><author><name sortKey="Vegso, Csaba" sort="Vegso, Csaba" uniqKey="Vegso C" first="Csaba" last="Végso">Csaba Végso</name><affiliation><mods:affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: vegsocs@hit.hit.bme.hu</mods:affiliation></affiliation></author><author><name sortKey="Retvari, Gabor" sort="Retvari, Gabor" uniqKey="Retvari G" first="Gábor" last="Rétvári">Gábor Rétvári</name><affiliation><mods:affiliation>Department of Telecommunications and Telematics, Pázmány Péter sétány 1/D., 1117, Budapest, Hungary</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: retvari@ttt-atm.ttt.bme.hu</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2001</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">D349A8CFBF9032967DACA81FDF70140C46FCE4AA</idno><idno type="DOI">10.1007/3-540-45412-8_10</idno><idno type="ChapterID">10</idno><idno type="ChapterID">Chap10</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The paper proposes novel algorithms for Quality of Service (QoS) routing in IP networks. The new algorithms can handle incomplete information, when link measures (e.g. link delays, bandwidths... etc.) are assumed to be random variables. Incomplete information can arise due to aggregated information in PNNI and OSPF routing protocols, which make link measures characterized by their corresponding p.d.f. It will be demonstrated that the task of QoS routing can be viewed as quadratic optimization. Therefore, neural based optimization algorithms implemented on an analog computer (CNN) can provide fast routing algorithms even in the case of incomplete information. As a result, real-time routing can be carried out to meet end-to-end QoS (such as end-to-end delay) requirements.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>János Levendovszky</name><affiliations><json:string>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</json:string><json:string>E-mail: levendov@hit.bme.hu</json:string></affiliations></json:item><json:item><name>Alpár Fancsali</name><affiliations><json:string>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</json:string><json:string>E-mail: s6592fan@hszk.bme.hu</json:string></affiliations></json:item><json:item><name>Csaba Végso</name><affiliations><json:string>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</json:string><json:string>E-mail: vegsocs@hit.hit.bme.hu</json:string></affiliations></json:item><json:item><name>Gábor Rétvári</name><affiliations><json:string>Department of Telecommunications and Telematics, Pázmány Péter sétány 1/D., 1117, Budapest, Hungary</json:string><json:string>E-mail: retvari@ttt-atm.ttt.bme.hu</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: The paper proposes novel algorithms for Quality of Service (QoS) routing in IP networks. The new algorithms can handle incomplete information, when link measures (e.g. link delays, bandwidths... etc.) are assumed to be random variables. Incomplete information can arise due to aggregated information in PNNI and OSPF routing protocols, which make link measures characterized by their corresponding p.d.f. It will be demonstrated that the task of QoS routing can be viewed as quadratic optimization. Therefore, neural based optimization algorithms implemented on an analog computer (CNN) can provide fast routing algorithms even in the case of incomplete information. As a result, real-time routing can be carried out to meet end-to-end QoS (such as end-to-end delay) requirements.</abstract><qualityIndicators><score>5.146</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430.984 x 665.997 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>790</abstractCharCount><pdfWordCount>3754</pdfWordCount><pdfCharCount>18926</pdfCharCount><pdfPageCount>11</pdfPageCount><abstractWordCount>116</abstractWordCount></qualityIndicators><title>QoS Routing with Incomplete Information by Analog Computing Algorithms</title><genre.original><json:string>OriginalPaper</json:string></genre.original><chapterId><json:string>10</json:string><json:string>Chap10</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item><json:item><name>J. van Leeuwen</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><title>Lecture Notes in Computer Science</title><copyrightDate>2001</copyrightDate></serie><host><editor><json:item><name>Mikhail I. Smirnov</name><affiliations><json:string>Kaiserin-Augusta Allee 31, GMD FOKUS, 10589, Berlin, Germany</json:string><json:string>E-mail: smirnov@fokus.gmd.de</json:string></affiliations></json:item><json:item><name>Jon Crowcroft</name><affiliations><json:string>Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK</json:string><json:string>E-mail: jon.crowcroft@cs.ucl.ac.uk</json:string></affiliations></json:item><json:item><name>James Roberts</name><affiliations><json:string>France Telecom R&D, 38 rue de Général Leclerc, 92794, Issy-Moulineaux, Cedex 9, France</json:string><json:string>E-mail: james.roberts@francetelecom.com</json:string></affiliations></json:item><json:item><name>Fernando Boavida</name><affiliations><json:string>Departamento de Engenharia Informática, Universidade de Coimbra, Pólo II, 3030-290, Coimbra, Portugal</json:string><json:string>E-mail: boavida@dei.uc.pt</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>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Multimedia Information Systems</value></json:item><json:item><value>Business Information Systems</value></json:item><json:item><value>Communications Engineering, Networks</value></json:item></subject><isbn><json:string>978-3-540-42602-8</json:string></isbn><language><json:string>unknown</json:string></language><title>Quality of Future Internet Services</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>3-540-45412-8</json:string></bookId><volume>2156</volume><pages><last>137</last><first>127</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-540-45412-0</json:string></eisbn><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45412-8</json:string></doi></host><publicationDate>2001</publicationDate><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45412-8_10</json:string></doi><id>D349A8CFBF9032967DACA81FDF70140C46FCE4AA</id><score>1</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/D349A8CFBF9032967DACA81FDF70140C46FCE4AA/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/D349A8CFBF9032967DACA81FDF70140C46FCE4AA/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/D349A8CFBF9032967DACA81FDF70140C46FCE4AA/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">QoS Routing with Incomplete Information by Analog Computing Algorithms</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2001</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">QoS Routing with Incomplete Information by Analog Computing Algorithms</title><author><persName><forename type="first">János</forename><surname>Levendovszky</surname></persName><email>levendov@hit.bme.hu</email><affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</affiliation></author><author><persName><forename type="first">Alpár</forename><surname>Fancsali</surname></persName><email>s6592fan@hszk.bme.hu</email><affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</affiliation></author><author><persName><forename type="first">Csaba</forename><surname>Végso</surname></persName><email>vegsocs@hit.hit.bme.hu</email><affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</affiliation></author><author><persName><forename type="first">Gábor</forename><surname>Rétvári</surname></persName><email>retvari@ttt-atm.ttt.bme.hu</email><affiliation>Department of Telecommunications and Telematics, Pázmány Péter sétány 1/D., 1117, Budapest, Hungary</affiliation></author></analytic><monogr><title level="m">Quality of Future Internet Services</title><title level="m" type="sub">Second COST 263 International Workshop, QofIS 2001 Coimbra, Portugal, September 24–26, 2001 Proceedings</title><idno type="pISBN">978-3-540-42602-8</idno><idno type="eISBN">978-3-540-45412-0</idno><idno type="pISSN">0302-9743</idno><idno type="DOI">10.1007/3-540-45412-8</idno><idno type="BookID">3-540-45412-8</idno><idno type="BookTitleID">71335</idno><idno type="BookSequenceNumber">2156</idno><idno type="BookVolumeNumber">2156</idno><idno type="BookChapterCount">24</idno><editor><persName><forename type="first">Mikhail</forename><forename type="first">I.</forename><surname>Smirnov</surname></persName><email>smirnov@fokus.gmd.de</email><affiliation>Kaiserin-Augusta Allee 31, GMD FOKUS, 10589, Berlin, Germany</affiliation></editor><editor><persName><forename type="first">Jon</forename><surname>Crowcroft</surname></persName><email>jon.crowcroft@cs.ucl.ac.uk</email><affiliation>Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK</affiliation></editor><editor><persName><forename type="first">James</forename><surname>Roberts</surname></persName><email>james.roberts@francetelecom.com</email><affiliation>France Telecom R&D, 38 rue de Général Leclerc, 92794, Issy-Moulineaux, Cedex 9, France</affiliation></editor><editor><persName><forename type="first">Fernando</forename><surname>Boavida</surname></persName><email>boavida@dei.uc.pt</email><affiliation>Departamento de Engenharia Informática, Universidade de Coimbra, Pólo II, 3030-290, Coimbra, Portugal</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2001"></date><biblScope unit="volume">2156</biblScope><biblScope unit="page" from="127">127</biblScope><biblScope unit="page" to="137">137</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>van Leeuwen</surname></persName></editor><biblScope><date>2001</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="seriesId">558</idno></series><idno type="istex">D349A8CFBF9032967DACA81FDF70140C46FCE4AA</idno><idno type="DOI">10.1007/3-540-45412-8_10</idno><idno type="ChapterID">10</idno><idno type="ChapterID">Chap10</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2001</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The paper proposes novel algorithms for Quality of Service (QoS) routing in IP networks. The new algorithms can handle incomplete information, when link measures (e.g. link delays, bandwidths... etc.) are assumed to be random variables. Incomplete information can arise due to aggregated information in PNNI and OSPF routing protocols, which make link measures characterized by their corresponding p.d.f. It will be demonstrated that the task of QoS routing can be viewed as quadratic optimization. Therefore, neural based optimization algorithms implemented on an analog computer (CNN) can provide fast routing algorithms even in the case of incomplete information. As a result, real-time routing can be carried out to meet end-to-end QoS (such as end-to-end delay) requirements.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I13022</label><label>I18040</label><label>I18032</label><label>I18059</label><label>W26007</label><label>T24035</label><item><term>Computer Science</term></item><item><term>Computer Communication Networks</term></item><item><term>Information Systems Applications (incl.Internet)</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Multimedia Information Systems</term></item><item><term>Business Information Systems</term></item><item><term>Communications Engineering, Networks</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2001">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-19">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/D349A8CFBF9032967DACA81FDF70140C46FCE4AA/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher 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><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45412-8</BookID><BookTitle>Quality of Future Internet Services</BookTitle><BookSubTitle>Second COST 263 International Workshop, QofIS 2001 Coimbra, Portugal, September 24–26, 2001 Proceedings</BookSubTitle><BookVolumeNumber>2156</BookVolumeNumber><BookSequenceNumber>2156</BookSequenceNumber><BookDOI>10.1007/3-540-45412-8</BookDOI><BookTitleID>71335</BookTitleID><BookPrintISBN>978-3-540-42602-8</BookPrintISBN><BookElectronicISBN>978-3-540-45412-0</BookElectronicISBN><BookChapterCount>24</BookChapterCount><BookHistory><OnlineDate><Year>2001</Year><Month>11</Month><Day>13</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I13022" Priority="1" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I18040" Priority="2" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I18032" Priority="3" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18059" Priority="4" Type="Secondary">Multimedia Information Systems</BookSubject><BookSubject Code="W26007" Priority="5" Type="Secondary">Business Information Systems</BookSubject><BookSubject Code="T24035" Priority="6" Type="Secondary">Communications Engineering, Networks</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Mikhail</GivenName><GivenName>I.</GivenName><FamilyName>Smirnov</FamilyName></EditorName><Contact><Email>smirnov@fokus.gmd.de</Email></Contact></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><FamilyName>Crowcroft</FamilyName></EditorName><Contact><Email>jon.crowcroft@cs.ucl.ac.uk</Email></Contact></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>James</GivenName><FamilyName>Roberts</FamilyName></EditorName><Contact><Email>james.roberts@francetelecom.com</Email></Contact></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Fernando</GivenName><FamilyName>Boavida</FamilyName></EditorName><Contact><Email>boavida@dei.uc.pt</Email></Contact></Editor><Affiliation ID="Aff1"><OrgDivision>Kaiserin-Augusta Allee 31</OrgDivision><OrgName>GMD FOKUS</OrgName><OrgAddress><Postcode>10589</Postcode><City>Berlin</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University College London</OrgName><OrgAddress><Street>Gower Street</Street><City>London</City><Postcode>WC1E 6BT</Postcode><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>France Telecom R&D</OrgName><OrgAddress><Street>38 rue de Général Leclerc</Street><Postcode>92794</Postcode><City>Issy-Moulineaux, Cedex 9</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgDivision>Departamento de Engenharia Informática</OrgDivision><OrgName>Universidade de Coimbra</OrgName><OrgAddress><Street>Pólo II</Street><Postcode>3030-290</Postcode><City>Coimbra</City><Country>Portugal</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part3"><PartInfo TocLevels="0"><PartID>3</PartID><PartSequenceNumber>3</PartSequenceNumber><PartTitle>QoS Routing</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-45412-8</BookID><BookTitle>Quality of Future Internet Services</BookTitle></PartContext></PartInfo><Chapter ID="Chap10" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>10</ChapterID><ChapterDOI>10.1007/3-540-45412-8_10</ChapterDOI><ChapterSequenceNumber>10</ChapterSequenceNumber><ChapterTitle Language="En">QoS Routing with Incomplete Information by Analog Computing Algorithms</ChapterTitle><ChapterFirstPage>127</ChapterFirstPage><ChapterLastPage>137</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2001</Year><Month>11</Month><Day>12</Day></RegistrationDate><OnlineDate><Year>2001</Year><Month>11</Month><Day>13</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><PartID>3</PartID><BookID>3-540-45412-8</BookID><BookTitle>Quality of Future Internet Services</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>János</GivenName><FamilyName>Levendovszky</FamilyName></AuthorName><Contact><Email>levendov@hit.bme.hu</Email></Contact></Author><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Alpár</GivenName><FamilyName>Fancsali</FamilyName></AuthorName><Contact><Email>s6592fan@hszk.bme.hu</Email></Contact></Author><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Csaba</GivenName><FamilyName>Végso</FamilyName></AuthorName><Contact><Email>vegsocs@hit.hit.bme.hu</Email></Contact></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Gábor</GivenName><FamilyName>Rétvári</FamilyName></AuthorName><Contact><Email>retvari@ttt-atm.ttt.bme.hu</Email></Contact></Author><Affiliation ID="Aff5"><OrgDivision>Department of Telecommunications</OrgDivision><OrgName>Budapest University of Technology and Economics</OrgName><OrgAddress><Country>Hungary</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Department of Telecommunications and Telematics</OrgName><OrgAddress><Street>Pázmány Péter sétány 1/D.</Street><City>Budapest</City><Postcode>1117</Postcode><Country>Hungary</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The paper proposes novel algorithms for Quality of Service (QoS) routing in IP networks. The new algorithms can handle incomplete information, when link measures (e.g. link delays, bandwidths... etc.) are assumed to be random variables. Incomplete information can arise due to aggregated information in PNNI and OSPF routing protocols, which make link measures characterized by their corresponding p.d.f. It will be demonstrated that the task of QoS routing can be viewed as quadratic optimization. Therefore, neural based optimization algorithms implemented on an analog computer (CNN) can provide fast routing algorithms even in the case of incomplete information. As a result, real-time routing can be carried out to meet end-to-end QoS (such as end-to-end delay) requirements.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>QoS Routing with Incomplete Information by Analog Computing Algorithms</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>QoS Routing with Incomplete Information by Analog Computing Algorithms</title></titleInfo><name type="personal"><namePart type="given">János</namePart><namePart type="family">Levendovszky</namePart><affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</affiliation><affiliation>E-mail: levendov@hit.bme.hu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Alpár</namePart><namePart type="family">Fancsali</namePart><affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</affiliation><affiliation>E-mail: s6592fan@hszk.bme.hu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Csaba</namePart><namePart type="family">Végso</namePart><affiliation>Department of Telecommunications, Budapest University of Technology and Economics, Hungary</affiliation><affiliation>E-mail: vegsocs@hit.hit.bme.hu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Gábor</namePart><namePart type="family">Rétvári</namePart><affiliation>Department of Telecommunications and Telematics, Pázmány Péter sétány 1/D., 1117, Budapest, Hungary</affiliation><affiliation>E-mail: retvari@ttt-atm.ttt.bme.hu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2001</dateIssued><copyrightDate encoding="w3cdtf">2001</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The paper proposes novel algorithms for Quality of Service (QoS) routing in IP networks. The new algorithms can handle incomplete information, when link measures (e.g. link delays, bandwidths... etc.) are assumed to be random variables. Incomplete information can arise due to aggregated information in PNNI and OSPF routing protocols, which make link measures characterized by their corresponding p.d.f. It will be demonstrated that the task of QoS routing can be viewed as quadratic optimization. Therefore, neural based optimization algorithms implemented on an analog computer (CNN) can provide fast routing algorithms even in the case of incomplete information. As a result, real-time routing can be carried out to meet end-to-end QoS (such as end-to-end delay) requirements.</abstract><relatedItem type="host"><titleInfo><title>Quality of Future Internet Services</title><subTitle>Second COST 263 International Workshop, QofIS 2001 Coimbra, Portugal, September 24–26, 2001 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Mikhail</namePart><namePart type="given">I.</namePart><namePart type="family">Smirnov</namePart><affiliation>Kaiserin-Augusta Allee 31, GMD FOKUS, 10589, Berlin, Germany</affiliation><affiliation>E-mail: smirnov@fokus.gmd.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="family">Crowcroft</namePart><affiliation>Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK</affiliation><affiliation>E-mail: jon.crowcroft@cs.ucl.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">James</namePart><namePart type="family">Roberts</namePart><affiliation>France Telecom R&D, 38 rue de Général Leclerc, 92794, Issy-Moulineaux, Cedex 9, France</affiliation><affiliation>E-mail: james.roberts@francetelecom.com</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Fernando</namePart><namePart type="family">Boavida</namePart><affiliation>Departamento de Engenharia Informática, Universidade de Coimbra, Pólo II, 3030-290, Coimbra, Portugal</affiliation><affiliation>E-mail: boavida@dei.uc.pt</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2001</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="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18059">Multimedia Information Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="W26007">Business Information Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="T24035">Communications Engineering, Networks</topic></subject><identifier type="DOI">10.1007/3-540-45412-8</identifier><identifier type="ISBN">978-3-540-42602-8</identifier><identifier type="eISBN">978-3-540-45412-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">71335</identifier><identifier type="BookID">3-540-45412-8</identifier><identifier type="BookChapterCount">24</identifier><identifier type="BookVolumeNumber">2156</identifier><identifier type="BookSequenceNumber">2156</identifier><identifier type="PartChapterCount">3</identifier><part><date>2001</date><detail type="part"><title>QoS Routing</title></detail><detail type="volume"><number>2156</number><caption>vol.</caption></detail><extent unit="pages"><start>127</start><end>137</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><identifier type="istex">D349A8CFBF9032967DACA81FDF70140C46FCE4AA</identifier><identifier type="DOI">10.1007/3-540-45412-8_10</identifier><identifier type="ChapterID">10</identifier><identifier type="ChapterID">Chap10</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004386 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 004386 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:D349A8CFBF9032967DACA81FDF70140C46FCE4AA
|texte= QoS Routing with Incomplete Information by Analog Computing Algorithms
}}
| This area was generated with Dilib version V0.6.31. |  |