Sciweavers

32 search results - page 2 / 7
» sigcomm 2006
Sort
View
SIGCOMM
2012
ACM
11 years 7 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
SIGCOMM
2006
ACM
13 years 11 months ago
Revisiting IP multicast
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenke...
SIGCOMM
2006
ACM
13 years 11 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
SIGCOMM
2006
ACM
13 years 11 months ago
Designing DCCP: congestion control without reliability
DCCP, the Datagram Congestion Control Protocol, is a new transport protocol in the TCP/UDP family that provides a congestion-controlled flow of unreliable datagrams. Delay-sensit...
Eddie Kohler, Mark Handley, Sally Floyd
SIGCOMM
2006
ACM
13 years 11 months ago
ROFL: routing on flat labels
It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distin...
Matthew Caesar, Tyson Condie, Jayanthkumar Kannan,...