Sciweavers

3047 search results - page 474 / 610
» Randomized Parallel Selection
Sort
View
140
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
123
Voted
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 8 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
141
Voted
CCS
2003
ACM
15 years 7 months ago
Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays
Network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate “stepping stones” to conceal their identity and origin...
Xinyuan Wang, Douglas S. Reeves
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
139
Voted
SIGGRAPH
1989
ACM
15 years 6 months ago
Algorithms for solid noise synthesis
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...
J. P. Lewis