Sciweavers

295 search results - page 12 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
CCGRID
2007
IEEE
15 years 4 months ago
Exploiting Heterogeneity for Collective Data Downloading in Volunteer-based Networks
Abstract— Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fu...
Jinoh Kim, Abhishek Chandra, Jon B. Weissman
FITRAMEN
2008
14 years 11 months ago
A Fair and Dynamic Load-Balancing Mechanism
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
Federico Larroca, Jean-Louis Rougier
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICC
2008
IEEE
108views Communications» more  ICC 2008»
15 years 4 months ago
Minimizing Interferences in Wireless Ad Hoc Networks through Topology Control
— This paper investigates minimizing mutual interferences in wireless ad hoc networks by means of topology control. Prior work defines interference as a relationship between link...
Guinian Feng, Soung Chang Liew, Pingyi Fan
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 3 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha