The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Truthful Unsplittable Flow for Large Capacity Networks
2008
arXiv
pre-print
Preserved Fulltext
In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting. ...
Accordingly, we obtain a comparable performance guarantee by refining the algorithm suggested for the unsplittable flow problem. ...
a monotone PTAS for the unsplittable flow problem. ...
arXiv:0804.2112v1
fatcat:ab43uc6vgjfu7ofdwusvc2pzzm
Truthful unsplittable flow for large capacity networks
2010
ACM Transactions on Algorithms
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 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting. ...
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. ...
a monotone PTAS for the unsplittable flow problem. ...
doi:10.1145/1721837.1721852
fatcat:3zkk6n2sr5bmbpjhcouajrbeku
Truthful unsplittable flow for large capacity networks
2007
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07
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 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting. ...
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. ...
a monotone PTAS for the unsplittable flow problem. ...
doi:10.1145/1248377.1248432
dblp:conf/spaa/AzarGG07
fatcat:hjlsahn5bbfpzlvt5mjebxwpr4
Approximability of unsplittable shortest path routing problems
2009
Networks
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 the Cap-USPR problem, we seek for a minimum cost installation of integer arc capacities that admit an USPR of the given commodities. ...
Our results indicate that they are harder than the corresponding unsplittable flow or shortest multi-path routing problems. ...
The unsplittable flow routing model requires that each commodity is sent unsplit via a single path through the network. ...
doi:10.1002/net.20303
fatcat:dxvriuch7rcg3psh24k2pm46be
Approximating the single source unsplittable min-cost flow problem
2002
Mathematical programming
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 the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and ...
costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. ...
Thanks to Cliff Stein for sending us a copy of a preliminary version of [9] . We are grateful to two anonymous referees for many helpful comments. ...
doi:10.1007/s101070100260
fatcat:7ghnp6k4xfbrrewm3q5jxrxmom
On the k-Splittable Flow Problem
[chapter]
2002
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 2017; you can also visit the original URL.
The file type is application/pdf.
However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. ...
We present approximation algorithms for the single-and multi-commodity case and point out strong connections to unsplittable flows. Moreover, results on the hardness of approximation are presented. ...
We thank three anonymous referees for valuable comments that improved the readability of the paper. ...
doi:10.1007/3-540-45749-6_13
fatcat:ghoa4x5oe5b7tdrt4nqnvq2eue
The k-Splittable Flow Problem
2005
Algorithmica
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.
However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. ...
We present approximation algorithms for the single-and multi-commodity case and point out strong connections to unsplittable flows. Moreover, results on the hardness of approximation are presented. ...
We thank three anonymous referees for valuable comments that improved the readability of the paper. ...
doi:10.1007/s00453-005-1167-9
fatcat:v6eijzfwmvgtbllyhr36b3rqga
Deadline is not Enough: How to Achieve Importance-aware Server-centric Data Centers via a Cross Layer Approach
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
For improving the application throughput, recent research works have embedded application deadline information into design of network flow schedule to meet the latency requirement. ...
The proposed protocol is able to make use of the multiple disjoin paths of server-centric network, and jointly consider flow importance, flow size, and deadline to maximize the goodput of most-related ...
as a flow network for analyzing the application importance maximization problem with the constraints of network link capacity, flow conservation, and flow deadline. ...
arXiv:1302.0210v1
fatcat:am4fyz5ol5ei3moyvufpfrix4e
On the complexity of equal shortest path routing
2015
Networks
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.
In that context, the operator task is to determine the "best" link lengths, toward a goal such as maximizing the network throughput for given link capacities. ...
In this work, we show that the problem of maximizing even a single commod-$ ity flow for the OSPF-ECMP protocol cannot be approximated within any constant factor ratio. ...
for both unsplittable and splittable (with ECMP rule) routings. ...
doi:10.1002/net.21612
fatcat:thhcrag4yngqvglkswknyfinby
On the Computational Complexity and Effectiveness of N-Hub Shortest-Path Routing
2008
IEEE/ACM Transactions on Networking
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 2007; you can also visit the original URL.
The file type is application/pdf.
Our results show that N-hub Shortest-Path Routing can increase network utilization significantly even for N = 1. ...
However, we propose efficient algorithms for solving it both in the online and the offline contexts. ...
Proof: In [23] this lower bound is proven for the unsplittable multicommodity flow problem. In this proof a specific network and a specific sequence of flows are considered. ...
doi:10.1109/tnet.2007.900702
fatcat:fgciiy5azfhc7jao677td7prbu
On the Hardness of Equal Shortest Path Routing
2013
Electronic Notes in Discrete Mathematics
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.
In that context, the operator task is to determine the "best" link lengths, toward a goal such as maximizing the network throughput for given link capacities. ...
In this work, we show that the problem of maximizing even a single commodity flow for the ospfecmp protocol cannot be approximated within any constant factor ratio. ...
holds for both unsplittable and splittable (with ecmp rule) routings. ...
doi:10.1016/j.endm.2013.05.123
fatcat:csaod3q3frcjnjgdqmsy6qz6cu
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
1999
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99
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 2015; you can also visit the original URL.
The file type is application/pdf.
We show that in directed networks, for any > 0, EDP is NP-hard to approximate within m 1/2− . ...
We show that, for any > 0, bounded length EDP is hard to approximate within m 1/2− even in undirected networks, and give an O( √ m)-approximation algorithm for it. ...
Acknowledgements We are grateful to Jon Kleinberg, Stavros Kolliopoulos, andÉva Tardos for guiding us through the extensive literature on this subject. ...
doi:10.1145/301250.301262
dblp:conf/stoc/GuruswamiKRSY99
fatcat:4tld55r2r5bwjkqom7kfqakjj4
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
2003
Journal of computer and system sciences (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 2015; you can also visit the original URL.
The file type is application/pdf.
We show that in directed networks, for any > 0, EDP is NP-hard to approximate within m 1/2− . ...
We show that, for any > 0, bounded length EDP is hard to approximate within m 1/2− even in undirected networks, and give an O( √ m)-approximation algorithm for it. ...
Acknowledgements We are grateful to Jon Kleinberg, Stavros Kolliopoulos, andÉva Tardos for guiding us through the extensive literature on this subject. ...
doi:10.1016/s0022-0000(03)00066-7
fatcat:kcedpf5hffgxpbdquembi3fon4
Provisioning virtual private networks under traffic uncertainty
2006
Networks
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.
set of possible traffic matrices, sufficient capacity has to be reserved on the links of the large underlying public network so as to support all possible traffic matrices while minimizing the total reservation ...
These flow-based formulations allow to solve optimally medium-to-large-size instances with commercial MIP solvers. ...
Acknowledgments The authors would like to thank Francesco Maffioli for helpful discussions. ...
doi:10.1002/net.20145
fatcat:ve6hsukz7zflbg4dofkpm6bmbe
TRUS: Towards the Real-time Route Update Scheduling in SDN for Data Centers
2020
IEEE Access
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.
Periodically data plane update is a necessary task in Software Defined Networking(SDN). Most prior approaches update many flows without considering which flows should be updated. ...
Simulation results verify the effectiveness of our scheme and demonstrate it can largely cut down the route update latency while obtaining a good network performance when comparing with some former approaches ...
On the other hand, many works [10] , [19] use the unsplittable way for flow transmission. For simplicity, we assume each flow is carried over only one path. ...
doi:10.1109/access.2020.2986226
fatcat:cgbmw6okyvdq3ptga7c2lngfmm
« Previous
Showing results 1 — 15 out of 63 results