86 search results - page 2 / 18 » Flows in dynamic networks with aggregate arc capacities |
CIAC
2010
Springer
13 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
NETWORKS
2006
13 years 5 months ago
2006
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...
ICCCN
2007
IEEE
13 years 12 months ago
2007
IEEE
—In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, Flow Aggregation outperforms Dynamic Packet State...
FGCN
2007
IEEE
13 years 7 months ago
2007
IEEE
Recently, Voice over IP (VoIP) has become an important service for the future internet. However, for ubiquitous wireless VoIP services, greater coverage will be necessary as promi...