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...
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...
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...
—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...
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...
Marcel C. Castro, Peter Dely, Jonas Karlsson, Andr...