Filters








102 Hits in 3.3 sec

Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows [chapter]

Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal
2015 Lecture Notes in Computer Science  
In the well-studied Unsplittable Flow on a Path problem (UFP), we are given a path graph with edge capacities.  ...  We present a QPTAS for twUFP with quasi-polynomial demands and under the Bounded Time-Window Assumption, i.e. assuming that the time window size of each job is within a constant factor from its processing  ...  The authors wish to thank Andreas Wiese for very helpful discussions about UFP and related problems.  ... 
doi:10.1007/978-3-319-28684-6_2 fatcat:pdfqwha3rjgwjawepg4up4piwy

ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping

Mosharaf Chowdhury, Muntasir Raihan Rahman, Raouf Boutaba
2012 IEEE/ACM Transactions on Networking  
We also present a generalized window-based VN embedding algorithm (WiNE) to evaluate the effect of lookahead on VN embedding.  ...  Our simulation experiments on a large mix of VN requests show that the proposed algorithms increase the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the  ...  Zhang for their suggestions.  ... 
doi:10.1109/tnet.2011.2159308 fatcat:myjw3pxqp5dvvhlgyeypcmg6z4

A Path Generation Approach to Embedding of Virtual Networks

Rashid Mijumbi, Joan Serrat, Juan-Luis Gorricho, Raouf Boutaba
2015 IEEE Transactions on Network and Service Management  
This paper proposes a one-shot, unsplittable flow VNE solution based on column generation.  ...  approaches in terms of VN acceptance ratio and average Substrate Network (SN) resource utilization, and a considerable improvement (92% for a SN of 50 nodes) in time complexity compared to the optimal  ...  solutions. • A path generation-based approach for unsplittable flows that significantly improves the time complexity of the embedding compared to the optimal solution.  ... 
doi:10.1109/tnsm.2015.2459073 fatcat:vl3nglzwlzet3arzcjq2vzqzca

Cost-Efficient NFV-Enabled Mobile Edge-Cloud for Low Latency Mobile Applications

Binxu Yang, Wei Koong Chai, Zichuan Xu, Konstantinos V. Katsaros, George Pavlou
2018 IEEE Transactions on Network and Service Management  
Index Terms-Mobile edge-cloud, low latency applications, dynamic resource allocation, approximation algorithm.  ...  We propose a dynamic resource allocation framework that consists of a fast heuristic-based incremental allocation mechanism that dynamically performs resource allocation and a reoptimization algorithm  ...  Next, PARTITION iteratively applies augmenting path algorithm to find a feasible (e.g., conforms to augmented link capacities) unsplittable path for each AP.  ... 
doi:10.1109/tnsm.2018.2790081 fatcat:mzqpvkgpt5egrbgeq5bqhfb6ay

Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial

Dritan Nace, Michal Pioro
2008 IEEE Communications Surveys and Tutorials  
We first introduce a theoretical background for the MMF problem and discuss its relation to lexicographic optimization.  ...  We next present resolution algorithms for the MMF optimization, and then give some applications to telecommunication networks, more particularly to routing, load-balancing, and network design.  ...  is happening. 2 Based on the principle of AIMD, a TCP connection probes for extra bandwidth by increasing its congestion window linearly with time, and on detecting congestion, reducing its window multiplicatively  ... 
doi:10.1109/surv.2008.080403 fatcat:7qulajxbtvgfxhb6mcr5j4yoem

Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors

Naveen Garg, Klaus Jansen, Anup Rao, José D. P. Rolim, Marc Herbstritt
2015 International Workshop on Approximation Algorithms for Combinatorial Optimization  
LIPIcs is a series of high-quality conference proceedings across all fields in informatics.  ...  Approximating Hit Rate Curves using Streaming Algorithms Zachary Drudi, Nicholas J. A.  ...  On Linear Programming Relaxations for Unsplittable Flow in Trees Zachary Friggstad and Zhihan Gao . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  ... 
doi:10.4230/lipics.approx-random.2015.i dblp:conf/approx/X15 fatcat:ytt7ulz76rfatdvpnqyhzqsf5y

Exact and Heuristic Data Workflow Placement Algorithms for Big Data Computing in Cloud Datacenters

Sonia Ikken, Eric Renault, Abdelkamel Tari, Tahar Kechadi
2018 Scalable Computing : Practice and Experience  
To solve the problem of unsplittable intermediate data placement, we propose a greedy heuristic algorithm based on a network flow optimisation framework.  ...  This gives rise to new issues when selecting distributed data and storage resources so that the execution of applications is on time, and resource usage-cost-efficient.  ...  Since the splittable exact algorithm is a relaxation of the unsplittable heuristic algorithm, a feasible solution is assumed for the splittable exact algorithm which is fractional feasible flow f 0 that  ... 
doi:10.12694/scpe.v19i3.1365 fatcat:q32bujgwwff5bojbxvrmndw5cq

iREX: efficient automation architecture for the deployment of inter-domain QoS policy

