Sciweavers

1321 search results - page 108 / 265
» Optimal Routing in Communication Networks with Delay Variati...
Sort
View
IPPS
2006
IEEE
16 years 1 days ago
Topology-aware task mapping for reducing communication contention on large parallel machines
Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies ...
T. Agarwal, Amit Sharma, A. Laxmikant, Laxmikant V...
SEC
2001
15 years 7 months ago
Communication-Efficient Group Key Agreement
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
Yongdae Kim, Adrian Perrig, Gene Tsudik
TON
2008
107views more  TON 2008»
15 years 5 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
INFOCOM
2003
IEEE
15 years 11 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
INFOCOM
2006
IEEE
16 years 1 days ago
Controlled Flooding Search with Delay Constraints
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
Nicholas B. Chang, Mingyan Liu