115 search results - page 7 / 23 » Using Random Subsets to Build Scalable Network Services |
SIGCOMM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the problem of interconnecting a simple type of social network: Instant Messaging services. Today, users are members of various IM communities such as AOL, Yahoo, and ...
CN
2004
13 years 8 months ago
2004
The Differentiated Services architecture targets at providing scalable network Quality of Service by means of aggregate scheduling. However, the defined framework itself only give...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and sy...