A. Yahaya, T. Harks, T. Suda
2008 IEEE Transactions on Network and Service Management  
We compare the efficiency of the iREX architecture with optimal solutions derived from unsplittable and splittable multi-commodity flow optimization models.  ...  We then complement the analytical model with a numerical study using simulations.  ...  Each graph in this section has two curves, which show the efficiency loss with respect to a solution that uses splittable flow, and one that only uses a unsplittable flow.  ... 
doi:10.1109/tnsm.2008.080105 fatcat:kgxxsaia2jadnm7xftrkn7vkoa

A logarithmic approximation for unsplittable flow on line graphs

Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
2014 ACM Transactions on Algorithms  
We consider the unsplittable flow problem on a line. In this problem, we are given a set of n tasks, each specified by a start time si, an end time ti, a demand di > 0, and a profit pi > 0.  ...  In this paper, we present the first polynomial-time O(log n)-approximation algorithm for this problem. No polynomial-time o(n)-approximation was known prior to this work.  ...  The first constant approximation algorithm for ucufp on line graphs was provided by [18] . The approximation ratio was later improved in a series of papers [5, 7] to (2 + ǫ).  ... 
doi:10.1145/2532645 fatcat:fiilucltyvegjhu6kmvuwg7roe

A logarithmic approximation for unsplittable flow on line graphs [chapter]

Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
We consider the unsplittable flow problem on a line. In this problem, we are given a set of n tasks, each specified by a start time si, an end time ti, a demand di > 0, and a profit pi > 0.  ...  In this paper, we present the first polynomial-time O(log n)-approximation algorithm for this problem. No polynomial-time o(n)-approximation was known prior to this work.  ...  The first constant approximation algorithm for ucufp on line graphs was provided by [18] . The approximation ratio was later improved in a series of papers [5, 7] to (2 + ǫ).  ... 
doi:10.1137/1.9781611973068.77 fatcat:em73to7zwzfxtar6fa476727ee

Selfish routing and wavelength assignment strategies with advance reservation in inter-domain optical networks

Francesco Palmieri, Ugo Fiore, Sergio Ricciardi
2012 Computer Communications  
On this concept, we developed a selfish adaptive RWA model supporting advance reservation in large-scale optical wavelength-routed networks and developed a distributed algorithm to compute approximate  ...  equilibria in computationally feasible times.  ...  The flow may be unsplittable, in which case each player must choose a single path for its entire flow, or splittable, if the opposite is true.  ... 
doi:10.1016/j.comcom.2011.10.010 fatcat:rcxlygpifjhgbb4yrxqbiw6zba

NeuRoute: Predictive Dynamic Routing for Software-Defined Networks [article]

Abdelhadi Azzouni, Raouf Boutaba, Guy Pujolle
2017 arXiv   pre-print
Current SDN/OpenFlow controllers use a default routing based on Dijkstra algorithm for shortest paths, and provide APIs to develop custom routing applications.  ...  This paper introduces NeuRoute, a dynamic routing framework for Software Defined Networks (SDN) entirely based on machine learning, specifically, Neural Networks.  ...  A fully polynomial-time approximation scheme for a flow maximization problem is an algorithm that, given an accuracy parameter > 0, computes, in polynomial time in the size of the input and 1/ , a solution  ... 
arXiv:1709.06002v1 fatcat:labdqhqnv5gsbljr7cy2r2axce

Exploiting Dynamic Voltage and Frequency Scaling in networks on chip

Andrea Bianco, Paolo Giaccone, Nanfang Li
2012 2012 IEEE 13th International Conference on High Performance Switching and Routing  
A Network on Chip (NoC) provides the interconnection among Processing Elements (PEs) through routers, which permit hop-by-hop communications between PEs.  ...  This paper considers a Manhattan-like mesh (grid) NoC topology.  ...  The approach is compatible with the traffic being stationary over a time window large enough to amortize the voltage/frequency reconfiguration overhead during such time window.  ... 
doi:10.1109/hpsr.2012.6260855 dblp:conf/hpsr/BiancoGL12 fatcat:l3n4odpr2jddrksy7pw6fnogju

Rethinking virtual network embedding

Minlan Yu, Yung Yi, Jennifer Rexford, Mung Chiang
2008 Computer communication review  
Our simulation experiments show that path splitting, path migration, and customized embedding algorithms enable a substrate network to satisfy a much larger mix of virtual networks.  ...  Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure.  ...  Unfortunately, node-remapping is difficult to perform for the unsplittable virtual links, since the embedding algorithm processes one virtual link at a time.  ... 
doi:10.1145/1355734.1355737 fatcat:gfwmrrhlpbasvhgtjzlhdc5a64

A Modular Simulation Tool of an Orchestrator for Allocating Virtual Resources in SDN

Aurelio Javier García, Cristina Cervelló-Pastor, Yury Jiménez
2014 International Journal of Modeling and Optimization  
For each one of these phases, researchers have developed algorithms, being possible to obtain different results combining them.  ...  The simulator is a test-bed in which researchers can select the appropriate algorithm in each phase and display the results in a graphical form, while obtaining a performance evaluation of the selected  ...  The class ShortPath implements the shortest distance path algorithm (Dijkstra's algorithm) for cases of unsplittable flows [9] .  ... 
doi:10.7763/ijmo.2014.v4.352 fatcat:nj2myuk2dbhppcifm5k5nxdnrm
« Previous Showing results 1 — 15 out of 102 results