Learn More
This paper considers the problem of scheduling real-time traffic in wireless networks. We consider ad hoc wireless networks with general conflict graph-based interference model and single-hop traffic. Each packet is associated with a deadline and will be dropped if it is not transmitted before the deadline. The number of packet arrivals in each time-slot(More)
—In many computing and networking applications, arriving tasks have to be routed to one of many servers, with the goal of minimizing queueing delays. When the number of processors is very large, a popular routing algorithm works as follows: select two servers at random and route an arriving task to the least loaded of the two. It is well-known that this(More)
— We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure (BP) algorithm achieves the maximal stability, its computational complexity is very high. In this paper, we consider LQF, a low-complexity scheduling(More)
We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoretical upper and lower bounds for general traffic. The bounds depend on(More)
— Peer-to-peer (P2P) technology has been broadly adopted in live media streaming in recent years. In this paper, we consider a P2P streaming network where a server generates content chunks, and transmits each chunk to a randomly selected peer. Peers then exchange chunks among themselves according to some chunk selection policy. While the performance of(More)
We study admission control mechanisms for wireless access networks where (i) each user has a minimum service requirement, (ii) the capacity of the access network is limited, (iii) the access point is not allowed to use monetary mechanisms to guarantee that users do not lie when disclosing their minimum service requirements, and (iv) the access point wants(More)
  • 1