QoS Routing with Incomplete Information by Analog Computing Algorithms
Identifieur interne : 003976 ( Main/Exploration ); précédent : 003975; suivant : 003977QoS Routing with Incomplete Information by Analog Computing Algorithms
Auteurs : János Levendovszky [Hongrie] ; Alpár Fancsali [Hongrie] ; Csaba Végso [Hongrie] ; Gábor Rétvári [Hongrie]Source :
- 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
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 004386
- to stream Istex, to step Curation: 004386
- to stream Istex, to step Checkpoint: 002A36
- to stream Main, to step Merge: 003A47
- to stream Main, to step Curation: 003976
Le 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></author><author><name sortKey="Fancsali, Alpar" sort="Fancsali, Alpar" uniqKey="Fancsali A" first="Alpár" last="Fancsali">Alpár Fancsali</name></author><author><name sortKey="Vegso, Csaba" sort="Vegso, Csaba" uniqKey="Vegso C" first="Csaba" last="Végso">Csaba Végso</name></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></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><idno type="wicri:Area/Istex/Curation">004386</idno><idno type="wicri:Area/Istex/Checkpoint">002A36</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002A36</idno><idno type="wicri:doubleKey">0302-9743:2001:Levendovszky J:qos:routing:with</idno><idno type="wicri:Area/Main/Merge">003A47</idno><idno type="wicri:Area/Main/Curation">003976</idno><idno type="wicri:Area/Main/Exploration">003976</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 wicri:level="1"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Department of Telecommunications, Budapest University of Technology and Economics</wicri:regionArea><wicri:noRegion>Budapest University of Technology and Economics</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Hongrie</country></affiliation></author><author><name sortKey="Fancsali, Alpar" sort="Fancsali, Alpar" uniqKey="Fancsali A" first="Alpár" last="Fancsali">Alpár Fancsali</name><affiliation wicri:level="1"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Department of Telecommunications, Budapest University of Technology and Economics</wicri:regionArea><wicri:noRegion>Budapest University of Technology and Economics</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Hongrie</country></affiliation></author><author><name sortKey="Vegso, Csaba" sort="Vegso, Csaba" uniqKey="Vegso C" first="Csaba" last="Végso">Csaba Végso</name><affiliation wicri:level="1"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Department of Telecommunications, Budapest University of Technology and Economics</wicri:regionArea><wicri:noRegion>Budapest University of Technology and Economics</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Hongrie</country></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 wicri:level="3"><country xml:lang="fr">Hongrie</country><wicri:regionArea>Department of Telecommunications and Telematics, Pázmány Péter sétány 1/D., 1117, Budapest</wicri:regionArea><placeName><settlement type="city">Budapest</settlement><region nuts="2">Hongrie centrale</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Hongrie</country></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><affiliations><list><country><li>Hongrie</li></country><region><li>Hongrie centrale</li></region><settlement><li>Budapest</li></settlement></list><tree><country name="Hongrie"><noRegion><name sortKey="Levendovszky, Janos" sort="Levendovszky, Janos" uniqKey="Levendovszky J" first="János" last="Levendovszky">János Levendovszky</name></noRegion><name sortKey="Fancsali, Alpar" sort="Fancsali, Alpar" uniqKey="Fancsali A" first="Alpár" last="Fancsali">Alpár Fancsali</name><name sortKey="Fancsali, Alpar" sort="Fancsali, Alpar" uniqKey="Fancsali A" first="Alpár" last="Fancsali">Alpár Fancsali</name><name sortKey="Levendovszky, Janos" sort="Levendovszky, Janos" uniqKey="Levendovszky J" first="János" last="Levendovszky">János Levendovszky</name><name sortKey="Retvari, Gabor" sort="Retvari, Gabor" uniqKey="Retvari G" first="Gábor" last="Rétvári">Gábor Rétvári</name><name sortKey="Retvari, Gabor" sort="Retvari, Gabor" uniqKey="Retvari G" first="Gábor" last="Rétvári">Gábor Rétvári</name><name sortKey="Vegso, Csaba" sort="Vegso, Csaba" uniqKey="Vegso C" first="Csaba" last="Végso">Csaba Végso</name><name sortKey="Vegso, Csaba" sort="Vegso, Csaba" uniqKey="Vegso C" first="Csaba" last="Végso">Csaba Végso</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003976 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003976 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Main
|étape= Exploration
|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. |  |