Joint Routing and Capacity Assignment Algorithms to Achieve Inter- and Intra-group Delay Fairness in Multi-rate Multicast Wireless Networks
Date Issued
2010
Date
2010
Author(s)
Lin, Shih-Chang
Abstract
In network applications, such as video-conferencing and e-learning, a sender might transmit data to multiple receivers. Multicasting is suitable for the kind of network applications, especially in resource-constrained wireless networks. However, as the popularity of wireless users grows up, the consequence of allocating limited resources to ensure Quality of Service, for instance, end-to-end latency constraints of transmission, becomes crucial in a multicast wireless network. So, the issue of joint routing and capacity assignment algorithms to achieve intra- and inter-group end-to-end delay fairness should also be discussed further.
In this thesis, an approach is proposed to construct a wireless multicast network to accommodate delay fairness for each user. This approach focuses on the problem of jointly considering link capacity assignment for each multicast group, and the multicast routing in intra-group end-to-end delay fairness and inter-group delay fairness. The problem is formulated to a mathematical programming problem, in which the objective is to minimize the inter-group delay among all multicast groups, thus achieving perfectly fairness. Based on Lagrangean Relaxation method and subgradient optimization technique, the Lagrangean multipliers can be adjusted and used to develop a heuristic algorithm to improve the quality of the solution. According to computational experiments, our proposed algorithm is more efficient than a compared simple algorithm.
Subjects
Wireless Networks
Multicast
End-to-End Fairness
Quality of Service
Lagrangean Relaxation Method
Optimization
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-99-R97725039-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):c588ea59632a222a5b57f7ef9792eed3