Add to ORKGCaption title.Includes bibliographical references.Supported in part by ARPA under Grant ONR/N00014-75-C-1183 National Science Foundation Grant NSF/ENG76-24447Robert G. Gallager
For an integer h ≥ 1, an elementary h-route flow is a flow along h edge disjoint paths between a sou...
Abstract—In this paper we address the issue of designing multi-path routing algorithms. Multi-path r...
The switching of addressed blocks of data through a network (message switching) is particularly suit...
Flow variation over time is an important feature in network flow problems arising in various appli...
Flow variation over time is an important feature in network flow problems arising in various applica...
Bibliography: p. 17-18."February 1984""NSF-ECS-8217668" "ONR/N00014-75-C-1183"Dimitri P. Bertsekas, ...
AbstractFlow variation over time is an important feature in network flow problems arising in various...
"10-257-77."Bibliography: p. 68-69.Supported by the U.S. Department of Transportation under contract...
The paper raises awareness of the presence of closed parasitic flow loops in the solutions of publis...
In this paper we study coordinated multipath routing at the flow-level in networks with routes of le...
International audienceGiven a network and a set of source destination pairs (connections), we consid...
AbstractWe show that if a flow network haskinput/output terminals (for the traditional maximum-flow ...
In classical network flow theory, flow being sent from a source to a destination may be split into ...
Flows over time (also called dynamic flows) generalize standard network flows by introducing an elem...
In this paper, we describe a very simple (1 + ")- approximation algorithm for the multicommodi...
For an integer h ≥ 1, an elementary h-route flow is a flow along h edge disjoint paths between a sou...
Abstract—In this paper we address the issue of designing multi-path routing algorithms. Multi-path r...
The switching of addressed blocks of data through a network (message switching) is particularly suit...
Flow variation over time is an important feature in network flow problems arising in various appli...
Flow variation over time is an important feature in network flow problems arising in various applica...
Bibliography: p. 17-18."February 1984""NSF-ECS-8217668" "ONR/N00014-75-C-1183"Dimitri P. Bertsekas, ...
AbstractFlow variation over time is an important feature in network flow problems arising in various...
"10-257-77."Bibliography: p. 68-69.Supported by the U.S. Department of Transportation under contract...
The paper raises awareness of the presence of closed parasitic flow loops in the solutions of publis...
In this paper we study coordinated multipath routing at the flow-level in networks with routes of le...
International audienceGiven a network and a set of source destination pairs (connections), we consid...
AbstractWe show that if a flow network haskinput/output terminals (for the traditional maximum-flow ...
In classical network flow theory, flow being sent from a source to a destination may be split into ...
Flows over time (also called dynamic flows) generalize standard network flows by introducing an elem...
In this paper, we describe a very simple (1 + ")- approximation algorithm for the multicommodi...
For an integer h ≥ 1, an elementary h-route flow is a flow along h edge disjoint paths between a sou...
Abstract—In this paper we address the issue of designing multi-path routing algorithms. Multi-path r...
The switching of addressed blocks of data through a network (message switching) is particularly suit...