Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
We study the problem of throughput maximization in multihop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O(\log\Delta-{m}/\log\log\Δ{m}) of the maximum, so that the per-session (end-to-end) delay is O(((Δ{m}/Δ- {m})Δ(c))^{2}) , where Δ{m}=\max-{c}{Δ(c)} ; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge. © 2013 IEEE.
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Raymond Wu, Jie Lu
ITA Conference 2007
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems