English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/46377
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Optimization of transport protocols with path-length constraints in complex networks

AuthorsLama, M. S. de la
Issue DateSep-2010
PublisherAmerican Physical Society
CitationPhysical Review E 82(3): 036119 (2010)
AbstractWe propose a protocol optimization technique that is applicable to both weighted and unweighted graphs. Our aim is to explore by how much a small variation around the shortest-path or optimal-path protocols can enhance protocol performance. Such an optimization strategy can be necessary because even though some protocols can achieve very high traffic tolerance levels, this is commonly done by enlarging the path lengths, which may jeopardize scalability. We use ideas borrowed from extremal optimization to guide our algorithm, which proves to be an effective technique. Our method exploits the degeneracy of the paths or their close-weight alternatives, which significantly improves the scalability of the protocols in comparison to shortest-path or optimal-path protocols, keeping at the same time almost intact the length or weight of the paths. This characteristic ensures that the optimized routing protocols are composed of paths that are quick to traverse, avoiding negative effects in data communication due to path-length increases that can become specially relevant when information losses are present.
Description8 páginas, 8 figuras.-- PACS number(s): 89.75.Hc, 89.20.Hh, 05.70.Ln.-- et al.
Publisher version (URL)http://dx.doi.org/10.1103/PhysRevE.82.036119
Appears in Collections:(IFCA) Artículos
Files in This Item:
File Description SizeFormat 
e036119.pdf227,5 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.