Sciweavers

4052 search results - page 128 / 811
» Using RDF to describe networks
Sort
View
ENTCS
2007
78views more  ENTCS 2007»
15 years 27 days ago
PEPA Queues: Capturing Customer Behaviour in Queueing Networks
Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. ...
Ashok Argent-Katwala, Jeremy T. Bradley
MOBICOM
2010
ACM
15 years 1 months ago
Intentional networking: opportunistic exploitation of mobile network diversity
Mobile devices face a diverse and dynamic set of networking options. Using those options to the fullest requires knowledge of application intent. This paper describes Intentional ...
Brett D. Higgins, Azarias Reda, Timur Alperovich, ...
CACM
2008
84views more  CACM 2008»
15 years 1 months ago
The emergence of a networking primitive in wireless sensor networks
The wireless sensor network community approached netabstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic...
Philip Levis, Eric A. Brewer, David E. Culler, Dav...
WETICE
2008
IEEE
15 years 7 months ago
Integrating Overlay and Social Networks for Seamless P2P Networking
In this paper we introduce Social VPNs, a novel system architecture which leverages existing social networking infrastructures to enable ad-hoc VPNs which are self-configuring, s...
Renato J. O. Figueiredo, P. Oscar Boykin, Pierre S...
NCA
2005
IEEE
15 years 6 months ago
Cooperative Mobile Agents to Gather Global Information
Abstract— This paper describes an original approach to writing reactive algorithms on highly dynamic networks. We propose to use randomly mobile agents to gather global informati...
Michel Charpentier, Gérard Padiou, Philippe...