Sciweavers

1639 search results - page 140 / 328
» Degree-constrained network flows
Sort
View
CCGRID
2004
IEEE
15 years 8 months ago
GTP: group transport protocol for lambda-Grids
The notion of lambda-Grids posits plentiful collections of computing and storage resources richly interconnected by dedicated dense wavelength division multiplexing (DWDM) optical...
Xinran (Ryan) Wu, Andrew A. Chien
CN
2002
116views more  CN 2002»
15 years 4 months ago
Avoiding congestion collapse on the Internet using TCP tunnels
This paper discusses the application of TCP tunnels on the Internet and how Internet traffic can benefit from the congestion control mechanism of the tunnels. Primarily, we show t...
Boon Peng Lee, Rajesh Krishna Balan, Lillykutty Ja...
OSDI
2002
ACM
16 years 4 months ago
TCP Nice: A Mechanism for Background Transfers
Many distributed applications can make use of large background transfers ? transfers of data that humans are not waiting for ? to improve availability, reliability, latency or con...
Arun Venkataramani, Ravi Kokku, Michael Dahlin
CCS
2010
ACM
15 years 4 months ago
CRAFT: a new secure congestion control architecture
Congestion control algorithms seek to optimally utilize network resources by allocating a certain rate for each user. However, malicious clients can disregard the congestion contr...
Dongho Kim, Jerry T. Chiang, Yih-Chun Hu, Adrian P...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 4 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall