Sciweavers

15 search results - page 3 / 3
» On selection of candidate paths for proportional routing
Sort
View
CCGRID
2008
IEEE
13 years 11 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
ANCS
2010
ACM
13 years 2 months ago
Axon: a flexible substrate for source-routed ethernet
This paper introduces the Axon, an Ethernet-compatible device for creating large-scale datacenter networks. Axons are inexpensive, practical devices that are demonstrated using pr...
Jeffrey Shafer, Brent Stephens, Michael Foss, Scot...
AGENTS
1997
Springer
13 years 9 months ago
Ant-Like Agents for Load Balancing in Telecommunications Networks
This paper describes a novel method of achieving load balancing in telecommunications networks. A simulated network models a typical distribution of calls between arbitrary nodes;...
Ruud Schoonderwoerd, Owen Holland, Janet Bruten
SIAMDM
2010
113views more  SIAMDM 2010»
12 years 11 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
INFOCOM
2002
IEEE
13 years 9 months ago
Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
Chunming Qiao, Dahai Xu