Sciweavers

445 search results - page 67 / 89
» Maximizable Routing Metrics
Sort
View
TCS
2008
14 years 9 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...
63
Voted
CN
2006
98views more  CN 2006»
14 years 9 months ago
Internet resiliency to attacks and failures under BGP policy routing
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...
Danny Dolev, Sugih Jamin, Osnat Mokryn, Yuval Shav...
CN
2007
87views more  CN 2007»
14 years 9 months ago
Routing and quality of service support for mobile ad hoc networks
OLSR is an optimization over classical link state protocols tailored for mobile ad hoc networks. In this paper, we propose the QOLSR protocol which includes quality parameters to ...
Anelise Munaretto, Mauro Fonseca
74
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
JSAC
2010
153views more  JSAC 2010»
14 years 4 months ago
Autonomic traffic engineering for network robustness
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
Ali Tizghadam, Alberto Leon-Garcia