You are on page 1of 2

EBSCOhost var WRInitTime=(new Date()).getTime(); Loading...

//<![CDATA[ var theForm = document.forms['aspnetForm']; if (!theForm) { theForm = document.aspnetForm; } function __doPostBac (eventTarget, eventArgument) { if (!theForm.onsubmit || (theForm.onsubmit() != false)) { theForm.__EVENTTARGET.value = eventTarget; theForm.__EVENTARGUMENT.value = eventArgument; theForm.submit(); } } //]]> var ep = { version: "", baseImagePath: "", brandingPath: "", interfaceId: "ehost", cssLayout: 2, messages: {"Close":"Close","Loading":"Loading"}, clientData: {}, pageScripts: [] }; ep.boot(function() { ep.getScreenResolution(); }, null); Revised Date: 07/2011 Accessibility Information and Tips

1 article(s) will be saved.

To continue, in Internet Explorer, select FILE then SAVE AS from your browser's toolbar above. Be sure to save as a plain text file (.txt) or a 'Web Page, HTML only' file (.html).In FireFox, select FILE then SAVE FILE AS from your browser's toolbar above.In Chrome, select right clic (with your mouse) on this page and select SAVE AS Record: 1Title:Transport optimization on complex networ s.Authors:Danila, Bogdan1 Yong Yu1 Marsh, John A.2 Bassler, Kevin E.1 bassler@uh.eduSource:Chaos; Jun2007, Vol. 17 Issue 2, p026102, 9p, 1 Chart, 8 GraphsDocument Type:ArticleSubject Terms:*MATHEMATICAL optimization *TRANSPORT theory *STATISTICAL mechanics *MATHEMATICAL physics *ROUTERS (Computer networ s) *COMPUTER networ s *PROBABILITIES *TRANSFORMATIONS (Mathematics) *ALGORITHMSAbstract:We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networ s. The algorithm balances networ traffic iteratively by minimizing the maximum node betweenness with as little path lengthening as possible. We show that by using this optimal routing, a networ can sustain significantly higher traffic without jamming than in the case of shortest path routing. A formula is proved and tested with numerical simulation that allows quic computation of the average number of hops along the path and of the average travel times once the betweennesses of the nodes are computed. Using this formula, we show that routing optimization preserves the small-world character exhibited by networ s under shortest path routing, and that it significantly reduces the average travel time on congested


networ s with only a negligible increase in the average travel time at low loads. Finally, we study the correlation between the weights of the lin s in the case of optimal routing and the betweennesses of the nodes connected by them. [ABSTRACT FROM AUTHOR]Copyright of Chaos is the property of American Institute of Physics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)Author Affiliations:1Department of Physics, The University of Houston, Houston, Texas 77204-5005 2Assured Information Security, Rome, New Yor 13440ISSN:10541500DOI:10.1063/1.2731718Accession Number:26456902Database: Academic Search Complete

if(typeof ct_accountNumber !== 'undefined' && typeof ct_ratio !== 'undefined' && typeof ct_host !== 'undefined') { document.write(unescape("%3Cscript%20src='"+ (document.location.protocol=='https:'? 'https://clic': 'http://s.clic')+ "WRc7.js'%20type='text/javascript'%3E%3C/script%3E")); } var Clic TaleSSL=1; if(typeof ct_accountNumber !== 'undefined' && typeof ct_ratio !== 'undefined' && typeof ct_host !== 'undefined') { Clic TaleFetchFrom="http://" + ct_host + "/Clic TaleCache.ashx?t=60adc2e6001a161d549ec8b3a4f80326acb55d48"; if(typeof Clic Tale==='function') { Clic Tale(ct_accountNumber,ct_ratio,"www"); } }