Sciweavers

4037 search results - page 346 / 808
» Routing without ordering
Sort
View
JSAC
2006
115views more  JSAC 2006»
15 years 3 months ago
Deployment of an Algorithm for Large-Scale Topology Discovery
Abstract-- Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the p...
Benoit Donnet, Philippe Raoult, Timur Friedman, Ma...
PE
2006
Springer
114views Optimization» more  PE 2006»
15 years 3 months ago
On the performance of Internet worm scanning strategies
In recent years, fast spreading worms, such as Code Red, Slammer, Blaster and Sasser, have become one of the major threats to the security of the Internet. In order to defend agai...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong
136
Voted
JCP
2007
127views more  JCP 2007»
15 years 3 months ago
Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
Abstract— Side channel attacks such as Simple Power Analysis(SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point sc...
Andrew Byrne, Nicolas Meloni, Arnaud Tisserand, Em...
148
Voted
TON
2008
125views more  TON 2008»
15 years 3 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ADHOC
2004
100views more  ADHOC 2004»
15 years 3 months ago
Position and orientation in ad hoc networks
Position and orientation information of individual nodes in ad hoc networks is useful for both service and application implementation. Services that can be enabled by availability...
Dragos Niculescu, Badri Nath