Optimization of the topology of computer networks based on the classical gomory-hu algorithm does not take the specific transfer technology into account. For WDM technology requirements this leads to a redundancy of c...
详细信息
ISBN:
(纸本)9783030410322;9783030410315
Optimization of the topology of computer networks based on the classical gomory-hu algorithm does not take the specific transfer technology into account. For WDM technology requirements this leads to a redundancy of channel capacities. To reduce the redundancy of allocating network resources, we propose a modification of the gomory-hu algorithm which takes account of the specifics of DWDM technology - not at the final stage but already at intermediate stages in the process. The original algorithm proposed by gomory and hu involves the decomposition of the graph of the input network into ring subnets of different dimensions. Our modified algorithm takes account of the technical parameters of the DWDM technology for each ring during the decomposition. We illustrate our method by an example. The technique can be extended to large networks, which may lead to a significant economic effect.
A cut tree is a combinatorial structure that represents the edge-connectivity between all pairs of nodes of an undirected graph. Cut trees have multiple applications in dependability, as they represent how much it tak...
详细信息
A cut tree is a combinatorial structure that represents the edge-connectivity between all pairs of nodes of an undirected graph. Cut trees have multiple applications in dependability, as they represent how much it takes to disconnect every pair of network nodes. They have been used for solving connectivity problems, routing, and in the analysis of complex networks, among several other applications. This work presents a parallel version of the classical gomory-hu cut tree algorithm. The algorithm is heavily based on tasks that compute the minimum cut on contracted graphs. The main contribution is an efficient strategy to compute the contracted graphs, that allows processes to take advantage of previously contracted graph instances, instead of always computing all contractions from the original input graph. The proposed algorithm was implemented using MPI and experimental results are presented for several families of graphs and show significant performance gains.
In 2010 Durda, Caron, and Buchanan published a paper in INFOR: Information systems and Operational Research, entitled: An application of operational research to computational linguistics: Word ambiguity. In this artic...
详细信息
In 2010 Durda, Caron, and Buchanan published a paper in INFOR: Information systems and Operational Research, entitled: An application of operational research to computational linguistics: Word ambiguity. In this article the authors developed "a new measure of word ambiguity (e.g., homonymy and polysemy) for use in psycholinguistic research". In our work we propose some modification of their algorithm.
In radio communications, a set of links that can transmit in parallel with a tolerable interference is called a compatible set. Finding a compatible set with maximum weighted revenue of the parallel transmissions is a...
详细信息
暂无评论