A bridged local area network (BLAN) is an internetwork where a lot of LANs and MANs are interconnected via bridges. The active spanningtree topology of a BLAN is to ensure that one and only one active routing path ex...
详细信息
A bridged local area network (BLAN) is an internetwork where a lot of LANs and MANs are interconnected via bridges. The active spanningtree topology of a BLAN is to ensure that one and only one active routing path exists between each pair of end stations to resolve the frame duplication problem. A LAN is a hot-spot LAN if it has a large amount of communicating traffic load compared to other LANs. In this paper, we propose a distributed spanning tree algorithm for a BLAN with hot-spot traffic. The spanningtree constructed by our algorithm is logically rooted at the hot-spot LAN instead of the bridge with the smallest identifier. Such a spanningtree will be more practical and suitable for delivering the inter-LAN frames, and hence will obtain a better performance on end-to-end transmission delay. The effectiveness of the algorithm is evaluated by simulations. From the simulation results, we found that, compared to the standard spanning tree algorithm, the spanningtree constructed by our algorithm obtains a greater improvement in terms of end-to-end transmission delay as the traffic concentration becomes more pronounced.
A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radi...
详细信息
ISBN:
(纸本)9781467327275
A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanningtree, which has the characteristic to run in polynomial time.
Finding minimum spanningtrees (MST) in various types of networks is a well-studied problem in theory and practical applications. A number of efficient algorithms have been already developed for this problem. In this ...
详细信息
ISBN:
(纸本)9781509006809
Finding minimum spanningtrees (MST) in various types of networks is a well-studied problem in theory and practical applications. A number of efficient algorithms have been already developed for this problem. In this paper we present an efficient algorithm, namely Edge Pruned Minimum spanningtree (EPMST) algorithm, which combines ideas from randomized selection, Kruskal's algorithm and Prim's algorithm. The algorithm has a superior performance relative to the best-known algorithms especially when the graph is not very sparse. Specifically, EPMST outperforms a recently devised efficient algorithm on a wide range of input graphs.
Manycore architecture promotes a massively parallel computing on the accelerators. Especially GPU is one of the main series of the high performance computing, which is also employed by top supercomputers in the world....
详细信息
ISBN:
(纸本)9781479941162
Manycore architecture promotes a massively parallel computing on the accelerators. Especially GPU is one of the main series of the high performance computing, which is also employed by top supercomputers in the world. The programming method on such accelerators includes development of a control program. The accelerator executes it to schedule the invocation timing of the accelerator's kernel program. The kernel program needs to be written based on the stream computing paradigm. Connecting I/Os of the kernel programs, we can develop a large application. When we consider the processing flow as a directed graph, we can implement a GUI-based programming tool for the accelerators. It visualizes a pipeline-based processing flow. However, it is very hard to find the starting point of a complex processing flow. Moreover, although the processing pipeline should include the potential parallelism, it is hard for the programmer to exploit it intuitively. This paper proposes an algorithm applying the spanningtree that mechanically exploits the parallelism and determines an execution order.
The minimal spanningtree is a structure used in solving certain types of combinatorial optimization problems. Popular application areas include network design such as roads, telephone, electrical and cable-laying. Th...
详细信息
ISBN:
(数字)9781728131269
ISBN:
(纸本)9781728131276
The minimal spanningtree is a structure used in solving certain types of combinatorial optimization problems. Popular application areas include network design such as roads, telephone, electrical and cable-laying. There are two popular algorithms for acquiring the minimum spanningtree of a graph; These are Kruskal's algorithm and Prim's algorithm. The goal of this study is to implement these algorithms and find out which of them is more efficient. To achieve this, we implement and evaluate the complexity of the algorithms. In this paper both methods have been implemented on the road network of the 36 states in Nigeria and results of the implementation are presented. However, since this work is taken from a research in progress, the computational complexity of the two algorithms will be carried out and reported in another paper in the future.
Given a biconnected graph G = ( V, E ), and an arbitrary vertex v in V , there exists a spanningtree T of G with v in the center of T . We prove this by providing an O(∣ V ∣ · ∣ E ∣) algorithm that construct...
详细信息
Given a biconnected graph G = ( V, E ), and an arbitrary vertex v in V , there exists a spanningtree T of G with v in the center of T . We prove this by providing an O(∣ V ∣ · ∣ E ∣) algorithm that constructs such a tree.
In this letter, the authors propose a spanningtree-based algorithm for an agent system, which breaks the mesh-structured agent system into a single tree-structured agent system. Then an algorithm for recalculating th...
详细信息
In this letter, the authors propose a spanningtree-based algorithm for an agent system, which breaks the mesh-structured agent system into a single tree-structured agent system. Then an algorithm for recalculating the information flow among agents without redundant information accumulationis presented. Finally, the proposed methodology is illustrated through a simple mesh structured agent system.
This paper proposes an online Dynamic Multi-Microgrid Formulation (DIVIMF) method using Deep Reinforcement Learning. It aims to reconfigure the microgrid into several self-supplied islands and minimize total operation...
详细信息
ISBN:
(纸本)9781665464413
This paper proposes an online Dynamic Multi-Microgrid Formulation (DIVIMF) method using Deep Reinforcement Learning. It aims to reconfigure the microgrid into several self-supplied islands and minimize total operation cost at the same time. spanning tree algorithm is used to reduce the total number of microgrid formulation. Proximal -Policy Optimization is implemented to train the agent which determines the status of sectionalizing switches in microgrid in real-time. To show the effectiveness of the proposed DMMF method, a case study was conducted in the modified cigre-14 bus test network. The results demonstrated that the proposed DMMF method reduced the total operation cost compared to the operation cost derive from original Cigre 14 bus formulation.
This work determines a safe emergency landing zone for an autonomous UAS by utilizing ground elevation, terrain ruggedness, land coverage, and population density data. The proposed system uses openly available high-fi...
详细信息
ISBN:
(数字)9781624105784
ISBN:
(纸本)9781624105784
This work determines a safe emergency landing zone for an autonomous UAS by utilizing ground elevation, terrain ruggedness, land coverage, and population density data. The proposed system uses openly available high-fidelity Light Detection and Ranging (LIDAR) datasets and surface reflectance data from the Landsat land remote sensing project to determine potential landing zones based on current UAS position and calculated data provided by these datasets. The elevation data is represented as a set of coordinates and an elevation, with the bounding latitudes and longitudes for the dataset included in the dataset metadata. Threshold values for these data set a minimum required topographic quality for an area to be considered valid for landing. A weighting algorithm is used to determine the optimal landing zone for a given UAV situation and position. A constrained bidirectional rapidly exploring random treealgorithm is used with onetime pruning to generate a path to the chosen landing zone that obeys aircraft heading and motion constraints. We show that the optimal landing zone and corresponding path plan update based on the specified topographic quality threshold values and weighting configuration.
In this paper we propose a framework to address the reassembly of shredded documents. Inspired by the way humans approach this problem we introduce a novel algorithm that iteratively determines groups of fragments tha...
详细信息
ISBN:
(纸本)9781612843490
In this paper we propose a framework to address the reassembly of shredded documents. Inspired by the way humans approach this problem we introduce a novel algorithm that iteratively determines groups of fragments that fit together well. We identify such groups by evaluating a set of constraints that takes into account shape- and content-based information of each fragment. Accordingly, we choose the best matching groups of fragments during each iteration and implicitly determine a maximum spanningtree of a graph that represents alignments between the individual fragments. After each iteration we update the graph with respect to additional contextual knowledge. We evaluate the effectiveness of our approach on a dataset of 1 6 fragmented pages with strongly varying content. The robustness of the proposed algorithm is finally shown in situations in which material is lost.
暂无评论