Sciweavers

243 search results - page 14 / 49
» Congestion games with failures
Sort
View
ICISC
2008
89views Cryptology» more  ICISC 2008»
15 years 1 months ago
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Group key agreement (GKA) allows a set of players to establish a shared secret and thus bootstrap secure group communication. GKA is very useful in many types of peer group scenar...
Jihye Kim, Gene Tsudik
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
16 years 12 days ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
NETCOOP
2009
Springer
15 years 6 months ago
Control of Multipath TCP and Optimization of Multipath Routing in the Internet
There are moves in the Internet architecture community to add multipath capabilities to TCP, so that end-systems will be able to shift their traffic away from congested parts of th...
Damon Wischik, Mark Handley, Costin Raiciu
ICNP
2005
IEEE
15 years 5 months ago
On Understanding of Transient Interdomain Routing Failures
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14,15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP...
Feng Wang, Lixin Gao, Jia Wang, Jian Qiu
FGCS
2010
108views more  FGCS 2010»
14 years 10 months ago
The wandering token: Congestion avoidance of a shared resource
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...
Augusto Ciuffoletti