Cited By
View all- Chassaing PMairesse J(2011)A non-ergodic probabilistic cellular automaton with a unique invariant measureStochastic Processes and their Applications10.1016/j.spa.2011.06.009121:11(2474-2487)Online publication date: Nov-2011
On throughput in stochastic linear loss networks
Pages 125 - 127
References
[1]
P. J. Hunt and F. P. Kelly. On critically loaded loss networks. Adv. Appl. Prob., 21(4):831--841, 1989.
[2]
P. Jelenković, P. Momčilović, M. S. Squillante. Scalability of wireless networks. IEEE/ACM ToN, 15(2):295--308, 2007.
[3]
A.G. de Kok. Computationally efficient approximations for balanced flowlines with finite intermediate buffers. Intl. J. Prod. Res., 28(2):401--419, 1990.
[4]
T. Liggett. Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Springer-Verlag, Berlin, 1999.
[5]
J. Martin. Large tandem queueing networks with blocking. Queueing Syst. Theory Appl., 41(1-2):45--72, 2002.
[6]
P. Momčilović, M. S. Squillante. On throughput in linear wireless networks. Proc. ACM MobiHoc, May 2008.
[7]
P. Momčilović, M. S. Squillante. On throughput in stochastic linear loss networks. Research Report, IBM Research Division, April 2008.
Index Terms
- On throughput in stochastic linear loss networks
Recommendations
Low‐loss TCP/IP header compression for wireless networks
AbstractWireless is becoming a popular way to connect mobile computers to the Internet and other networks. The bandwidth of wireless links will probably always be limited due to properties of the physical medium and regulatory limits on the use of ...
A Throughput Analysis of TCP Variants in Mobile Wireless Networks
NGMAST '09: Proceedings of the 2009 Third International Conference on Next Generation Mobile Applications, Services and TechnologiesUnlike wired networks, random packet loss due to bit errors is not negligible in wireless networks. These networks have mobility as another challenge. This causes significant performance degradation of TCP. Different Variants of TCP exist; some have no ...
Revisiting Stochastic Loss Networks: Structures and Approximations
We consider fundamental properties of stochastic loss networks, seeking to improve on the so-called Erlang fixed-point approximation. We propose a family of mathematical approximations for estimating the stationary loss probabilities and show that they ...
Comments
Information & Contributors
Information
Published In
Copyright © 2008 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 31 August 2008
Published in SIGMETRICS Volume 36, Issue 2
Check for updates
Qualifiers
- Technical-note
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 9Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 11 Aug 2024
Other Metrics
Citations
Cited By
View all- Chassaing PMairesse J(2011)A non-ergodic probabilistic cellular automaton with a unique invariant measureStochastic Processes and their Applications10.1016/j.spa.2011.06.009121:11(2474-2487)Online publication date: Nov-2011
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in