Sciweavers

613 search results - page 40 / 123
» Centrality Metric for Dynamic Networks
Sort
View
ICPADS
2006
IEEE
14 years 3 months ago
Oriented Overlays For Clustering Client Requests To Data-Centric Network Services
Many of the data-centric network services deployed today hold massive volumes of data at their origin websites, and access the data to dynamically generate responses to user reque...
Congchun He, Vijay Karamcheti
SAC
2006
ACM
14 years 3 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed
PERCOM
2007
ACM
14 years 8 months ago
Supporting Pluggable Configuration Algorithms in PCOM
Pervasive Computing envisions distributed applications that optimally leverage the resources present in their ever-changing execution environment. To ease the development of perva...
Marcus Handte, Klaus Herrmann, Gregor Schiele, Chr...
IPPS
2003
IEEE
14 years 2 months ago
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
This paper presents a generic scheme for a central, yet untackled issue in overlay dynamic networks: maintaining stability over long life and against malicious adversaries. The ge...
Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair B...
INFOCOM
1993
IEEE
14 years 1 months ago
Stability of a Class of Dynamic Routing Protocols (IGRP)
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...
Steven H. Low, Pravin Varaiya