US6963927 * 2000年8月29日 2005年11月8日 Lucent Technologies Inc. Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link levelUS6963927 2000年8月29日 2005年11月8日 Lucent Technologies Inc. Method and apparatus for computing the shortest path ...
Here a memristive CA capable of detecting the shortest path between given nodes of a mesh with weighted edges is proposed. Simulation results are in absolute agreement with the solutions given by the corresponding CA-based algorithmic approach. The proposed memristive CA circuit structure is also ...
In general, we define “cloud clusters” to be node sets that optimize the ratio between their diameter and their total bandwidth to the cloud. The schedules produced by our algorithms for cW and cR use nodes of cloud clusters. We prove that the running-time of our implementation is asymptot...
Driven by many applications, in this paper we study the problem of computing the top-k shortest paths from one set of target nodes to another set of target nodes in a graph, namely the top-k shortest path join (KPJ) between two sets of target nodes. While KPJ is an extension of the...
Shortest Path Visualisation This video shows a DNC successfully finding the shortest path between two nodes in a randomly generated graph. By decoding the memory usage of the DNC (as in Fig. 3) we were able to determine which edges were stored in the memory locations it was reading from and...
Research on social relations cognitive model of mobile nodes in Internet of Things Interaction and communication between humans with smart mobile devices are a new trend of development in Internet of Things (IoT). With the powerful sensin... A Jian,X Gui,W Zhang,... - 《Journal of Network ...
Therefore, it requires calculating the shortest path between the candidate physical node v to every single node n in the graph (either physical, virtual or mobile-UE nodes). 4.1.2 Node prune optimization The second optimization is the pruning of the leaves nodes of the 5G graph, i.e. the...
A method and system is described for determining the optimal path for routing a communication in a communication network between a source node and at least one destination node. The determination is based upon evaluation of the path offering the widest bandwidth in the direction of data transmission...
摘要:The h-extra node-connectivity of a graph G is the size of a minimal node-set, whose removal will disconnect G, but each remaining component has no fewer h + 1 nodes. Based on h-extra node-connectivity, the h-extra conditional fault-diagnosability of networks has been ...
Computing device of the present invention calculates the shortest path connecting between two nodes of the network. In addition, by calculating for each node other shortest path originating node Y, it is calculated once the shortest path... 杉園 幸司,青木 道宏,岩田 英明 被引量: 0发表: 2009...