Sciweavers

972 search results - page 61 / 195
» Performance of data networks with random links
Sort
View
NSDI
2010
15 years 7 months ago
ElasticTree: Saving Energy in Data Center Networks
Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving...
Brandon Heller, Srinivasan Seetharaman, Priya Maha...
WETICE
2009
IEEE
16 years 25 days ago
A Gossip-Based Distributed Social Networking System
—Social networking web sites, which allow users to create identities and link them to friends who have also created identities, are highly popular. Systems such as Facebook and M...
S. M. A. Abbas, Johan A. Pouwelse, Dick H. J. Epem...
ANCS
2009
ACM
15 years 3 months ago
Design and performance analysis of a DRAM-based statistics counter array architecture
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
Haiquan (Chuck) Zhao, Hao Wang, Bill Lin, Jun (Jim...
MASCOTS
2003
15 years 7 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
SPAA
1996
ACM
15 years 10 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick