Sciweavers

3122 search results - page 390 / 625
» A Theory of Network Equivalence
Sort
View
IMC
2004
ACM
16 years 9 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...
SC
2003
ACM
16 years 4 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 ...
SIGCOMM
2010
ACM
15 years 7 months ago
Efficient error estimating coding: feasibility and applications
Motivated by recent emerging systems that can leverage partially correct packets in wireless networks, this paper investigates the novel concept of error estimating codes (EEC). W...
Binbin Chen, Ziling Zhou, Yuda Zhao, Haifeng Yu
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