1657 search results - page 36 / 332 » Network flow spanners |
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
COMCOM
2004
13 years 9 months ago
2004
In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of ...
NETWORKS
2007
13 years 9 months ago
2007
The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...
TCOM
2008
13 years 9 months ago
2008
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
SIGCOMM
2010
ACM
13 years 10 months ago
2010
ACM
Finding the root-cause of a network security anomaly is essential for network operators. In our recent work [1, 5], we introduced a generic technique that uses frequent itemset mi...