Sciweavers

94 search results - page 8 / 19
» Randomization in traffic information sharing systems
Sort
View
CCGRID
2010
IEEE
13 years 8 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
ELPUB
2008
ACM
13 years 9 months ago
Global annual volume of peer reviewed scholarly articles and the share available via different Open Access options
A key parameter in any discussions about the academic peer reviewed journal system is the number of articles annually published. Several diverging estimates of this parameter have...
Bo-Christer Björk, Annikki Roos, Mari Lauri
INFOCOM
2003
IEEE
14 years 1 months ago
Distributed Queueing in Scalable High Performance Routers
—This paper presents and evaluates distributed queueing algorithms for regulating the flow of traffic through large, high performance routers. Distributed queueing has a similar ...
Prashanth Pappu, Jyoti Parwatikar, Jonathan S. Tur...
QEST
2009
IEEE
14 years 2 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
PDPTA
2003
13 years 9 months ago
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
Thomas E. Portegys, Kevin M. Greenan