Please use this identifier to cite or link to this item:
Author(s): Rui A. Costa
João Barros
Title: Network information flow in navigable small-world networks
Issue Date: 2006
Abstract: Small-world graphs, exhibiting high clustering coefficients and small average path length, have been shown to capture fundamental properties of a large number of natural and man-made networks. In the context of communication networks, navigable small-world topologies, i.e. those which admit efficient distributed routing algorithms, are deemed particularly effective, for example in resource discovery tasks and peer-to-peer applications. Intrigued by the fundamental limits of communication in networks that exploit this type of topology, we study two classes ofnavigable small-world networks from the point of view of network information flow and provide inner and outer bounds for their max-flow min-cut capacity. Our contribution is in contrast with the standard approach to small world networks which privileges parameters pertaining to connectivity.
Subject: Engenharia de telecomunicações, Outras ciências da engenharia e tecnologias
Telecommunications engineering, Other engineering and technologies
Scientific areas: Ciências da engenharia e tecnologias::Outras ciências da engenharia e tecnologias
Engineering and technology::Other engineering and technologies
Source: IEEE Workshop in Network Coding, Theory and Applications
Document Type: Artigo em Livro de Atas de Conferência Internacional
Rights: openAccess
Appears in Collections:FEUP - Artigo em Livro de Atas de Conferência Internacional

Files in This Item:
File Description SizeFormat 
57989.pdf385.02 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons