Sciweavers

32 search results - page 6 / 7
» Randomized Partially-Minimal Routing on Three-Dimensional Me...
Sort
View
SGAI
2004
Springer
13 years 10 months ago
Resource Allocation in Communication Networks Using Market-Based Agents
This work describes a system that allocates end-to-end bandwidth, in a switched meshed communications network. The solution makes use of market-based software agents that compete ...
Nadim Haque, Nicholas R. Jennings, Luc Moreau
COMCOM
2004
127views more  COMCOM 2004»
13 years 5 months ago
Traffic splitting in a network: split traffic models and applications
The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the e...
Huei-Wen Ferng, Cheng-Ching Peng
ICPP
2002
IEEE
13 years 10 months ago
ART: Robustness of Meshes and Tori for Parallel and Distributed Computation
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
Chi-Hsiang Yeh, Behrooz Parhami
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
13 years 10 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
EGC
2005
Springer
13 years 10 months ago
Rapid Distribution of Tasks on a Commodity Grid
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
Ladislau Bölöni, Damla Turgut, Taskin Ko...