Sciweavers

2343 search results - page 56 / 469
» The Locomotive Routing Problem
Sort
View
ICDCS
2009
IEEE
14 years 4 months ago
Centaur: A Hybrid Approach for Reliable Policy-Based Routing
In this paper, we consider the design of a policy-based routing system and the role that link state might play. Looking at the problem from a link-state perspective, we propose Ce...
Xin Zhang, Adrian Perrig, Hui Zhang
GLOBECOM
2008
IEEE
14 years 2 months ago
Distributed Load-Aware Routing in LEO Satellite Networks
—In this paper, we propose a lightweight distributed routing algorithm, called Distributed Load-Aware Routing (DLAR). The proposed protocol adopts a distributed approach to handl...
Evangelos Papapetrou, Fotini-Niovi Pavlidou
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 9 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
CONEXT
2009
ACM
13 years 8 months ago
Improving internet-wide routing protocols convergence with MRPC timers
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
Anthony J. Lambert, Marc-Olivier Buob, Steve Uhlig
MUE
2008
IEEE
218views Multimedia» more  MUE 2008»
14 years 2 months ago
I-SEAD: A Secure Routing Protocol for Mobile Ad Hoc Networks
Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of centralized access point. Secure Efficient Ad hoc...
Chu-Hsing Lin, Wei-Shen Lai, Yen-Lin Huang, Mei-Ch...