Filters








14,077 Hits in 5.5 sec

Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding [chapter]

Vijay K. Garg, Anurag Agarwal
2005 Lecture Notes in Computer Science  
Maintaining spanning trees in a distributed fashion is central to many networking applications.  ...  In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology.  ...  Conclusion and Future Work In this paper we presented a new technique for maintaining spanning trees using labeled tree encoding.  ... 
doi:10.1007/11549468_68 fatcat:ycff7kybvvazhjlbb4uxykcs34

Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations

Mouna Ktari, Mohamed Amine Haddar, Mohamed Mosbah, Ahmed Hadj Kacem
2017 RAIRO - Theoretical Informatics and Applications  
The problem of constructing and maintaining a spanning tree in dynamic networks is important in distributed systems.  ...  Based on the mobile agent paradigm, we present in this paper a distributed algorithm that maintain a hierarchical spanning tree in dynamic networks.  ...  Graph relabeling systems based on local computations [6] can be considered as a tool which allows us to encode distributed algorithms in a formal and unified way.  ... 
doi:10.1051/ita/2017007 fatcat:c7w3rkgkjzaehpuf2wahkt7hfm

A New Ant Colony Optimization Approach for the Degree-Constrained Minimum Spanning Tree Problem Using Pruefer and Blob Codes Tree Coding [chapter]

Yoon-Teck Bau, Chin-Kuan Ho, Hong-Tat Ewe
2007 Swarm Intelligence, Focus on Ant and Particle Swarm Optimization  
Both of these tree codings are bijective because they represent each spanning tree of the complete graph on |V| labelled vertices as a code of |V|-2 vertex labels.  ...  Each spanning tree corresponds to a unique code, and each code corresponds to a unique spanning tree.  ...  The Blob encoding algorithm uses this directed spanning tree rooted at vertex labelled 0 as a set of directed edges whose vertices are the labels {0, 1, ..., |V|-1} as its input.  ... 
doi:10.5772/5096 fatcat:vtn4onfuxjd3td6lrwtf3q2rya

Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks [article]

Arnaud Casteigts, Frédéric Guinand
2013 arXiv   pre-print
The algorithm relies on a perpetual alternation of topology-induced splittings and computation-induced mergings of a forest of spanning trees.  ...  We address the problem of building and maintaining distributed spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed  ...  The computation of spanning trees is therefore a classic problem in distributed computing.  ... 
arXiv:0904.3087v4 fatcat:lrw5bxu37vcc5iybu6uanqnmdq

Compact reachability labeling for graph-structured data

Hao He, Haixun Wang, Jun Yang, Philip S. Yu
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
In this paper, we propose a novel approach, HLSS(Hierarchical Labeling of Sub-Structures), which identifies different types of substructures within a graph and encodes them using techniques suitable to  ...  Various approaches have been proposed to encode graph reachability information using node labeling schemes, but most existing schemes only work well for specific types of graphs.  ...  Using the spanning tree rooted at a, we label a, d, e, and f with [1, 8] , [2, 3] , [4, 5] , and [6, 7] , respectively; we label b and c with [9, 10] and [11, 12] as they belong to separate trees  ... 
doi:10.1145/1099554.1099708 dblp:conf/cikm/HeWYY05 fatcat:dj4ul5wmifb2jdxg5jm2ywyn5y

DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism [article]

Sam Westrick, Larry Wang, Umut A. Acar
2022 arXiv   pre-print
Our algorithm – called DePa – represents a computation as a graph and encodes vertices in the graph with two components: a dag-depth and a fork-path.  ...  Furthermore, graph maintenance at forks and joins requires only constant work, resulting in no asymptotic impact on overall work and span. DePa is therefore work-efficient and fully parallel.  ...  The work and span of a program therefore stays asymptotically unchanged by DePa maintenance, and hence so does its parallelism (the ratio of work to span).  ... 
arXiv:2204.14168v1 fatcat:emfhfoaatnh7deu62prcpb7zr4

On Maximizing Reliability of Lifetime Constrained Data Aggregation Tree in Wireless Sensor Networks

Mengfan Shan, Guihai Chen, Fan Wu, Xiaobing Wu, Xiaofeng Gao, Pan Wu, Haipeng Dai
2015 2015 44th International Conference on Parallel Processing  
To adapt to the distributed nature of the WSNs in practice, we further propose a Prufer code based distributed updating protocol.  ...  Tree-based routing structures are widely used to gather data in wireless sensor networks.  ...  Algorithm 2 Encoding Input: The labeled tree T where the label of a node is its ID. Output: Prüfer code P for T 1: P = ().  ... 
doi:10.1109/icpp.2015.17 dblp:conf/icpp/ShanCWWGWD15 fatcat:id6xgmq5m5e3dmpdqdj6wwnyxe

User notification in taxonomy based digital libraries

H. Belhaj-Frej, P. Rigaux, N. Spyratos
2006 Proceedings of the 24th annual conference on Design of communication - SIGDOC '06  
of a semi-lattice structure for subscriptions allowing the filtering out of non matching subscriptions.  ...  The digital library supports insertion, update and removal of a document.  ...  Evaluating the subsumption relation t1 t2, using this encoding, reduces to checking whether label(t2) is a prefix of label(t 1 ).  ... 
doi:10.1145/1166324.1166366 dblp:conf/sigdoc/Belhaj-FrejRS06 fatcat:35px3v64nbe23mdv4k643qxyim

