Joint Flow Control, Capacity Allocation and Routing Strategy to Achieve End-to-end Delay and Throughput Fairness in Wireless Mesh Networks
Date Issued
2010
Date
2010
Author(s)
Li, Yi-Wei
Abstract
Wireless mesh networks provide connectivity to communities and act as a solution for last-mile broadband Internet access. By improvements of routers and gateways, service region expands much broader than before. Fairness, which is an important issue since Internet has been researched, is our objective subject to the capacity of equipments. The hop count from client to gateway influences the performance. A more hop count may experience lower quality of service (QoS) and even starvation. In this thesis, we focus on capacity allocation, flow control and routing to achieve end-to-end fairness.
This end-to-end fairness problem is formulated as a mathematical programming model and then deal with by an optimization-based algorithm. In this thesis, two important performance metrics, end-to-end delay and throughput are discussed. Several decision variables need to be determined where a certain level of QoS requirements is satisfied. We purpose a two-phased heuristic to ensure end-to-end delay and throughput fairness.
To solve this problem, the Lagrangean Relaxation method is introduced to decompose the primal problem into several subproblems and we also adopt the subgradient method to obtain a reasonable lower bound. Further, we show the efficiency and effectiveness of the purposed algorithm by computational experiments.
Subjects
Flow control
Capacity Allocation
Routing
End-to-end Fairness
Mathematical Programming
Optimization
Lagrangean Relaxation
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-99-R97725036-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):cf310550213da177ffcfc6ac20098292