This paper proposes a message scheduling scheme capable of improving both throughput
and fairness on the dual-channel wireless network. Based on the time-slotted access …

Rapid growth of the Internet and multimedia applications, combined with an increasingly
ubiquitous deployment of wireless systems, has created a huge demand for providing …

We address the problem of scheduling multiple traffic streams associated with target profiles
on a shared wireless link, arising in real-time applications with soft/flexible deadline …

Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or
tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served …

We present a framework for the provision of deterministic end-to-end bandwidth guarantees
in wireless ad hoc networks. Guided by a set of local feasibility conditions, multi-hop …

In this paper, we consider the scheduling problem where data packets from K input-flows
need to be delivered to K corresponding wireless receivers over a heterogeneous wireless …

In this paper we address a seemingly simple question: Is there a universal packet
scheduling algorithm? More precisely, we analyze (both theoretically and empirically) …

In integrated services networks, the provision of Quality of Service (QoS) guarantees
depends critically upon the scheduling algorithm employed at the network layer. In this work …

It has been an important research topic since 1992 to maximize stability region in
constrained queueing systems, which includes the study of scheduling over wireless ad hoc …

In this paper, based on the classic WRR (weighted round robin) discipline, we propose an
efficient real-time traffic scheduling algorithm for WLAN (wireless local area networks). Our …