Efficient algorithm for routing optimization via statistical mechanics

Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal ro...

Full description

Saved in:
Bibliographic Details
Published in:2013 IEEE International Conference on Communications Workshops (ICC) pp. 1420 - 1424
Main Author: Chi Ho Yeung
Format: Conference Proceeding
Language:English
Published: 01.06.2013
Subjects:
Convergence
Cost function
Heuristic algorithms
Physics
Receivers
Routing
Routing protocols
ISSN:2164-7038
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal routing solutions subject to a generic cost. A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost function around the optimized flow. Good algorithmic convergence is observed in most of the parameter regimes. By applying the algorithm, we study and compare the pros and cons of balanced traffic configurations to that of consolidated traffic, which provides important implications to practical communication and transportation networks. Interesting macroscopic phenomena are observed from the optimized states as an interplay between the communication density and the cost functions used.
AbstractList Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal routing solutions subject to a generic cost. A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost function around the optimized flow. Good algorithmic convergence is observed in most of the parameter regimes. By applying the algorithm, we study and compare the pros and cons of balanced traffic configurations to that of consolidated traffic, which provides important implications to practical communication and transportation networks. Interesting macroscopic phenomena are observed from the optimized states as an interplay between the communication density and the cost functions used.
Author Chi Ho Yeung
Author_xml – sequence: 1
  surname: Chi Ho Yeung
  fullname: Chi Ho Yeung
  email: chbyeung@gmail.com
  organization: Nonlinearity & Complexity Res. Group, Aston Univ., Birmingham, UK
BookMark eNotj81Kw0AURkeoYK15AHEzL5A4k5v5W0potVBwo7gsk-md9kqTlMwo6NNbsKvvrA7nu2WzYRyQsXspKimFe1y37UdVCwmV1o1rtLhihTNWNtqAMgrkjM1rqZvSCLA3rEjpUwghjdYKzJytljFSIBwy98f9OFE-9DyOE5_Gr0zDno-nTD39-kzjwL_J85TPnDIFf-Q9hoMfKKQ7dh39MWFx2QV7Xy3f2pdy8_q8bp82JUmjcmksekAbVRBe7xRo2EWFXW3rCJ2N6KATHcRYW9QxGHRCWhe6TrlzrXUKFuzh30uIuD1N1PvpZ3t5Dn9b4E-h
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCW.2013.6649460
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Physics
EISBN 9781467357531
1467357537
EndPage 1424
ExternalDocumentID 6649460
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
ID FETCH-LOGICAL-i175t-78ea3e8f5c0a6d5363df5eb282f3b8fe93b0b3ff28e6fc7e90189cbb596538953
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000572825900271&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2164-7038
IngestDate Wed Aug 27 05:03:11 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-78ea3e8f5c0a6d5363df5eb282f3b8fe93b0b3ff28e6fc7e90189cbb596538953
PageCount 5
ParticipantIDs ieee_primary_6649460
PublicationCentury 2000
PublicationDate 2013-June
PublicationDateYYYYMMDD 2013-06-01
PublicationDate_xml – month: 06
  year: 2013
  text: 2013-June
PublicationDecade 2010
PublicationTitle 2013 IEEE International Conference on Communications Workshops (ICC)
PublicationTitleAbbrev ICCW
PublicationYear 2013
SSID ssj0001766537
ssj0003188864
Score 1.5153656
Snippet Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a...
SourceID ieee
SourceType Publisher
StartPage 1420
SubjectTerms Convergence
Cost function
Heuristic algorithms
Physics
Receivers
Routing
Routing protocols
Title Efficient algorithm for routing optimization via statistical mechanics
URI https://ieeexplore.ieee.org/document/6649460
WOSCitedRecordID wos000572825900271&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEG2QaKIXFTB-pwePFna32257JhBNDOHgBzfS7k6VBFiDwO93WjagiRdvu3uYdKdNZ6ad9x4hd5hxRFg3FEwoG7E0N17mJbMMIuFEXKRWBi2C16dsMFCjkR7WyP0WCwMAofkM2v4x3OUXZb7yR2UdKVOdSizQ97JMbrBau_OUTEpRhVr_jmtVqcAelWBFwHBhq-pSM45057HbffN9Xbxd2fwlrhJiS__4f6M6Ia0dSI8Ot-HnlNRg3iBHP_gFG-Qg9HfmX03S7wWqCDREzfS9XEyWHzOK-SpdlCvf-ExL3DpmFSaTrieGeqRRIHE2UzoDjw9GQy3y0u89dx9YJaHAJpgXLFmmwHBQTuSRkYXgkhdOYDGtEsetcqC5jSx3LlHgQT-A2YHSubVCozOVFvyM1OflHM4JdZYDtzY10iWpBGk0xLlXX08g1uDUBWl634w_NywZ48otl39_viKHyUZYgkXxNakvFyu4Ifv5Gn9tcRum9hseDaJ3
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4IatSLChh_24NHC9u6lvZMIBCRcEDlRtrtVUmAmQn8_bZlAU28eNt2eOlem7732vd9H0IPNuMIbN2QEiZ0QOJEOZmXpiYQMMPCNNbcaxG89puDgRiP5bCEHrdYGADwzWdQd4_-Lj_NkpU7KmtwHsuY2wJ9j8VxFGzQWrsTlSbnrAi27t2uViE8f1RkawJil7YorjXDQDZ6rdab6-yi9cLqL3kVH106J_8b1ymq7WB6eLgNQGeoBIsKOv7BMFhBB77DM_mqok7bk0VYQ1jN3rN8uvyYY5ux4jxbudZnnNnNY16gMvF6qrDDGnkaZzXDc3AIYWuohl467VGrSwoRBTK1mcGSNAUoCsKwJFA8ZZTT1DBbTovIUC0MSKoDTY2JBDjYD9j8QMhEayatM4Vk9ByVF9kCLhA2mgLVOlbcRDEHriSEidNfjyCUYMQlqjrfTD43PBmTwi1Xf3--R4fd0XN_0u8Nnq7RUbSRmSBBeIPKy3wFt2g_WdvfzO_8NH8DwgSlvg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2013+IEEE+International+Conference+on+Communications+Workshops+%28ICC%29&rft.atitle=Efficient+algorithm+for+routing+optimization+via+statistical+mechanics&rft.au=Chi+Ho+Yeung&rft.date=2013-06-01&rft.issn=2164-7038&rft.spage=1420&rft.epage=1424&rft_id=info:doi/10.1109%2FICCW.2013.6649460&rft.externalDocID=6649460
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2164-7038&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2164-7038&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2164-7038&client=summon