Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Variable frame based Max-Weight algorithms for networks with switchover delay

Variable frame based Max-Weight algorithms for networks with switchover delay

Thumbnail Image
Download
Name

Modiano_Variable frame.pdf

Size

471.67 KB

Format

Adobe PDF

Checksum (MD5)

6b7c4169cdc33f32f18b3a4c40dfa0a6

Author(s)
Celik, Guner Dincer
•
Borst, S.
•
Whiting, P.
•
Modiano, Eytan H.
Date Issued
July 2011
Journal
2011 IEEE International Symposium on Information Theory Proceedings
Publisher
Institute of Electrical and Electronics Engineers
Citation
Celik, G., S. Borst, P. Whiting, and E. Modiano. “Variable frame based Max-Weight algorithms for networks with switchover delay.” In 2011 IEEE International Symposium on Information Theory Proceedings, July 31 2011-Aug. 5 2011, St. Petersburg, pp. 2537-2541. Institute of Electrical and Electronics Engineers, 2011.
Version
Author's final manuscript
Abstract
This paper considers the scheduling problem for networks with interference constraints and switchover delays, where it takes a nonzero time to reconfigure each service schedule. Switchover delay occurs in many telecommunication applications such as satellite, optical or delay tolerant networks (DTNs). Under zero switchover delay it is well known that the Max-Weight algorithm is throughput-optimal without requiring knowledge of the arrival rates. However, we show that this property of Max-Weight no longer holds when there is a nonzero switchover delay. We propose a class of variable frame based Max-Weight (VFMW) algorithms which employ the Max-Weight schedule corresponding to the beginning of the frame during an interval of duration dependent on the queue sizes. The VFMW algorithms dynamically adapt the frame sizes to the stochastic arrivals and provide throughput-optimality without requiring knowledge of the arrival rates. Numerical results regarding the application of the VFMW algorithms to DTN and optical networks demonstrate a good delay performance.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
http://creativecommons.org/licenses/by-nc-sa/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/81421
DOI of Published Version
https://doi.org/10.1109/ISIT.2011.6034025
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.