2349 search results - page 272 / 470 » Performing time-sensitive network experiments |
144
Voted
DSN
2009
IEEE
15 years 10 months ago
2009
IEEE
Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. They are also considered highly flexible, namely tunab...
152
Voted
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased ro...
130
click to vote
NETGAMES
2006
ACM
15 years 10 months ago
2006
ACM
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
138
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
134
click to vote
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...