83 search results - page 4 / 17 » Limiting path exploration in BGP |
CN
2008
14 years 9 months ago
2008
The Internet's interdomain routing protocol, BGP, supports a complex network of Autonomous Systems which is vulnerable to a number of potentially crippling attacks. Several p...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
IPSN
2011
Springer
14 years 25 days ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
LCTRTS
1998
Springer
15 years 1 months ago
1998
Springer
Instruction scheduling is a necessary step in compiling for many modern microprocessors. Traditionally, global instruction scheduling techniques have outperformed local techniques....
KI
2001
Springer
15 years 1 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...