2076 search results - page 231 / 416 » Universal Routing in Distributed Networks |
124
click to vote
INFOCOM
1993
IEEE
15 years 8 months ago
1993
IEEE
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
119
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topo...
131
click to vote
IC
2004
15 years 5 months ago
2004
The ubiquity of the Internet has stimulated the development of data- rather than processor-intensive applications. Such data-intensive applications include streaming media, intera...
123
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
127
click to vote
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search en...