1657 search results - page 7 / 332 » Network flow spanners |
TOC
2008
14 years 9 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
102
click to vote
TCS
2010
14 years 4 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
APNOMS
2006
Springer
15 years 1 months ago
2006
Springer
We have previously proposed a diffusion-type flow control mechanism as a solution for severely time-sensitive flow control required for high-speed networks. In this mechanism, each...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
TON
2010
14 years 4 months ago
2010
This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstines...