Sciweavers

776 search results - page 17 / 156
» Network Applications of Graph Bisimulation
Sort
View
ISCC
1999
IEEE
14 years 2 months ago
On Network Survivability Algorithms Based on Trellis Graph Transformations
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
Soulla Louca, Andreas Pitsillides, George Samaras
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
13 years 1 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
INFOCOM
2006
IEEE
14 years 4 months ago
On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
Vivek Vishnumurthy, Paul Francis
PERCOM
2008
ACM
14 years 4 months ago
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
Lilia Paradis, Qi Han
SC
2004
ACM
14 years 3 months ago
Improving Throughput for Grid Applications with Network Logistics
This work describes a technique for improving network performance in Grid environments that we refer to as “logistics.” We demonstrate that by using storage and cooperative fo...
D. Martin Swany