Sciweavers

370 search results - page 55 / 74
» Balanced Routing
Sort
View
JDA
2008
100views more  JDA 2008»
13 years 7 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
DASFAA
2008
IEEE
106views Database» more  DASFAA 2008»
14 years 1 months ago
Flood Little, Cache More: Effective Result-Reuse in P2P IR Systems
State-of-the-art Peer-to-Peer Information Retrieval (P2P IR) systems suffer from their lack of response time guarantee especially with scale. To address this issue, a number of tec...
Christian Zimmer, Srikanta J. Bedathur, Gerhard We...
JCM
2006
89views more  JCM 2006»
13 years 7 months ago
A Premium Traffic Management in DiffServ Through End-to-End Delay Budget Partitioning
Our novel Call Admission Control (CAC) scheme [1], [2] determines the number of Expedited Forwarding (EF) (Premium) flows accepted, based on e2e available bandwidth measurement. Ho...
Hamada Alshaer, Eric Horlait
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 1 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
ICDCS
2005
IEEE
14 years 1 months ago
Resilient Capacity-Aware Multicast Based on Overlay Networks
The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust inter-domain multicast rout...
Zhan Zhang, Shigang Chen, Yibei Ling, Randy Chow