Sciweavers

530 search results - page 21 / 106
» Universal randomized switching
Sort
View
103
Voted
RANDOM
2001
Springer
15 years 6 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...
SIGMETRICS
2010
ACM
201views Hardware» more  SIGMETRICS 2010»
15 years 6 months ago
Load balancing via random local search in closed and open systems
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, A...
107
Voted
FOCS
2006
IEEE
15 years 8 months ago
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
Tomás Feder, Adam Guetz, Milena Mihail, Ami...
PKC
1999
Springer
83views Cryptology» more  PKC 1999»
15 years 6 months ago
On the Security of Random Sources
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
Jean-Sébastien Coron
113
Voted
ANCS
2007
ACM
15 years 5 months ago
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
Lin Liu, Yuanyuan Yang