A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Multi-Commodity Flow with In-Network Processing
[article]
2018
arXiv
pre-print
Preserved Fulltext
This extra flexibility fundamentally changes the optimization problem the network administrators must solve to a new kind of multi-commodity flow problem, where the traffic flows consume bandwidth on the ...
In an industry trend known as Network Functions Virtualization (NFV), these middleboxes run as virtual machines on any commodity server, and the switches steer traffic through the relevant chain of services ...
XX:10 Multi-Commodity Flow with In-Network Processing † 1, corresponding to a fully utilized edge. ...
arXiv:1802.09118v1
fatcat:6rwj6besfnd2jildrcgar6olri
Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow Routing
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Introduction In the concurrent multi-commodity flow problem, we are given a capacitated network G = (V, E) of switches V connected by links E, and a set of commodities K = {(s i , t i , d i )}. ...
A solution for general networks poses an intriguing open problem.
Existing Models: Theory vs. Practice Prior solutions to the multi-commodity flow problem fall in one of three models. ...
doi:10.1007/978-3-642-24100-0_20
fatcat:h6q4432vofbd7e6naz35x7j2bq
Page 97 of Management Science Vol. 5, Issue 1
[page]
1958
Management Science
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Introduction
A problem of some importance in applications of linear programming is the determination of maximal multi-commodity flows in networks. ...
A SUGGESTED COMPUTATION FOR MAXIMAL MULTI- COMMODITY NETWORK FLOWS*
L. R. FORD, JR. anp D. R. ...
Quickest Multi-Commodity Flow Over Time with Partial Lane Reversals
2020
Journal of Mathematics and Statistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The general multi-commodity and quickest multicommodity flow problems are computationally hard. ...
Among them, the quickest multicommodity flow problem concerns with minimization of time taken to complete this process. ...
Input: Given a multi-commodity flow network N = (V, A, K, u, τ, di, S, D, T) Output: The quickest multi-commodity flow with partial lane reversals: 1. ...
doi:10.3844/jmssp.2020.198.211
fatcat:atxl4oz6xjf5jebc3whvykqf3u
Approximate Algorithms for Continuous-Time Quickest Multi-Commodity Contraflow Problem
2020
The Nepali Mathematical Sciences Report
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The quickest multi-commodity flow problem deals with the minimization of time satisfying given demand. Ingeneral, the quickest multi-commodity flow problems are computationally hard. ...
Multi-commodity flow problem appears when several distinct commodities are shipped from supply nodes to the demand nodes through a network without violating the capacity constraints. ...
algorithm of [8] for quickest multi-commodity flow problem with bounded cost on auxiliary network. ...
doi:10.3126/nmsr.v37i1-2.34068
fatcat:ltwi2xy76jcytg6kmveiq54dwe
Multi-Commodity Network Flow Model Applied to Waste Processing Cost Analysis for Producers
2015
Chemical Engineering Transactions
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The model follows principle ideas of multi-commodity network flow modelling. It is implemented in GAMS and presented through a case study. ...
In this paper, we deal with a network flow problem where waste is transported from producers (municipalities) through pre-processing facilities to its final treatment. ...
CZ.1.07/2.3.00/30.0039 "Excellent young researchers at Brno University of Technology", further with financial support from the MEYS under the National Sustainability Programme I (Project LO1202) and financial ...
doi:10.3303/cet1545123
doaj:050feef5748c457d98d1f721cf2e4fee
fatcat:qektdtub6zfh7pi5kpsooq7ttm
A Suggested Computation for Maximal Multi-Commodity Network Flows
1958
Management science
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A SUGGESTED COMPUTATION FOR MAXIMAL MULTI- COMMODITY NETWORK FLOWS*
L. R. FORD, JR. anp D. R. ...
Introduction
A problem of some importance in applications of linear programming is the determination of maximal multi-commodity flows in networks. ...
doi:10.1287/mnsc.5.1.97
fatcat:gomcvql7evhhdka3v2kzy53cpm
Routing Optimization of Small Satellite Networks based on Multi-commodity Flow
2017
EAI Endorsed Transactions on Ambient Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We apply the traditional time-expanded graph to model the data acquisition of small satellite network so that we can formulate the data acquisition into a multi-commodity concurrent flow optimization problem ...
selection of routing optimization in small satellite network node communication. ...
which is equivalent to multi-commodity flow problem (MCP). ...
doi:10.4108/eai.8-12-2017.153459
fatcat:3zq3oaigbvgajegmzeouoqhx34
Routing Optimization of Small Satellite Networks Based on Multi-commodity Flow
[chapter]
2018
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We apply the traditional time-expanded graph to model the data acquisition of small satellite network so that we can formulate the data acquisition into a multi-commodity concurrent flow optimization problem ...
selection of routing optimization in small satellite network node communication. ...
which is equivalent to multi-commodity flow problem (MCP). ...
doi:10.1007/978-3-319-73564-1_35
fatcat:iclastk2lvbn5goml5c4ipasuq
New methods for multi-commodity flows
1990
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A~traet--Multi-commodity flow problems arise naturally in telecommunications and scheduling. ...
New theoretical work by Soviet researchers on network-based techniques is shown in this paper to yield practical algorithms which enable certain types of multi-commodity flow problems to be solved quickly ...
Acknowledgement--This research was supported in part by an Australian Telecommunications and Electronic Research Board Scholarship. ...
doi:10.1016/0898-1221(90)90066-s
fatcat:44ji6ur5avg4rat3nvwgsztxte
An Approximation Algorithm for Path Computation and Function Placement in SDNs
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Function mapping refers to the assignment of nodes in the substrate network to various processing stages that requests must undergo. ...
be partly served and flow may be split along multiple paths). ...
Given an instance F = {f i } i∈I of a fractional multi-commodity flow with demands and benefits, we are interested in finding an all-or-nothing unsplittable multi-commodity flow F = {f i } i∈I such that ...
arXiv:1603.09158v1
fatcat:rf5f2rvgnjemfcyh6oekmopvgy
Augmenting anycast network flows
2016
Proceedings of the 17th International Conference on Distributed Computing and Networking - ICDCN '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
While augmenting s-t flows of a single commodity is a well-understood concept, we study updating flows in a multi-commodity setting: Given a directed network with flows of different commodities, how can ...
Updating network flows in a real-world setting is a nascent research area, especially with the recent rise of Software Defined Networks. ...
Let N be a network, let K = (K1, . . . , K k ) be a multi-commodity, and fix some i ∈ N with 1 ≤ i ≤ k. ...
doi:10.1145/2833312.2833450
dblp:conf/icdcn/BrandtFW16
fatcat:sdk37gdu6ja4fiwagbixfq6d34
Inefficiency in Networks with Multiple Sources and Sinks
[chapter]
2009
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Here we study the price of anarchy in multi-commodity networks, (i.e., networks where traffic simultaneously flows between different origins and destinations). ...
We study the problem of optimizing traffic in decentralized transportation networks, where the cost of a link depends on its congestion. ...
Unfortunately, flows in human transportation networks or in the Internet fall in this class of so-called "multi-commodity flows". ...
doi:10.1007/978-3-642-02466-5_32
fatcat:7ujdbji2dvhidfk2wtgxlqwnz4
A Min-Max multi-commodity flow model for wireless body area networks routing
2012
2012 IEEE Consumer Communications and Networking Conference (CCNC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a Min-Max multi-commodity flow model for WBSNs which allows to prevent sensor node saturation, by imposing an equilibrium use of sensors during the routing process taking into ...
in wireless sensor networks might not be efficient in WBSNs. ...
MULTI-COMMODITY FLOW FORMULATION The multi-commodity network flow problem is one of the best-known problems in network optimization [1] . ...
doi:10.1109/ccnc.2012.6180996
dblp:conf/ccnc/MounglaTSM12
fatcat:szjradqfj5alhldx6zcccwy7rq
EVALUATION OF DUAL DECOMPOSITION AS A METHOD OF SIMULTANEOUS ROUTING AND RESOURCE ALLOCATION (SRRA)
2015
ELK Asia Pacific Journal of Project Management and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Multi-commodity Flow issues with capacities of fixed line: The capacities are generally fixed in traditional issues of multi-commodity network flow and one is to reduce certain convex function of the variables ...
The author utilized a capacitated model of multi-commodity flow to explain the flows of data in network. ...
doi:10.16962/eapjpmc/issn.2394-9376/2015/v1i1.03
fatcat:ks4mrh5qebcrridkidkkrxhqca
« Previous
Showing results 1 — 15 out of 68,198 results