BRAIN?an architecture for a broadband radio access network of the next generation

Urban, Josef; Wisely, Dave; Bolinth, E.; Neureiter, Georg; Liljeberg, Mika; Valladares, Tomás Robles

doi:10.1002/1530-8677(200101/03)1:1<55::aid-wcm11>3.0.co;2-i

Cited by 6 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Decision variable z sb ∈ {0, 1} is used to indicate if candidate backhaul b has been selected as the gateway for node s. Each TAP routes to only one backhaul. The total number of backhauls assigned to each TAP is 1, as in Constraint (2).…”

Section: To Determinementioning

confidence: 99%

“…To solve the TLBF routing problem, we use greedy load-balanced routing (GLBR), shown in Algorithm 2, that adds one link and connects one TAP to one of the given backhauls per iteration (line no. [1][2][3][4][5]. In detail, all link costs are initially set to infinity (line no.…”

Section: Tlbf Routing Algorithmmentioning

confidence: 99%

“…subject to Equation (2). This sub-problem, related to z sb , is further decomposed into |V | sub-problems, solved by first sorting the weights (µ 1 sb + µ 3 s ) for each node s, and then by selecting the minimum weight, thus setting z sb equal to 1 according to Equation (2). The minimum objective value of sub-problem (SUB1), summarized for all s ∈ V .…”

Section: Appendix : the Six Sub-problems Of Backhaul Assignment Plus mentioning

confidence: 99%

See 2 more Smart Citations

Fair inter‐TAP routing and backhaul assignment for wireless mesh networks

Lin

Wen

2008

Wireless Communications

View full text Add to dashboard Cite

Although limiting the number of backhauls, specifically chosen transit access points (TAPs) that forward traffic from other TAPs, reduces the overall costs of a wireless mesh network (WMN), an egress bottleneck is induced, which aggregates traffic and limits the bandwidth. To avoid such problems while working to minimize budgetary expenses, we balanced traffic flow on 'to-be-determined' backhauls and adjacent links, a mixed nonlinear-and integer-programming problem that minimizes the aggregated flow subject to budget, backhaul assignment, top-level load-balanced routing, and link capacity constraints. Two algorithms are proposed, weighted backhaul assignment (WBA) and greedy load-balanced routing (GLBR), that operate in conjunction with Lagrangean relaxation (LR), used for constructing LR-based heuristics and also as a means of quantification and evaluation of the proposed algorithms. Experiment results show that the proposed algorithms achieve near-optimization, outperforming related solutions.

show abstract

Section: To Determinementioning

confidence: 99%

Section: Tlbf Routing Algorithmmentioning

confidence: 99%

Section: Appendix : the Six Sub-problems Of Backhaul Assignment Plus mentioning

confidence: 99%

See 1 more Smart Citation

Fair inter‐TAP routing and backhaul assignment for wireless mesh networks

Lin

Wen

2008

Wireless Communications

View full text Add to dashboard Cite

show abstract

Untitled

Cheng

Cao

Wang

et al. 2009

Wireless Communications

View full text Add to dashboard Cite

Research Challenges in Mobility and Moving Networks: An Ambient Networks View

Typpö

Eisl

Höller

et al.

IFIP International Federation for Information Processing

View full text Add to dashboard Cite

Abstract:This paper aims to address the deficiencies of current internetworking to support mobility and moving networks. We present a novel approach to consider networking in general -the concept of Ambient Networks 1 -and discuss related mobility problems. We bring forth several challenges for future research demanding an architectural approach in order to reach a solution in a uniform, efficient, and integrated fashion.

show abstract

BRAIN?an architecture for a broadband radio access network of the next generation

Cited by 6 publications

References 2 publications

Fair inter‐TAP routing and backhaul assignment for wireless mesh networks

Fair inter‐TAP routing and backhaul assignment for wireless mesh networks

Untitled

Research Challenges in Mobility and Moving Networks: An Ambient Networks View

Contact Info

Product

Resources

About