Sciweavers

1078 search results - page 171 / 216
» Networks with Small Stretch Number
Sort
View
SCHEDULING
2008
67views more  SCHEDULING 2008»
13 years 9 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade
SIGCOMM
2012
ACM
12 years 7 days ago
Mirror mirror on the ceiling: flexible wireless links for data centers
Modern data centers are massive, and support a range of distributed applications across potentially hundreds of server racks. As their utilization and bandwidth needs continue to ...
Xia Zhou, Zengbin Zhang, Yibo Zhu, Yubo Li, Saipri...
CCR
2004
116views more  CCR 2004»
13 years 9 months ago
An empirical study of "bogon" route advertisements
An important factor in the robustness of the interdomain routing system is whether the routers in autonomous systems (ASes) filter routes for "bogon" address space--i.e....
Nick Feamster, Jaeyeon Jung, Hari Balakrishnan
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
14 years 10 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
FOCS
2009
IEEE
14 years 4 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao