Sciweavers

364 search results - page 68 / 73
» Shortest-path network interdiction
Sort
View
PODC
2003
ACM
14 years 1 months ago
Scaling properties of the Internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
CCR
2004
86views more  CCR 2004»
13 years 8 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
IANDC
2008
92views more  IANDC 2008»
13 years 8 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
PODC
2009
ACM
14 years 9 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
ICNP
2007
IEEE
14 years 2 months ago
Routing amid Colluding Attackers
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
Jakob Eriksson, Michalis Faloutsos, Srikanth V. Kr...