The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of designing a joint congestion control and scheduling algorithm for multihop wireless networks. The goal is to maximize the total utility and achieve low end-to-end delay simultaneously. Assume that there are M flows inside the network, and each flow m has a fixed route with Hm hops. Further, the network operates under the one-hop interference constraint. We develop a new...
We consider the downlink of an OFDM system for supporting a large number of delay-sensitive users. The OFDM scheduling problem can be modeled as a discrete-time multi-source multi-server queuing system with time-varying connectivity. For such a system, the Max-Weight policy is known to be throughput-optimal and the Server-Side Greedy (SSG) policy has been recently shown to achieve small queue lengths...
In this work, we are interested in designing scheduling algorithms for multihop wireless networks that can achieve good end-to-end delay performance. There has been evidence that some of the well-known queue-length-based throughputoptimal algorithms, such as the back-pressure algorithm, could have poor end-to-end delay performance. In particular, the end-to-end delay of the back-pressure algorithm...
While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) results have not been as forthcoming. In this paper, we study the end-to-end buffer usage (sum of buffer utilization along a flow path) over a network with general topology and with fixed, loop-free routes using a large-deviations...
We show that for a large class of scheduling algorithms, when the algorithm minimizes the drift of a Lyapunov function, the algorithm is optimal in maximizing the asymptotic decay-rate of the probability that the Lyapunov function value exceeds a large threshold. The result in this paper extends our prior results to the important and practically-useful case when the Lyapunov function is not linear...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.