Sciweavers

1127 search results - page 1 / 226
» New Algorithms for Generalized Network Flows
Sort
View
ISTCS
1992
Springer
13 years 10 months ago
New Algorithms for Generalized Network Flows
Edith Cohen, Nimrod Megiddo
WAOA
2010
Springer
264views Algorithms» more  WAOA 2010»
13 years 4 months ago
An FPTAS for Flows over Time with Aggregate Arc Capacities
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
Daniel Dressler, Martin Skutella
CCR
2002
112views more  CCR 2002»
13 years 6 months ago
New directions in traffic measurement and accounting
Accurate network traffic measurement is required for accounting, bandwidth provisioning and detecting DoS attacks. These applications see the traffic as a collection of flows they...
Cristian Estan, George Varghese
NETWORKS
2006
13 years 6 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran
CCS
2010
ACM
13 years 6 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...