Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

Allalouf, Miriam; Shavitt, Yuval

doi:10.1109/tnet.2007.905605

Cited by 52 publications

(32 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the nonsplittable case [5], [6], a MMF distribution of resources (bandwidth) to connections is done for fixed single path routing. In the splittable (multipath) MMF routing case, the traffic demands are allowed to be split among multiple flows (paths) [7][8][9]. Multipath routing has long been recognized as an effective strategy to achieve load balancing and increase reliability.…”

Section: A Interference and Fairness In Routingmentioning

confidence: 99%

“…Thus, this constraint and the solutions obtained in this paper are pertinent for static wireless networks. 7 that each user and relay node has fixed transmission power, P max , where the P max value is different for the user and relay nodes. Node power level determines the transmission range and interference range which in turn determines the SINR of a specific transmission from that node.…”

Section: Contributions and Organizationmentioning

confidence: 99%

See 1 more Smart Citation

Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks

Thulasiraman

Chen

Shen

2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

In this paper, we investigate the problem of flow routing and fair bandwidth allocation under interference constraints for multihop wireless networks. We first develop a novel isotonic routing metric, RI 3 M , considering the influence of inter-flow and intra-flow interference. The isotonicity of the routing metric is proved using virtual network decomposition. Second, in order to ensure QoS, an interference-aware max-min fair bandwidth allocation algorithm, LMX:M 3 F , is proposed where multiple paths (determined by using the routing metric) coexist for each user to the base station. In order to solve the algorithm, we develop an optimization formulation that is modeled as a multicommodity flow problem where the lexicographically largest bandwidth allocation vector is found among all optimal allocation vectors while considering constraints of interference on the flows. We compare our RI 3 M routing metric and LMX:M 3 F bandwidth allocation algorithm with various interference based routing metrics and interference aware bandwidth allocation algorithms established in the literature. We show that RI 3 M and LMX:M 3 F succeed in improving network performance in terms of delay, packet loss ratio and bandwidth usage.

show abstract

Section: A Interference and Fairness In Routingmentioning

confidence: 99%

Section: Contributions and Organizationmentioning

confidence: 99%

Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks

Thulasiraman

Chen

Shen

2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…They considered both the static and dynamic bandwidth provisioning models and their study takes into account various factors such as QoS, traffic demand distributions, and bandwidth costs. Allalouf et al [27] presented centralized and distributed algorithms for finding an optimal global per-commodity max-min fair rate vector in a network with multiple source-demand pairs.…”

Section: Related Workmentioning

confidence: 99%

Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas

Kasiviswanathan

Zhao

Vasudevan

et al. 2011

Pervasive and Mobile Computing

View full text Add to dashboard Cite

a b s t r a c tMotivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a set of subscribers and one or more access points possessing directional antennas, we formalize the problem of orienting these antennas in two fundamental settings: (i) subscribercentric, where the objective is to fairly allocate bandwidth among the subscribers and (ii) provider-centric, where the objective is to maximize the revenue generated by satisfying the bandwidth requirements of subscribers. For both the problems, we first design algorithms for a network with only one access point working under the assumption that the number of antennas does not exceed the number of non-interfering channels. Using the well-regarded lexicographic max-min fair allocation as the objective for a subscribercentric network, we present a dynamic programming algorithm that achieves the fairest allocation. For a provider-centric network, the allocation problem turns out to be NP-hard. We present a greedy heuristic-based algorithm that guarantees almost half of the optimum revenue. We later enhance both these algorithms to operate in more general networks with multiple access points and no restrictions on the relative numbers of antennas and channels. A simulation-based evaluation using OPNET demonstrates the efficacy of our approaches and provides us further insights into these problems.Published by Elsevier B.V.

show abstract

“…They provided a simple algorithm using flow (i.e., throughput) as the performance function for each source-destination pair. Allalouf and Shavitt [1] and Pioro and Medhi [38] (Chapter 8) present various models for equitable multicommodity flows in networks. The algorithms for problems in which the routing is not fixed are quite complicated and require repeated solutions of large linear or nonlinear programs.…”

Section: Related Equitable Network Flow Problemsmentioning

confidence: 99%

“…Note that by Proposition 2, V a 2 (2) ≥ V a 1 (1), where links a 1 and a 2 are the bottleneck links in iterations 1 and 2, respectively. Solving the reduced problem is justified since V a 2 (2) ≥ V a 1 (1) implies that the performance function values of all variables that will be fixed at the second iteration are equal to or larger than V a 1 (1), whereas the performance function values of all variables that were fixed at the first iteration above their lower bound are equal to V a 1 (1). Hence, Proposition 1 holds for the reduced problem with link a 1 being replaced by link a 2 , and the variables fixed in Steps 3-5 of the second iteration are at their minimal optimal values.…”

Section: Proof Of Propositionmentioning

confidence: 99%

Equitable bandwidth allocation in content distribution networks

Luss¹

2010

Naval Research Logistics

View full text Add to dashboard Cite

Applications for content distribution over networks, such as Video-on-Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree-like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single-link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration.

show abstract

Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

Cited by 52 publications

References 21 publications

Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks

Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks

Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas

Equitable bandwidth allocation in content distribution networks

Contact Info

Product

Resources

About