Open AccessJournal Article
Degree 3 Networks Topological Routing
Jose Manuel Gutierrez Lopez,Tahir Riaz,Jens Myrup Pedersen,Sergio Labeage Cecilio,Ole Brun Madsen +4 more
Reads0
Chats0
About:
This article is published in Image Processing and Communications.The article was published on 2009-12-01 and is currently open access. It has received 2 citations till now. The article focuses on the topics: Degree (graph theory).read more
Citations
More filters
Journal ArticleDOI
Tuchola County Broadband Network (TCBN)
TL;DR: The network plan presented in the paper contains both topological structure of fiber optic network as well as the active equipment for the network, which provides low cost of construction, ease of implementation of the network and low operating cost.
Journal ArticleDOI
A survey on chordal rings, n2r and other related topologies
TL;DR: This paper gives an overview of the work done, and provides appropriate references to the work for further details, as a tribute to Professor and Dean Antoni Zabłudowski who passed away during 2012.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Book
Computer Networking: A Top-Down Approach
James F. Kurose,Keith W. Ross +1 more
TL;DR: Computer Networking: A Top-Down Approach Featuring the Internet explains the engineering problems that are inherent in communicating digital information from point to point, and presents the mathematics that determine the best path, show some code that implements those algorithms, and illustrate the logic by using excellent conceptual diagrams.
Journal ArticleDOI
Honeycomb networks: Topological properties and communication algorithms
TL;DR: The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network and honeycomb networks with rhombus and rectangle as the bounding polygons are considered.
Proceedings ArticleDOI
Analyzing Kleinberg's (and other) small-world Models
Chip Martel,Van Nguyen +1 more
TL;DR: The properties of Small-World networks, where links are much more likely to connect "neighbor nodes" than distant nodes, are analyzed, and expected θ(log n) diameter results for higher dimensional grids, as well as settings with less uniform base structures.