Sciweavers

519 search results - page 60 / 104
» High Performance Routing in a LEO Satellite Network
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 5 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
MICRO
2010
IEEE
167views Hardware» more  MICRO 2010»
14 years 9 months ago
Erasing Core Boundaries for Robust and Configurable Performance
Single-thread performance, reliability and power efficiency are critical design challenges of future multicore systems. Although point solutions have been proposed to address thes...
Shantanu Gupta, Shuguang Feng, Amin Ansari, Scott ...
AIMS
2010
Springer
15 years 1 days ago
Adaptive Underwater Acoustic Communications
Underwater wireless networks consist of mobile and static nodes, which usually communicate using the acoustic channel since radio transmissions attenuate rapidly and optical commun...
Anuj Sehgal, Jürgen Schönwälder
IDC
2009
Springer
14 years 9 months ago
Efficient Broadcasting by Selective Forwarding
A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solu...
Doina Bein, Ajoy Kumar Datta, Balaji Ashok Sathyan...
103
Voted
BNT
1997
15 years 1 months ago
Tag-switching architecture: overview
Tag switching is a way to combine the label-swapping forwarding paradigm with network layer routing. This has several advantages. Tags can have a wide spectrum of forwarding granu...
Yakov Rekhter