Sciweavers

5056 search results - page 593 / 1012
» Network Coding Theory
Sort
View
IMC
2004
ACM
16 years 8 days ago
Identifying elephant flows through periodically sampled packets
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jia...
181
Voted
SC
2003
ACM
16 years 3 days ago
Synthesizing Realistic Computational Grids
Realistic workloads are essential in evaluating middleware for computational grids. One important component is the raw grid itself: a network topology graph annotated with the har...
Dong Lu, Peter A. Dinda
SPAA
2010
ACM
15 years 11 months ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
AHSWN
2010
130views more  AHSWN 2010»
15 years 7 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
AUTOMATICA
2008
104views more  AUTOMATICA 2008»
15 years 7 months ago
Communication constraints in the average consensus problem
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of aut...
Ruggero Carli, Fabio Fagnani, Alberto Speranzon, S...