Sciweavers

9949 search results - page 92 / 1990
» On the Network Complexity of Selection
Sort
View
NETWORKING
2004
13 years 10 months ago
LMPS: Localized Multi-path Selection for QoS Routing in VoIP Networks
Abstract. Localized QoS routing techniques were proposed to achieve acceptable performance without exchanging global state information over the network. In such techniques, the ing...
Khaled M. F. Elsayed, Hassan Fadel, Amin M. Nassar
PERCOM
2008
ACM
14 years 8 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
CONEXT
2008
ACM
13 years 10 months ago
EGOIST: overlay routing using selfish neighbor selection
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
Georgios Smaragdakis, Vassilis Lekakis, Nikolaos L...
ATAL
2003
Springer
14 years 2 months ago
Agent network topology and complexity
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
Xiaolong Jin, Jiming Liu
RAID
2007
Springer
14 years 3 months ago
Vortex: Enabling Cooperative Selective Wormholing for Network Security Systems
We present a novel approach to remote traffic aggregation for Network Intrusion Detection Systems (NIDS) called Cooperative Selective Wormholing (CSW). Our approach works by select...
John R. Lange, Peter A. Dinda, Fabián E. Bu...