On the throughput, capacity, and stability regions of random multiple access
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Capacity of queues via point-process channels
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
USENIX-SS'06 Proceedings of the 15th conference on USENIX Security Symposium - Volume 15
Foundations and Trends® in Networking
Anti-jamming timing channels for wireless networks
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Dependent link padding algorithms for low latency anonymity systems
Proceedings of the 15th ACM conference on Computer and communications security
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Temporal privacy in wireless sensor networks: Theory and practice
ACM Transactions on Sensor Networks (TOSN)
Some observations on limited feedback for multiaccess channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed turbo coding with information transfer via timing of the half-duplex relay-phases
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On queueing and multilayer coding
IEEE Transactions on Information Theory
An attack-defense game theoretic analysis of multi-band wireless covert timing networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Robust and undetectable steganographic timing channels for i.i.d. traffic
IH'10 Proceedings of the 12th international conference on Information hiding
Adaptive Sampling for Linear State Estimation
SIAM Journal on Control and Optimization
Moving steganography and steganalysis from the laboratory into the real world
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 754.90 |
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