Sciweavers

2485 search results - page 30 / 497
» A Communicating Tree Model for Generating Network Applicatio...
Sort
View
PIMRC
2008
IEEE
14 years 3 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung

Publication
214views
15 years 6 months ago
Analysis and Modeling of Traffic in Modern Data Communication Networks
In performance analysis and design of communication netword modeling data traffic is important. With introduction of new applications, the characteristics of the data traffic chang...
G. Babic, B. Vandalore, and R. Jain
FOCS
1994
IEEE
14 years 24 days ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...
EUROPAR
2007
Springer
14 years 17 days ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
IADIS
2003
13 years 10 months ago
Service Capabilities Model for Next Generation Ad Hoc Networks
Next generation networks are commonly associated with open service creation environments such as OSA, Parlay or JAIN. These environments make the capabilities provided by telecomm...
Mario Muñoz