Sciweavers

365 search results - page 61 / 73
» Fast construction of overlay networks
Sort
View
CJ
2010
131views more  CJ 2010»
14 years 9 months ago
Probabilistic Approaches to Estimating the Quality of Information in Military Sensor Networks
an be used to abstract away from the physical reality by describing it as components that exist in discrete states with probabilistically invoked actions that change the state. The...
Duncan Gillies, David Thornley, Chatschik Bisdikia...
IMC
2006
ACM
15 years 5 months ago
Touring the internet in a TCP sidecar
An accurate router-level topology of the Internet would benefit many research areas, including network diagnosis, inter-domain traffic engineering, and overlay construction. We ...
Rob Sherwood, Neil Spring
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 6 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
CORR
2008
Springer
174views Education» more  CORR 2008»
14 years 12 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
BROADNETS
2007
IEEE
15 years 6 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta