13214 search results - page 183 / 2643 » Pseudorandomness for network algorithms |
170
click to vote
SIGCOMM
1996
ACM
15 years 10 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
213
click to vote
JCP
2008
15 years 6 months ago
2008
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
170
click to vote
ICNS
2006
IEEE
16 years 17 days ago
2006
IEEE
— In this paper we consider implementing optical burst switching as a technology for building Grids with computationally intensive requirements. This architecture has been referr...
168
click to vote
JCO
2006
15 years 6 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
176
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...