Sciweavers

226 search results - page 16 / 46
» Convergent Multi-Path Routing
Sort
View
BROADNETS
2007
IEEE
14 years 2 months ago
Assessing discreet packet-dropping attacks using nearest-neighbor and path-vector attribution
— A Mobile Ad-Hoc Network (MANET) is considered with nodes that may act selfishly or maliciously by simply dropping data packets rather than forwarding them. We study a distribu...
Arnab Das 0002, George Kesidis, Venkat Pothamsetty
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 9 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
EVOW
2009
Springer
14 years 2 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang
ICNP
2009
IEEE
14 years 2 months ago
Principles of Safe Policy Routing Dynamics
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
Sam Epstein, Karim Mattar, Ibrahim Matta
CONEXT
2006
ACM
14 years 2 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford