Sciweavers

99 search results - page 6 / 20
» Routing Indices For Peer-to-Peer Systems
Sort
View
IOR
2002
135views more  IOR 2002»
13 years 10 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
AP2PC
2003
Springer
14 years 4 months ago
P2P MetaData Search Layers
Distributed Hashtables (DHTs) provide a scalable method of associating file-hashes with a particular location in a distributed network environment. Modifying DHTs directly to suppo...
Sam Joseph
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 4 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
ICNP
1998
IEEE
14 years 3 months ago
Statistical Anomaly Detection for Link-State Routing Protocols
The JiNao project at MCNC/NCSU focuses on detecting intrusions, especially insider attacks, against OSPF (Open Shortest Path First) routing protocol. This paper presents the imple...
D. Qu, Brain Vetter, Feiyi Wang, R. Narayan, Shyht...
IMC
2009
ACM
14 years 5 months ago
Understanding slow BGP routing table transfers
Researchers and network operators often say that BGP table transfers are slow. Despite this common knowledge, the reasons for slow BGP transfers are not well understood. This pape...
Zied Ben-Houidi, Mickael Meulle, Renata Teixeira