Sciweavers

2485 search results - page 44 / 497
» A Communicating Tree Model for Generating Network Applicatio...
Sort
View
SECON
2008
IEEE
15 years 6 months ago
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks
Abstract—In this paper, we propose and evaluate two distributed protocols for finding low-cost broadcast and multicast trees in wireless networks. The constructed trees can then...
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fek...
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 4 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang
INFOCOM
2003
IEEE
15 years 5 months ago
On Multicast Trees: Structure and Size Estimation
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
Danny Dolev, Osnat Mokryn, Yuval Shavitt
ICCNMC
2005
Springer
15 years 5 months ago
Data Structure Optimization of AS_PATH in BGP
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
Weirong Jiang
CAV
2009
Springer
134views Hardware» more  CAV 2009»
16 years 11 days ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...