2015
DOI: 10.1016/j.adhoc.2014.07.021
|View full text |Cite
|
Sign up to set email alerts
|

Experimental evaluation of self-organized backpressure routing in a wireless mesh backhaul of small cells

Abstract: Small cells (SC) are low-power base stations designed to cope with the anticipated huge traffic growth of mobile communications. These increasing capacity requirements require the corresponding backhaul capacity to transport traffic from/to the core network. Since it is unlikely that fiber reaches every SC, a wireless mesh backhaul amongst SCs is expected to become popular. These low-cost deployments require to balance resource consumption amongst SCs, however, current routing protocols were not designed to fu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
2
1

Relationship

3
4

Authors

Journals

citations
Cited by 10 publications
(16 citation statements)
references
References 23 publications
0
16
0
Order By: Relevance
“…The backpressure algorithm was afterwards extended by Neely and Modiano [13], proposing to combine the previous scheme with a drift-plus-penalty technique to optimize the performance of wireless multi-hop networks. The theoretical strengths derived from this work have recently increased the interest on practical implementations in the context of wireless multi-hop backhauls [10], [11]. Experimental and simulation results showed that the resulting distributed backpressure routing strategy attains an even network resource consumption in a non-SDN wireless backhaul, where each SC participates in the distributed control plane.…”
Section: A Backpressure Conceptmentioning
confidence: 83%
See 2 more Smart Citations
“…The backpressure algorithm was afterwards extended by Neely and Modiano [13], proposing to combine the previous scheme with a drift-plus-penalty technique to optimize the performance of wireless multi-hop networks. The theoretical strengths derived from this work have recently increased the interest on practical implementations in the context of wireless multi-hop backhauls [10], [11]. Experimental and simulation results showed that the resulting distributed backpressure routing strategy attains an even network resource consumption in a non-SDN wireless backhaul, where each SC participates in the distributed control plane.…”
Section: A Backpressure Conceptmentioning
confidence: 83%
“…For this reason, backpressure routing is able to exploit several paths between source and destination SCs. Practical extensions of backpressure has been developed in legacy distributed wireless multi-hop backhauls [10], [11].…”
Section: Fig 1: Software-defined Wireless Backhaulmentioning
confidence: 99%
See 1 more Smart Citation
“…For validating incremental progress related to solving the problem of traffic splitting, a comparison between classical approach (OSPF) and proposed work (FLCS) was conducted by multiple experiments using NS-3 [18][19][20][21][22][23][24][25][26]. We have performed a group of simulations in the scenario composed of MPLS-TE together with constraint based routing.…”
Section: Simulation Analysis and Resultsmentioning
confidence: 99%
“…The relative importance of each component is adjusted dynamically by means of a parameter that finds the best trade-off between congestion avoidance and path length. The design of BP-MR started with the necessity of extending the operation and mitigate the inefficiencies of BP [20], a decentralized flavor of the original backpressure algorithm [9], towards routing LTE traffic (TCP and UDP) through heterogeneus wireless backhauls technologies forming sparse backhauls. To tackle sparse backhauls, Backpressure for Sparse Deployments (BS) [21] added a penalty function able to overcome dead ends in a scalable and decentralized way.…”
Section: Bp-mr Backgroundmentioning
confidence: 99%