Search Sciweavers | Sciweavers

54

ICALP
2000
Springer

101views Programming Languages» more ICALP 2000»

A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols

15 years 1 months ago

We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...

Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, ...

claim paper

Read More »

50

click to vote

CRIWG
2007

63views Software Engineering» more CRIWG 2007»

Directions to Acknowledge Learners' Self-organization in CSCL Macro-scripts

14 years 11 months ago

Download membres-liglab.imag.fr

Abstract. In this article we present a conceptual analysis of the notion of learners’ selforganization in CSCL macro-scripts. We highlight that taking into account selforganizati...

Pierre Tchounikine

claim paper

Read More »

68

Voted

SODA
2004
ACM

91views Algorithms» more SODA 2004»

Competitive analysis of organization networks or multicast acknowledgement: how much to wait?

14 years 11 months ago

Download cgi.di.uoa.gr

We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...

Carlos Brito, Elias Koutsoupias, Shailesh Vaya

claim paper

Read More »

57

click to vote

WMI
2001

63views more WMI 2001»

The impact of delayed acknowledgments on TCP performance over satellite links

14 years 11 months ago

Download csusap.csu.edu.au

Tanja Lang, Daniel Floreani

claim paper