Sciweavers

2076 search results - page 262 / 416
» Universal Routing in Distributed Networks
Sort
View
178
Voted
WINE
2010
Springer
177views Economy» more  WINE 2010»
15 years 1 months ago
Braess's Paradox in Large Sparse Graphs
Braess's paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of d...
Fan Chung, Stephen J. Young
130
Voted
ICDCS
2009
IEEE
16 years 23 days ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu
125
Voted
SGAI
2004
Springer
15 years 9 months ago
Resource Allocation in Communication Networks Using Market-Based Agents
This work describes a system that allocates end-to-end bandwidth, in a switched meshed communications network. The solution makes use of market-based software agents that compete ...
Nadim Haque, Nicholas R. Jennings, Luc Moreau
141
Voted
DAGSTUHL
2000
15 years 5 months ago
Product Form Queueing Networks
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
Simonetta Balsamo
155
Voted
SAC
2010
ACM
15 years 3 months ago
TransPeer: adaptive distributed transaction monitoring for Web2.0 applications
In emerging Web2.0 applications such as virtual worlds or social networking websites, the number of users is very important (tens of thousands), hence the amount of data to manage...
Idrissa Sarr, Hubert Naacke, Stéphane Gan&c...