Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum del...
Gespeichert in:
Veröffentlicht in: | I.R.E. transactions on communications systems 1984-08, Vol.32 (8), p.911-919 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 919 |
---|---|
container_issue | 8 |
container_start_page | 911 |
container_title | I.R.E. transactions on communications systems |
container_volume | 32 |
creator | Bertsekas, D. Gafni, E. Gallager, R. |
description | We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change. |
doi_str_mv | 10.1109/TCOM.1984.1096159 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_1096159</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1096159</ieee_id><sourcerecordid>24396209</sourcerecordid><originalsourceid>FETCH-LOGICAL-c298t-3ec505d6581d66403742583335c54e869bbef5701c352e7530c78d60639e01233</originalsourceid><addsrcrecordid>eNpNkEtLw0AUhQdRsFZ_gLjJQtyl3slkJjPL0vqCPkDrOqSTmzqaR52ZVPrvTWgRV5cL3zkcPkKuKYwoBXW_miznI6pkPOo-Qbk6IQPKuQxB8uSUDAAUhCJJ5Dm5cO4TAGJgbEAWb6ibOg-maM0u82aHwbjcNNb4j8oFRWODualN1VYdUWb7YGqct2bdesyD16b1pt4Epg4W6H8a--UuyVmRlQ6vjndI3h8fVpPncLZ8epmMZ6GOlPQhQ82B54JLmgvRLUniiEvGGNc8RinUeo0FT4BqxiNMOAOdyFyAYAqBRowNyd2hd2ub7xadTyvjNJZlVmPTujSKmRIRqA6kB1DbxjmLRbq1psrsPqWQ9ubS3lzam0uP5rrM7bE8czorC5vV2ri_oFRMAvQbbg6YQcR_tYeSXx7OdY0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>24396209</pqid></control><display><type>article</type><title>Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Bertsekas, D. ; Gafni, E. ; Gallager, R.</creator><creatorcontrib>Bertsekas, D. ; Gafni, E. ; Gallager, R.</creatorcontrib><description>We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change.</description><identifier>ISSN: 0090-6778</identifier><identifier>ISSN: 0096-2244</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOM.1984.1096159</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Communication networks ; Communications Society ; Convergence ; Delay ; Distributed computing ; Exact sciences and technology ; Iterative algorithms ; Optimization methods ; Routing ; Statistical distributions ; Systems, networks and services of telecommunications ; Telecommunication traffic ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments)</subject><ispartof>I.R.E. transactions on communications systems, 1984-08, Vol.32 (8), p.911-919</ispartof><rights>1985 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c298t-3ec505d6581d66403742583335c54e869bbef5701c352e7530c78d60639e01233</citedby><cites>FETCH-LOGICAL-c298t-3ec505d6581d66403742583335c54e869bbef5701c352e7530c78d60639e01233</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1096159$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1096159$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=8938003$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bertsekas, D.</creatorcontrib><creatorcontrib>Gafni, E.</creatorcontrib><creatorcontrib>Gallager, R.</creatorcontrib><title>Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks</title><title>I.R.E. transactions on communications systems</title><addtitle>TCOMM</addtitle><description>We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change.</description><subject>Applied sciences</subject><subject>Communication networks</subject><subject>Communications Society</subject><subject>Convergence</subject><subject>Delay</subject><subject>Distributed computing</subject><subject>Exact sciences and technology</subject><subject>Iterative algorithms</subject><subject>Optimization methods</subject><subject>Routing</subject><subject>Statistical distributions</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunication traffic</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><issn>0090-6778</issn><issn>0096-2244</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1984</creationdate><recordtype>article</recordtype><recordid>eNpNkEtLw0AUhQdRsFZ_gLjJQtyl3slkJjPL0vqCPkDrOqSTmzqaR52ZVPrvTWgRV5cL3zkcPkKuKYwoBXW_miznI6pkPOo-Qbk6IQPKuQxB8uSUDAAUhCJJ5Dm5cO4TAGJgbEAWb6ibOg-maM0u82aHwbjcNNb4j8oFRWODualN1VYdUWb7YGqct2bdesyD16b1pt4Epg4W6H8a--UuyVmRlQ6vjndI3h8fVpPncLZ8epmMZ6GOlPQhQ82B54JLmgvRLUniiEvGGNc8RinUeo0FT4BqxiNMOAOdyFyAYAqBRowNyd2hd2ub7xadTyvjNJZlVmPTujSKmRIRqA6kB1DbxjmLRbq1psrsPqWQ9ubS3lzam0uP5rrM7bE8czorC5vV2ri_oFRMAvQbbg6YQcR_tYeSXx7OdY0</recordid><startdate>198408</startdate><enddate>198408</enddate><creator>Bertsekas, D.</creator><creator>Gafni, E.</creator><creator>Gallager, R.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>198408</creationdate><title>Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks</title><author>Bertsekas, D. ; Gafni, E. ; Gallager, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c298t-3ec505d6581d66403742583335c54e869bbef5701c352e7530c78d60639e01233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1984</creationdate><topic>Applied sciences</topic><topic>Communication networks</topic><topic>Communications Society</topic><topic>Convergence</topic><topic>Delay</topic><topic>Distributed computing</topic><topic>Exact sciences and technology</topic><topic>Iterative algorithms</topic><topic>Optimization methods</topic><topic>Routing</topic><topic>Statistical distributions</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunication traffic</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bertsekas, D.</creatorcontrib><creatorcontrib>Gafni, E.</creatorcontrib><creatorcontrib>Gallager, R.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>I.R.E. transactions on communications systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bertsekas, D.</au><au>Gafni, E.</au><au>Gallager, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks</atitle><jtitle>I.R.E. transactions on communications systems</jtitle><stitle>TCOMM</stitle><date>1984-08</date><risdate>1984</risdate><volume>32</volume><issue>8</issue><spage>911</spage><epage>919</epage><pages>911-919</pages><issn>0090-6778</issn><issn>0096-2244</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TCOM.1984.1096159</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0090-6778 |
ispartof | I.R.E. transactions on communications systems, 1984-08, Vol.32 (8), p.911-919 |
issn | 0090-6778 0096-2244 1558-0857 |
language | eng |
recordid | cdi_ieee_primary_1096159 |
source | IEEE Electronic Library (IEL) |
subjects | Applied sciences Communication networks Communications Society Convergence Delay Distributed computing Exact sciences and technology Iterative algorithms Optimization methods Routing Statistical distributions Systems, networks and services of telecommunications Telecommunication traffic Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) |
title | Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T05%3A27%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Second%20Derivative%20Algorithms%20for%20Minimum%20Delay%20Distributed%20Routing%20in%20Networks&rft.jtitle=I.R.E.%20transactions%20on%20communications%20systems&rft.au=Bertsekas,%20D.&rft.date=1984-08&rft.volume=32&rft.issue=8&rft.spage=911&rft.epage=919&rft.pages=911-919&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOM.1984.1096159&rft_dat=%3Cproquest_RIE%3E24396209%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=24396209&rft_id=info:pmid/&rft_ieee_id=1096159&rfr_iscdi=true |