Sciweavers

801 search results - page 48 / 161
» Minimal Locked Trees
Sort
View
BROADNETS
2006
IEEE
15 years 3 months ago
Optimizing IP Multicast through Delayed Multicast Tree Pruning
This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and tra...
Yongjun Li, Wenhui Zhou, James Zijun Wang, Deyu Qi
INFOCOM
1999
IEEE
15 years 2 months ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
TCAD
2008
128views more  TCAD 2008»
14 years 9 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
EUROPAR
2005
Springer
15 years 3 months ago
A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
Abstract. This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our appro...
Julien Sopena, Luciana Bezerra Arantes, Marin Bert...
CSL
2010
Springer
14 years 11 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano