CDMA: principles of spread spectrum communication
CDMA: principles of spread spectrum communication
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems
Queueing Systems: Theory and Applications
ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
Probability in the Engineering and Informational Sciences
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Optimal Routing In Output-Queued Flexible Server Systems
Probability in the Engineering and Informational Sciences
User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
QoS-guaranteed wireless packet scheduling for mixed services in HSDPA
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Stability of multi-class queueing systems with state-dependent service rates
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Dynamic power control in a fading downlink channel subject to an energy constraint
Queueing Systems: Theory and Applications
Optimal and Approximate Mobility-Assisted Opportunistic Scheduling in Cellular Networks
IEEE Transactions on Mobile Computing
Routing and scheduling in multihop wireless networks with time-varying channels
ACM Transactions on Algorithms (TALG)
Modeling, scheduling, and simulation of switched processing systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Large Deviations of Queues Sharing a Randomly Time-Varying Server
Queueing Systems: Theory and Applications
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Downlink scheduling with guarantees on the probability of short-term throughput
IEEE Transactions on Wireless Communications
Performance analysis of wireless opportunistic schedulers using stochastic Petri nets
IEEE Transactions on Wireless Communications
Delay-optimal server allocation in multiqueue multiserver systems with time-varying connectivities
IEEE Transactions on Information Theory
Flow-level performance and capacity of wireless networks with user mobility
Queueing Systems: Theory and Applications
Distributed adaptive algorithms for optimal opportunistic medium access
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Downlink scheduling for multiclass traffic in LTE
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Opportunistic scheduling of wireless links
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
On scheduling in multi-channel wireless downlink networks with limited feedback
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal feedback allocation algorithms for multi-user uplink
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Throughput optimality of delay-driven maxweight scheduler for a wireless system with flow dynamics
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Scheduling in multichannel wireless networks with flow-level dynamics
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Qualitative properties of α-weighted scheduling policies
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed cross-layer algorithms for the optimal control of multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Stable maximum throughput broadcast in wireless fading channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fair scheduling in cellular systems in the presence of noncooperative mobiles
INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay-based network utility maximization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Large deviations sum-queue optimality of a radial sum-rate monotone opportunistic scheduler
IEEE Transactions on Information Theory
On optimal feedback allocation in multichannel wireless downlinks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
A modeling framework for optimizing the flow-level scheduling with time-varying channels
Performance Evaluation
Optimal scheduling for dynamic channel allocation in wireless LANs
Wireless Networks
Adaptive joint scheduling of spectrum sensing and data transmission in cognitive radio networks
IEEE Transactions on Communications
Cell association and interference coordination in heterogeneous LTE-A cellular networks
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Large Deviations of Max-Weight Scheduling Policies on Convex Rate Regions
Mathematics of Operations Research
Fast algorithms for resource allocation in wireless cellular networks
IEEE/ACM Transactions on Networking (TON)
Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access
Mobile Networks and Applications
Delay-optimal opportunistic scheduling and approximations: the log rule
IEEE/ACM Transactions on Networking (TON)
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
IEEE/ACM Transactions on Networking (TON)
Stability with file arrivals and departures in multichannel cellular wireless networks
Queueing Systems: Theory and Applications
Stability and asymptotic optimality of opportunistic schedulers in wireless systems
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Log-weight scheduling in switched networks
Queueing Systems: Theory and Applications
Towards a queueing-based framework for in-network function computation
Queueing Systems: Theory and Applications
Stability of flow-level scheduling with Markovian time-varying channels
Performance Evaluation
Inefficiency of MaxWeight scheduling in spatial wireless networks
Computer Communications
Delay-based network utility maximization
IEEE/ACM Transactions on Networking (TON)
Scheduling in a random environment: stability and asymptotic optimality
IEEE/ACM Transactions on Networking (TON)
Throughput-optimal scheduling in multihop wireless networks without per-flow information
IEEE/ACM Transactions on Networking (TON)
On the compound impact of opportunistic scheduling and D2D communications in cellular networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
FlashLinQ: a synchronous distributed scheduler for peer-to-peer ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Delay-based back-pressure scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Approaching throughput optimality with limited feedback in multichannel wireless downlink networks
IEEE/ACM Transactions on Networking (TON)
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.12 |
We consider the following queuing system which arises as a model of a wireless link shared by multiple users. There is a finite number N of input flows served by a server. The system operates in discrete time t = 0,1,2,…. Each input flow can be described as an irreducible countable Markov chain; waiting customers of each flow are placed in a queue. The sequence of server states m(t), t = 0,1,2,…, is a Markov chain with finite number of states M. When the server is in state m, it can serve &mgr;im customers of flow i (in one time slot).The scheduling discipline is a rule that in each time slot chooses the flow to serve based on the server state and the state of the queues. Our main result is that a simple online scheduling discipline, Modified Largest Weighted Delay First, along with its generalizations, is throughput optimal; namely, it ensures that the queues are stable as long as the vector of average arrival rates is within the system maximum stability region.