Sciweavers

1869 search results - page 276 / 374
» Analysis of Network Processing Workloads
Sort
View
WWW
2011
ACM
14 years 10 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi
SIGCOMM
2012
ACM
13 years 5 months ago
Perspectives on network calculus: no free lunch, but still good value
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
Florin Ciucu, Jens Schmitt
114
Voted
ICC
2009
IEEE
120views Communications» more  ICC 2009»
15 years 10 months ago
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
Soung Chang Liew, Caihong Kai, Jason Leung, Bill W...
SENSYS
2005
ACM
15 years 8 months ago
Packet combining in sensor networks
This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions o...
Henri Dubois-Ferrière, Deborah Estrin, Mart...
SIGMETRICS
2010
ACM
139views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
On the flow-level dynamics of a packet-switched network
: The packet is the fundamental unit of transportation in modern communication networks such as the Internet. Physical layer scheduling decisions are made at the level of packets, ...
Ciamac Cyrus Moallemi, Devavrat Shah