NDLI: On the universality of age-based scheduling in wireless networks

Content Provider	IEEE Xplore Digital Library
Author	Bin Li Eryilmaz, A. Srikant, R.
Copyright Year	2015
Description	Author affiliation: Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA (Bin Li) \|\| Dept. of ECE, Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA (Srikant, R.) \|\| Dept. of ECE, Ohio State Univ., Columbus, OH, USA (Eryilmaz, A.)
Abstract	It is well-known that maximum weight scheduling, with link weights which are either functions of queue lengths or the ages of the Head-of-Line (HoL) packets in each queue, maximizes the throughput region of wireless networks with persistent flows. In particular, with only persistent flows, it does not matter for throughput optimality whether one uses queue lengths or HoL ages as weights. In this paper, we show the following interesting result: when some flows in the network are dynamic (i.e., they arrive and depart from the network and are not persistent), then HoL-age-based scheduling algorithms are throughput-optimal while it has previously been shown that queue-length-based algorithms are not. This reveals that, age-based algorithms are universal in the sense that their throughput optimality does not depend on whether the arriving traffic is persistent or not. We also present a distributed implementation of the proposed age-based algorithm using CSMA techniques, where each flow only knows its own age and carrier sensing information. Finally, we support our analytical results through simulations. The proof of throughput optimality may be interesting in its own right: it uses a novel Lyapunov function which is the sum of the ages of all the packets in the network.
Starting Page	1302
Ending Page	1310
File Size	688853
Page Count	9
File Format	PDF
ISBN	9781479983810
DOI	10.1109/INFOCOM.2015.7218506
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-04-26
Publisher Place	Hong Kong
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Heuristic algorithms Dynamic scheduling Throughput Wireless networks Scheduling algorithms Multiaccess communication Lyapunov methods
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

LP-relaxation based distributed algorithms for scheduling in wireless networks

A Dynamic Spatial Backoff Algorithm Based on Channel Rate and Transmit Power in Wireless Networks

Distributed Throughput-Optimal Scheduling in Ad Hoc Wireless Networks

On scheduling algorithms robust to heavy-tailed traffic

On the Universality of Age-Based Scheduling in Wireless Networks

Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks

Dynamic resource allocation in wireless ad hoc networks based on QS-CDMA

Maximum Throughput Power Control in CDMA Wireless Networks

Distributed learning for utility maximization over CSMA-based wireless multihop networks

On the universality of age-based scheduling in wireless networks

Similar Documents

LP-relaxation based distributed algorithms for scheduling in wireless networks

A Dynamic Spatial Backoff Algorithm Based on Channel Rate and Transmit Power in Wireless Networks

Distributed Throughput-Optimal Scheduling in Ad Hoc Wireless Networks

On scheduling algorithms robust to heavy-tailed traffic

On the Universality of Age-Based Scheduling in Wireless Networks

Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks

Dynamic resource allocation in wireless ad hoc networks based on QS-CDMA

Maximum Throughput Power Control in CDMA Wireless Networks

Distributed learning for utility maximization over CSMA-based wireless multihop networks

On the universality of age-based scheduling in wireless networks