Unified parallel encoding and decoding algorithms for Dandelion-like codes

Saverio Caminiti, Rossella Petreschi
2010 Journal of Parallel and Distributed Computing  
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels.  ...  Namely, a unique encoding algorithm and a unique decoding algorithm, which when properly parameterized, can be used for all Dandelion-like codes, are designed.  ...  Other fields of application in which bijective tree codes are used include: fault dictionary storage [2] , distributed spanning tree maintenance [20] , cryptographic secret sharing [30] , and antcolony  ... 
doi:10.1016/j.jpdc.2010.07.003 fatcat:tznv3kjkmfdpndfn6eoxtkmphq

Parallel Algorithms for Dandelion-Like Codes [chapter]

Saverio Caminiti, Rossella Petreschi
2009 Lecture Notes in Computer Science  
We consider the class of Dandelion-like codes, i.e., a class of bijective codes for coding labeled trees by means of strings of node labels.  ...  Namely, we design a unique encoding algorithm and a unique decoding algorithm that, properly parametrized, can be used for all Dandelion-like codes.  ...  For example, they are used in fault dictionary storage [1] , distributed spanning tree maintenance [2] , generation of random trees [3] , Genetic Algorithms [4] .  ... 
doi:10.1007/978-3-642-01970-8_60 fatcat:bnsh4ncg3re3rhucf256i6jqce

m-LIGHT: Indexing Multi-Dimensional Data over DHTs

Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-chien Lee
2009 2009 29th IEEE International Conference on Distributed Computing Systems  
Compared to the state-of-the-art indexing schemes, m-LIGHT substantially saves the index maintenance overhead, achieves a more balanced load distribution, and improves the range query performance in both  ...  To preserve data locality, m-LIGHT employs a clever naming mechanism that gracefully maps the index tree into the underlying DHT so that it achieves efficient index maintenance and query processing.  ...  Jianliang Xu was supported by grants HKBU210808 and HKBU211307 from RGC of Hong Kong. Wang-Chien Lee was supported by grants IIS-0534343 and CNS-0626709 from NSF.  ... 
doi:10.1109/icdcs.2009.30 dblp:conf/icdcs/TangXZL09 fatcat:o25uapjdcfetvp7xylgs4leriq

Parallel Algorithms for Encoding and Decoding Blob Code [chapter]

Saverio Caminiti, Rossella Petreschi
2010 Lecture Notes in Computer Science  
A bijective code is a method for associating labeled n-trees to (n − 2)-strings of node labels in such a way that different trees yield different strings and vice versa.  ...  To the best of our knowledge, here we present the first parallel encoding and decoding algorithms for this code.  ...  The more demanding step of Blob Parallel Decoding is the computation of η realized by algorithm Compute η. It requires O(log n) sequential iterations, each of which uses O(n) processors.  ... 
doi:10.1007/978-3-642-11440-3_16 fatcat:w4tshwpzhza57npamaxlmwsngm

Compact Routing Schemes for Dynamic Trees in the Fixed Port Model [chapter]

Amos Korman
2008 Lecture Notes in Computer Science  
We present two routing schemes for dynamic trees that maintain labels of asymptotically optimal size using extremely low average message complexity (per node).  ...  Specifically, we first present a dynamic routing scheme that supports additions of both leaves and internal nodes, maintains asymptotically optimal labels and incurs only O(log 2 n/log 2 log n) average  ...  routing scheme on a dynamic spanning tree of a dynamic network; in this case the adversary would typically encode the port numbers using O(log ∆) bits, where the degree ∆ relates to the dynamic graph  ... 
doi:10.1007/978-3-540-92295-7_28 fatcat:tr6eycp2zze6howyxobug4oatu

SecondNet

Chuanxiong Guo, Guohan Lu, Helen J. Wang, Shuang Yang, Chao Kong, Peng Sun, Wenfei Wu, Yongguang Zhang
2010 Proceedings of the 6th International COnference on - Co-NEXT '10  
SecondNet achieves scalability by distributing all the virtual-to-physical mapping, routing, and bandwidth reservation state in server hypervisors.  ...  Its port-switching based source routing (PSSR) further makes SecondNet applicable to arbitrary network topologies using commodity servers and switches.  ...  We are grateful to Pinyan Lu for his help on the NP-hard proof of the VDC allocation problem.  ... 
doi:10.1145/1921168.1921188 dblp:conf/conext/GuoLWYKSWZ10 fatcat:tsbbkk3znfek5kwknw6k3llbqy

Reliability evaluations of railway power supplies by fault-tree analysis

S.K. Chen, T.K. Ho, B.H. Mao
2007 IET electric power applications  
The paper presents the reliability evaluation of railway power systems by FTA and investigates the impact of maintenance activities on overall reliability.  ...  Evaluation of reliability at system level is essential for not only scheduling maintenance activities, but also identifying reliability-critical components.  ...  It is used to not only analyse a fault tree through converting a fault tree to a BDD [27] , but also directly encode its minimum cut sets [24] .  ... 
doi:10.1049/iet-epa:20060244 fatcat:ktijvzyyyzb6nf3cjrob4ql7eq
« Previous Showing results 1 — 15 out of 14,077 results