Network utility maximization with heterogeneous traffic flows

  title={Network utility maximization with heterogeneous traffic flows},
  author={Abhishek Sinha and Eytan H. Modiano},
  journal={2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)},
  • Abhishek Sinha, E. Modiano
  • Published 28 February 2018
  • Computer Science, Mathematics
  • 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
We consider the Network Utility Maximization (NUM) problem for wireless networks in the presence of arbitrary types of flows, including unicast, broadcast, multicast, and anycast traffic. Building upon the recent framework of a universal control policy (UMW), we design a utility optimal cross-layer admission control, routing and scheduling policy, called UMW+. The UMW+ policy takes packet level actions based on a precedence-relaxed virtual network. Using Lyapunov optimization techniques, we… Expand
1 Throughput-Optimal Policy for Generalized Network Flow Problems
In the twenty-first century of the all-pervasive Internet, when the annual global IP traffic is expected to exceed the threshold of a Zettabyte (10 bytes), the need for efficient networking policies,Expand
Stochastic Network Utility Maximization with Unknown Utilities: Multi-Armed Bandits Approach
  • Arun Verma, M. Hanawal
  • Computer Science, Mathematics
  • IEEE INFOCOM 2020 - IEEE Conference on Computer Communications
  • 2020
This paper proposes algorithms for this novel Stochastic Network Utility Maximization problem using ideas from Multiple-Play Multi-Armed Bandits and Combinatorial Semi-Bandits and shows that the proposed algorithm is optimal when all agents have the same utility. Expand
Gaussian Belief Propagation for Solving Network Utility Maximization with Delivery Contracts
This paper investigates a method to distributively solve the given problem by first transforming the problem into an equivalent model of linear equations by dual decomposition theory, and then using Gaussian belief propagation algorithm to solve the equivalent issue distributively. Expand
Censored Semi-Bandits for Resource Allocation
This work considers the problem of sequentially allocating resources in a censored semi-bandits setup, where the learner allocates resources at each step to the arms and observes loss, and derives optimal algorithms for the problem setting using known algorithms for MP-MAB and Combinatorial Semi-Bandits. Expand
Fast and Secure Routing Algorithms for Quantum Key Distribution Networks
  • B. Vishnu, Abhishek Sinha
  • Computer Science, Physics
  • ArXiv
  • 2021
One of the main contributions in this paper is to show that the problem of secure packet routing at the maximum achievable rate in a Quantum key distribution network can be reduced to the usual generalized network flow problem on a transformed network without the key availability constraints. Expand


Optimal control for generalized network-flow problems
The proof of throughput-optimality of the UMW policy combines techniques from stochastic Lyapunov theory with a sample path argument from adversarial queueing theory and may be of independent theoretical interest. Expand
Fairness and optimal stochastic control for heterogeneous networks
The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. Expand
Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows
This work develops a dynamic control policy that determines both routes and processing locations for packets upon their arrival at a distributed computing network, and is the first throughput-optimal policy for non-unicast traffic in distributed computing networks with both communication and computation constraints. Expand
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
The stability of a queuing network with interdependent servers is considered, and the problem of scheduling server activation under the constraints imposed by the dependency among them is studied. Expand
Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
The NP-completeness of the finite-horizon broadcast problem is proved, which is in contrast with the polynomial time solvability of the problem with point-to-point channels. Expand
A tutorial on cross-layer optimization in wireless networks
It is shown that a clean-slate optimization-based approach to the multihop resource allocation problem naturally results in a "loosely coupled" cross-layer solution, and how to use imperfect scheduling in the cross- layer framework is demonstrated. Expand
Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control
This paper shows that a combination of queue-length-based scheduling at the base station and congestion control implemented either atThe base station or at the end users can lead to fair resource allocation and queue- length stability. Expand
Distributed load management algorithms in anycast-based CDNs
A fully-distributed load-management algorithm is proposed by introducing FastControl packets, which utilizes the underlying anycast mechanism itself to enable effective coordination among the nodes, thus obviating the need for any external control channel. Expand
Downlink power allocation for multi-class CDMA wireless networks
A simple distributed algorithm is proposed to obtain an approximation to the social optimal power allocation for multi-class CDMA wireless services in a unified way and it is inferred that the system utility obtained by partial-cooperative optimalPower allocation is quite close to the system Utility obtained by social optimal allocation. Expand
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
A survey of the recent efforts towards a systematic understanding of layering as optimization decomposition, where the overall communication network is modeled by a generalized network utility maximization problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems. Expand