Sciweavers

4037 search results - page 217 / 808
» Routing without ordering
Sort
View
MASCOTS
2001
14 years 4 days ago
PTPlan MPLS: A Tool for MPLS Network Dimensioning
This paper presents a tool for MPLS network dimensioning that allows for multi-hour dimensioning of networks supporting simultaneously peer-to-peer and client-server services. The...
Luís Cardoso, Jorge Patrão, Carlos L...
WSC
1998
14 years 3 days ago
Reactive Tabu Search in Unmanned Aerial Reconnaissance Simulations
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
Joel L. Ryan, T. Glenn Bailey, James T. Moore, Wil...
GLOBECOM
2007
IEEE
13 years 11 months ago
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
—In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The ai...
Fatiha Djemili Tolba, Damien Magoni, Pascal Lorenz
JCM
2007
79views more  JCM 2007»
13 years 10 months ago
Time Slot Assignment for Maximum Bandwidth in a Mobile Ad Hoc Network
—Time slot assignment is essential to provide the calculated bandwidth in a TDMA (Time Division Multiple Access)-based mobile ad hoc network (MANET), which is a focus of attentio...
Jianping Li, Yasushi Wakahara
JSAC
2007
155views more  JSAC 2007»
13 years 10 months ago
Semantic social overlay networks
— Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of netw...
Alexander Löser, Steffen Staab, Christoph Tem...