5 search results - page 1 / 1 » The Max-Flow Min-Cut theorem for countable networks |
JCT
2011
12 years 11 months ago
2011
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
SIAMCOMP
1998
13 years 4 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may...
COMCOM
2008
13 years 4 months ago
2008
Internet IP networks utilize multiple-protocol label switching (MPLS), which provides a reliable label switched path (LSP). LSP in MPLS domains needs one label at each Ingress lab...