Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
From MaRDI portal
Publication:975045
DOI10.1016/j.comnet.2009.10.001zbMath1209.68063OpenAlexW1993878356MaRDI QIDQ975045
Gagan Raj Gupta, Ness B. Shroff
Publication date: 8 June 2010
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comnet.2009.10.001
partitionstabilityschedulingmixed integer programmingwireless networks\(K\)-hop interferencethroughput guarantee
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Asymptotically tight steady-state queue length bounds implied by drift conditions ⋮ Online self-organizing network control with time averaged weighted throughput objective
This page was built for publication: Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
