Sciweavers

10284 search results - page 1922 / 2057
» Designing for nomadic work
Sort
View
SIGCOMM
2004
ACM
15 years 6 months ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown
153
Voted
SIGCOMM
2004
ACM
15 years 6 months ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...
98
Voted
SIGCSE
2004
ACM
140views Education» more  SIGCSE 2004»
15 years 6 months ago
CFX: finding just the right examples for CS1
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
Dale Reed, Sam John, Ryan Aviles, Feihong Hsu
SIGMETRICS
2004
ACM
141views Hardware» more  SIGMETRICS 2004»
15 years 6 months ago
CapProbe: a simple and accurate capacity estimation technique for wired and wireless environments
The problem of estimating the capacity of an Internet path is one of fundamental importance. Due to the multitude of potential applications, a large number of solutions have been ...
Rohit Kapoor, Ling-Jyh Chen, Alok Nandan, Mario Ge...
125
Voted
SPAA
2004
ACM
15 years 6 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
« Prev « First page 1922 / 2057 Last » Next »