Sciweavers

154 search results - page 18 / 31
» Routing for Relief Efforts
Sort
View
CONEXT
2008
ACM
13 years 9 months ago
MINT: a Market for INternet Transit
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
Vytautas Valancius, Nick Feamster, Ramesh Johari, ...
ENTCS
2006
173views more  ENTCS 2006»
13 years 7 months ago
Formal Security Analysis for Ad-Hoc Networks
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
Sebastian Nanz, Chris Hankin
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Robust traffic engineering: game theoretic perspective
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
Vladimir Marbukh
TOCS
2011
111views more  TOCS 2011»
13 years 2 months ago
SEATTLE: A Scalable Ethernet Architecture for Large Enterprises
IP networks today require massive effort to configure and manage. Ethernet is vastly simpler to manage, but does not scale beyond small local area networks. This paper describes ...
Changhoon Kim, Matthew Caesar, Jennifer Rexford
NSDI
2007
13 years 10 months ago
A Systematic Framework for Unearthing the Missing Links: Measurements and Impact
The lack of an accurate representation of the Internet topology at the Autonomous System (AS) level is a limiting factor in the design, simulation, and modeling efforts in inter-d...
Yihua He, Georgos Siganos, Michalis Faloutsos, Sri...