Sciweavers

45 search results - page 8 / 9
» Better Alternatives to OSPF Routing
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
13 years 9 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
HICSS
2007
IEEE
118views Biometrics» more  HICSS 2007»
13 years 11 months ago
On the Development of an Internetwork-Centric Defense for Scanning Worms
Studies of worm outbreaks have found that the speed of worm propagation makes manual intervention ineffective. Consequently, many automated containment mechanisms have been propos...
Scott E. Coull, Boleslaw K. Szymanski
CLUSTER
2006
IEEE
13 years 11 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
IWCMC
2006
ACM
13 years 11 months ago
Priority-based receiver-side relay election in wireless ad hoc sensor networks
Receiver-side relay election has been recently proposed as an alternative to transmitter-side relay selection in wireless ad hoc networks. In this paper we study different priori...
Komlan Egoh, Swades De
MOBIQUITOUS
2005
IEEE
13 years 11 months ago
Multi-path Admission Control for Mobile Ad hoc Networks
As wireless networks become more prevalent, users will demand the same applications that are currently available in wired networks. Further, they will expect to receive a quality ...
Anders Lindgren, Elizabeth M. Belding-Royer