Sciweavers

478 search results - page 3 / 96
» Diameter and Center Computations in Networks
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
A new Architecture for Multihop Optical Networks
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...
Arunita Jaekel, Subir Bandyopadhyay, Abhijit Sengu...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
IPTPS
2005
Springer
14 years 26 days ago
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state ...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
GLOBECOM
2010
IEEE
13 years 5 months ago
GreenCloud: A Packet-Level Simulator of Energy-Aware Cloud Computing Data Centers
Cloud computing data centers are becoming increasingly popular for the provisioning of computing resources. The cost and operating expenses of data centers have skyrocketed with th...
Dzmitry Kliazovich, Pascal Bouvry, Yury Audzevich,...
SIGCOMM
2012
ACM
11 years 9 months ago
Reviving delay-based TCP for data centers
With the rapid growth of data centers, minimizing the queueing delay at network switches has been one of the key challenges. In this work, we analyze the shortcomings of the curre...
Changhyun Lee, Keon Jang, Sue B. Moon