Sciweavers

909 search results - page 43 / 182
» On the approximability of some network design problems
Sort
View
MOBIHOC
2008
ACM
16 years 1 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICCCN
2007
IEEE
15 years 7 months ago
Design of a Network Service Architecture
— Considerable research efforts in the networking community are focused on defining a new Internet architecture that not only solves some of the problems of the current design, ...
Sivakumar Ganapathy, Tilman Wolf
INFOCOM
2005
IEEE
15 years 7 months ago
Designing incentives for peer-to-peer routing
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
Alberto Blanc, Yi-Kai Liu, Amin Vahdat
HIPC
2007
Springer
15 years 5 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
108
Voted
CDC
2008
IEEE
126views Control Systems» more  CDC 2008»
15 years 8 months ago
Open and emerging control problems in tokamak plasma control
— The tokamak concept for magnetic confinement of fusion plasmas is now quite mature scientifically. This maturity is evidenced by the ongoing worldwide effort to design and cons...
M. L. Walker, Eugenio Schuster, Didier Mazon, Didi...