Results 21 to 30 of about 2,726,749 (258)
On the relation between network throughput and delay curves
The theoretical background of network throughput and delay has been widely used in the previous studies to efficiently study the behaviour of different interconnection networks.
Mehrnaz Moudi, Mohamed Othman
doaj +1 more source
Some new models for multiprocessor interconnection networks [PDF]
A multiprocessor system can be modeled by a graph G. The vertices of G correspond to processors while edges represent links between processors. To find suitable models for multiprocessor interconnection networks (briefly MINs), one can apply ...
Cvetković Dragoš +2 more
doaj +1 more source
Network interconnection with competitive transit [PDF]
We examine the interaction between two interconnected networks (e.g., two LECs) and a third network (e.g., an IXC) seeking access to their customer base. The IXC could either interconnect with both LECs or interconnect with only one LEC and transit calls to the other LEC via the first LEC's network.
David Gilo, Yossi Spiegel
openaire +3 more sources
Interconnection between IP Networks and Wireless Sensor Networks
With applications ranging from environmental and health monitoring to military surveillance and inventory tracking, wireless sensor networks (WSNs) are changing the way we collect and use data and will be a major part of our technological future.
Brandon Keith Maharrey +2 more
doaj +1 more source
Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication channels to ...
Dun-Wei Cheng +2 more
doaj +1 more source
Fault-Tolerant Metric Dimension of Interconnection Networks
A fixed interconnection parallel architecture is characterized by a graph, with vertices corresponding to processing nodes and edges representing communication links.
Sakander Hayat +4 more
doaj +1 more source
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally ...
Yi-Cheng Yang +5 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-Claude Bermond, Fahir Ö. Ergincan
openaire +2 more sources
Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks
Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other.
Bossard Antoine, Kaneko Keiichi
doaj +1 more source
Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks
System level diagnosis, an area pioneered by Preparata, Metze and Chien, has been a dominant area of research in the broader area of fault-tolerant computing since the proposition of the PMC model.
Qiang Zhu +3 more
doaj +1 more source

