research-article

Bits through queues

Authors:

V. Anantharam,

S. VerduAuthors Info & Claims

IEEE Transactions on Information Theory, Volume 42, Issue 1

Pages 4 - 18

https://doi.org/10.1109/18.481773

Published: 01 September 2006 Publication History

Abstract

The Shannon capacity of the single-server queue is analyzed. We show that the capacity is lowest, equal to e^-1 nats per average service time, when the service time distribution is exponential. Further, this capacity cannot be increased by feedback. For general service time distributions, upper bounds for the Shannon capacity are determined. The capacities of the telephone signaling channel and of queues with information-bearing packets are also analyzed

Cited By

View all

Yu SChen WPoor H(2024)Real-Time Monitoring of Chaotic Systems With Known Dynamical EquationsIEEE Transactions on Signal Processing10.1109/TSP.2023.334708172(1251-1268)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TSP.2023.3347081
Sahasranand KTchamkerten A(2024)Feedback Increases the Capacity of Queues With Bounded Service TimesIEEE Transactions on Information Theory10.1109/TIT.2024.342190970:10(6823-6833)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1109/TIT.2024.3421909
Sangar YBiradavolu YKrishnaswamy B(2022)A Novel Time-Interval Based Modulation for Large-Scale, Low-Power, Wide-Area-NetworksACM Transactions on Sensor Networks10.1145/354954318:4(1-30)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3549543
Show More Cited By

Recommendations

Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments

To provide useful practical insight into the performance of service-oriented (non-revenue-generating) call centers, which often provide low-to-moderate quality of service, this paper investigates the efficiency-driven (ED), many-server heavy-traffic ...
Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment

Extending Ward Whitt's pioneering work "Fluid Models for Multiserver Queues with Abandonments, Operations Research, 54(1) 37---54, 2006," this paper establishes a many-server heavy-traffic functional central limit theorem for the overloaded $$G{/}GI{/}n+...
(N,n)-preemptive priority queues

In this paper, we propose a new priority discipline, called the (N,n)-preemptive priority discipline. Under this discipline, the preemption of the service of a low-class customer is determined by two thresholds N and n of the queue length of high-class ...

Comments

Information & Contributors

Information

Published In

IEEE Transactions on Information Theory Volume 42, Issue 1

January 1996

330 pages

ISSN:0018-9448

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 September 2006

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yu SChen WPoor H(2024)Real-Time Monitoring of Chaotic Systems With Known Dynamical EquationsIEEE Transactions on Signal Processing10.1109/TSP.2023.334708172(1251-1268)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TSP.2023.3347081
Sahasranand KTchamkerten A(2024)Feedback Increases the Capacity of Queues With Bounded Service TimesIEEE Transactions on Information Theory10.1109/TIT.2024.342190970:10(6823-6833)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1109/TIT.2024.3421909
Sangar YBiradavolu YKrishnaswamy B(2022)A Novel Time-Interval Based Modulation for Large-Scale, Low-Power, Wide-Area-NetworksACM Transactions on Sensor Networks10.1145/354954318:4(1-30)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3549543
Ozel OYener AUlukus S(2022)State Amplification and Masking While Timely Updating2022 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT50566.2022.9834677(916-921)Online publication date: 26-Jun-2022
https://dl.acm.org/doi/10.1109/ISIT50566.2022.9834677
Bender SDörpinghaus MFettweis G(2021)On the achievable rate of bandlimited continuous-time AWGN channels with 1-bit output quantizationEURASIP Journal on Wireless Communications and Networking10.1186/s13638-021-01892-92021:1Online publication date: 11-Mar-2021
https://dl.acm.org/doi/10.1186/s13638-021-01892-9
Chee YKiah HLing SNguyen TVu VZhang X(2021)String concatenation construction for Chebyshev permutation channel codes2016 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2016.7541814(2824-2828)Online publication date: 11-Mar-2021
https://dl.acm.org/doi/10.1109/ISIT.2016.7541814
Yang WCollins ADurisi GPolyanskiy YPoor H(2021)A beta-beta achievability bound with applications2016 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2016.7541783(2669-2673)Online publication date: 11-Mar-2021
https://dl.acm.org/doi/10.1109/ISIT.2016.7541783
Ferrante GQuek TWin M(2021)Timing capacity of queues with random arrival and modified service times2016 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2016.7541323(370-374)Online publication date: 11-Mar-2021
https://dl.acm.org/doi/10.1109/ISIT.2016.7541323
Yu SChen WPoor H(2021)Timing Side Information Aided Real-Time Monitoring of Discrete-Event Systems2021 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOBECOM46510.2021.9685563(1-6)Online publication date: 7-Dec-2021
https://dl.acm.org/doi/10.1109/GLOBECOM46510.2021.9685563
Soltani RGoeckel DTowsley DHoumansadr A(2021)Covert communications on Poisson packet channels2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2015.7447124(1046-1052)Online publication date: 10-Mar-2021
https://dl.acm.org/doi/10.1109/ALLERTON.2015.7447124
Show More Cited By

Abstract

Cited By

Recommendations

Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments

Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment

(N,n)-preemptive priority queues

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations