94,577 research outputs found
Examination of optimizing information flow in networks
The central role of the Internet and the World-Wide-Web in global communications has refocused much attention on problems involving optimizing information flow through networks. The most basic formulation of the question is called the "max flow" optimization problem: given a set of channels with prescribed capacities that connect a set of nodes in a network, how should the materials or information be distributed among the various routes to maximize the total flow rate from the source to the destination. Theory in linear programming has been well developed to solve the classic max flow problem. Modern contexts have demanded the examination of more complicated variations of the max flow problem to take new factors or constraints into consideration; these changes lead to more difficult problems where linear programming is insufficient.
In the workshop we examined models for information flow on networks that considered trade-offs between the overall network utility (or flow rate) and path diversity to ensure balanced usage of all parts of the network (and to ensure stability and robustness against local disruptions in parts of the network).
While the linear programming solution of the basic max flow problem cannot handle the current problem, the approaches primal/dual formulation for describing the constrained optimization problem can be applied to the current generation of problems, called network utility maximization (NUM) problems. In particular, primal/dual formulations have been used extensively in studies of such networks.
A key feature of the traffic-routing model we are considering is its formulation as an economic system, governed by principles of supply and demand. Considering channel capacities as a commodity of limited supply, we might suspect that a system that regulates traffic via a pricing scheme would assign prices to channels in a manner inversely proportional to their respective capacities.
Once an appropriate network optimization problem has been formulated, it remains to solve the optimization problem; this will need to be done numerically, but the process can greatly benefit from simplifications and reductions that follow from analysis of the problem. Ideally the form of the numerical solution scheme can give insight on the design of a distributed algorithm for a Transmission Control Protocol (TCP) that can be directly implemented on the network.
At the workshop we considered the optimization problems for two small prototype network topologies: the two-link network and the diamond network. These examples are small enough to be tractable during the workshop, but retain some of the key features relevant to larger networks (competing routes with different capacities from the source to the destination, and routes with overlapping channels, respectively). We have studied a gradient descent method for solving obtaining the optimal solution via the dual problem. The numerical method was implemented in MATLAB and further analysis of the dual problem and properties of the gradient method were carried out. Another thrust of the group's work was in direct simulations of information flow in these small networks via Monte Carlo simulations as a means of directly testing the efficiencies of various allocation strategies
Service Deployment Model on Shared Virtual Network Functions With Flow Partition
Network operators can operate services in a flexible way with virtual network functions thanks to the network function virtualization technology. Flow partition allows aggregated traffic to be split into multiple parts, which increases the flexibility. This paper proposes a service deployment model with flow partition to minimize the service deployment cost with meeting service delay requirements. A virtual network function of a service is allowed to have several instances, each of which hosts a part of flows and can be shared among different services, to reduce the initial and proportional cost. We provide the mathematical formulation for the proposed model and transform it to a special case as a mixed integer second-order cone programming (MISOCP) problem. A heuristic algorithm, which is called a flow partition heuristic (FPH), is introduced to solve the original problem in practical time by decomposing it into several steps; each step handles a convex problem. We compare the performances of proposed model with flow partition and conventional model without flow partition. We consider the formulated MISOCP problem with adopting a strategy of even splitting to divide flows in a special case, which is called an even spitting heuristic (ESH). The performances of FPH and ESH are compared in a realistic scenario. We also consider the formulated MISOCP problem as an original problem and compare it to an FPH-based heuristic algorithm with the even-splitting strategy (FPH-ES), in both realistic and synthetic scenarios. The numerical results reveal that the proposed model saves the service deployment cost compared to the conventional one. It improves the maximum admissible traffic scale by 23% in average in our examined cases. We observe that FPH outperforms ESH and ESH outperforms FPH-ES in terms of the service deployment cost in their own focused problems, respectively
Recommended from our members
A trust-region based sequential linear programming approach for AC optimal power flow problems
© 2018 Elsevier B.V. This study proposes a new trust-region based sequential linear programming algorithm to solve the AC optimal power flow (OPF) problem. The OPF problem is solved by linearizing the cost function, power balance and engineering constraints of the system, followed by a trust-region to control the validity of the linear model. To alleviate the problems associated with the infeasibilities of a linear approximation, a feasibility restoration phase is introduced. This phase uses the original nonlinear constraints to quickly locate a feasible point when the linear approximation is infeasible. The algorithm follows convergence criteria to satisfy the first order optimality conditions for the original OPF problem. Studies on standard IEEE systems and large-scale Polish systems show an acceptable quality of convergence to a set of best-known solutions and a substantial improvement in computational time, with linear scaling proportional to the network size.National Research Foundation, Singapore
Application-Oriented Flow Control: Fundamentals, Algorithms and Fairness
This paper is concerned with flow control and resource allocation problems in computer networks in which real-time applications may have hard quality of service (QoS) requirements. Recent optimal flow control approaches are unable to deal with these problems since QoS utility functions generally do not satisfy the strict concavity condition in real-time applications. For elastic traffic, we show that bandwidth allocations using the existing optimal flow control strategy can be quite unfair. If we consider different QoS requirements among network users, it may be undesirable to allocate bandwidth simply according to the traditional max-min fairness or proportional fairness. Instead, a network should have the ability to allocate bandwidth resources to various users, addressing their real utility requirements. For these reasons, this paper proposes a new distributed flow control algorithm for multiservice networks, where the application's utility is only assumed to be continuously increasing over the available bandwidth. In this, we show that the algorithm converges, and that at convergence, the utility achieved by each application is well balanced in a proportionally (or max-min) fair manner
Energy management in communication networks: a journey through modelling and optimization glasses
The widespread proliferation of Internet and wireless applications has
produced a significant increase of ICT energy footprint. As a response, in the
last five years, significant efforts have been undertaken to include
energy-awareness into network management. Several green networking frameworks
have been proposed by carefully managing the network routing and the power
state of network devices.
Even though approaches proposed differ based on network technologies and
sleep modes of nodes and interfaces, they all aim at tailoring the active
network resources to the varying traffic needs in order to minimize energy
consumption. From a modeling point of view, this has several commonalities with
classical network design and routing problems, even if with different
objectives and in a dynamic context.
With most researchers focused on addressing the complex and crucial
technological aspects of green networking schemes, there has been so far little
attention on understanding the modeling similarities and differences of
proposed solutions. This paper fills the gap surveying the literature with
optimization modeling glasses, following a tutorial approach that guides
through the different components of the models with a unified symbolism. A
detailed classification of the previous work based on the modeling issues
included is also proposed
A multiscale flux basis for mortar mixed discretizations of reduced Darcy-Forchheimer fracture models
In this paper, a multiscale flux basis algorithm is developed to efficiently
solve a flow problem in fractured porous media. Here, we take into account a
mixed-dimensional setting of the discrete fracture matrix model, where the
fracture network is represented as lower-dimensional object. We assume the
linear Darcy model in the rock matrix and the non-linear Forchheimer model in
the fractures. In our formulation, we are able to reformulate the
matrix-fracture problem to only the fracture network problem and, therefore,
significantly reduce the computational cost. The resulting problem is then a
non-linear interface problem that can be solved using a fixed-point or
Newton-Krylov methods, which in each iteration require several solves of Robin
problems in the surrounding rock matrices. To achieve this, the flux exchange
(a linear Robin-to-Neumann co-dimensional mapping) between the porous medium
and the fracture network is done offline by pre-computing a multiscale flux
basis that consists of the flux response from each degree of freedom on the
fracture network. This delivers a conserve for the basis that handles the
solutions in the rock matrices for each degree of freedom in the fractures
pressure space. Then, any Robin sub-domain problems are replaced by linear
combinations of the multiscale flux basis during the interface iteration. The
proposed approach is, thus, agnostic to the physical model in the fracture
network. Numerical experiments demonstrate the computational gains of
pre-computing the flux exchange between the porous medium and the fracture
network against standard non-linear domain decomposition approaches
- …