Sciweavers

1498 search results - page 29 / 300
» Collection tree protocol
Sort
View
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 1 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
SIROCCO
2004
13 years 11 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
PRDC
2002
IEEE
14 years 2 months ago
Energy Efficient and Robust Multicast Protocol for Mobile Ad Hoc Networks
This paper reevaluates the multicast protocols for MANETs in terms of energy efficiency and proposes a new robust multicast protocol, called Two-Tree Multicast (TTM). Multicast pr...
Sangman Moh, Chansu Yu, Ben Lee, Hee Yong Youn
SSS
2010
Springer
103views Control Systems» more  SSS 2010»
13 years 8 months ago
A Provably Starvation-Free Distributed Directory Protocol
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...
Hagit Attiya, Vincent Gramoli, Alessia Milani
CCR
1998
96views more  CCR 1998»
13 years 9 months ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad