• DocumentCode
    1245231
  • Title

    Bits through queues

  • Author

    Anantharam, Venkat ; Verdú, Sergio

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
  • Volume
    42
  • Issue
    1
  • fYear
    1996
  • fDate
    1/1/1996 12:00:00 AM
  • Firstpage
    4
  • Lastpage
    18
  • 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
  • Keywords
    channel capacity; exponential distribution; packet switching; queueing theory; telecommunication signalling; telephony; Shannon capacity; average service time; exponential service time distribution; information bearing packets; single-server queue; telephone signaling channel; upper bounds; Channel capacity; Communication channels; Decoding; Feedback; Information analysis; Network address translation; Queueing analysis; Telephony; Timing; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.481773
  • Filename
    481773
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1245231