Sciweavers

366 search results - page 9 / 74
» A new model for selfish routing
Sort
View
134
Voted
ADHOC
2010
317views more  ADHOC 2010»
14 years 6 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 9 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
ISCC
2006
IEEE
128views Communications» more  ISCC 2006»
15 years 3 months ago
Adjacent 2-Route Flow Approach for Restorable Dynamic Routing in MPLS Networks
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...
Krzysztof Walkowiak
ICUMT
2009
14 years 7 months ago
A theoretical model for opportunistic routing in ad hoc networks
Traditional routing strategies for multi-hop wireless networks forward packets by selecting at the sender side the next hop for each packet. Recently, such a paradigm has been call...
Angela Sara Cacciapuoti, Marcello Caleffi, Luigi P...
JNW
2007
78views more  JNW 2007»
14 years 9 months ago
A Delay Constrained Minimum Hop Distributed Routing Algorithm using Adaptive Path Prediction
Abstract— We propose a new delay-constrained minimumhop distributed routing algorithm (DCMH) for unicastrouting. DCMH uses a novel path feasibility prediction (PFP) model that is...
Azizul R. Mohd. Shariff, Michael E. Woodward