Sciweavers

478 search results - page 12 / 96
» Diameter and Center Computations in Networks
Sort
View
CONEXT
2009
ACM
13 years 8 months ago
Greening the internet with nano data centers
Motivated by increased concern over energy consumption in modern data centers, we propose a new, distributed computing platform called Nano Data Centers (NaDa). NaDa uses ISP-cont...
Vytautas Valancius, Nikolaos Laoutaris, Laurent Ma...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 6 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
ISPAN
1997
IEEE
13 years 11 months ago
On The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
Douglas W. Bass, Ivan Hal Sudborough
FSTTCS
2009
Springer
14 years 1 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
MOBICOM
2012
ACM
11 years 9 months ago
CloudIQ: a framework for processing base stations in a data center
The cellular industry is evaluating architectures to distribute the signal processing in radio access networks. One of the options is to process the signals of all base stations o...
Sourjya Bhaumik, Shoban Preeth Chandrabose, Manjun...