1987. Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels. IEEE Transactions on Information Theory, 33, 219–223.
2003. Applied Probability and Queues. 2nd edn. New York, NY: Springer.
2003. Elements of Queueing Theory. Berlin: Springer. and
2001. Statistical bandwidth sharing: a study of congestion at flow level. Computer Communication Review, 31, 111–122., , , and
2013. Economic Modeling: A Primer with Engineering Applications. Foundations and Trends in Networking. Delft: now publishers. and
2001. Impact of fairness on Internet performance. Performance Evaluation Review, 29, 82–91. and
2004. Convex Optimization. Cambridge: Cambridge University Press. and
2006. Stability and Heavy Traffic Limits for Queueing Networks: St. Flour Lecture Notes. Berlin: Springer.
2000. Performance Guarantees in Communication Networks. London: Springer.
2013. Markov approximation for combinatorial network optimization. IEEE Transactions on Information Theory. doi: 10.1109/TIT.2013.2268923., , and
2007. Layering as optimization decomposition: a mathematical theory of network architectures. Proceedings of the IEEE, 95, 255–312., , and
2003. Pricing Communication Networks: Economics, Technology and Modelling. Chichester: Wiley. and
1991. A limit result respecting graph structure for a fully connected loss network with alternative routing. Annals of Applied Probability, 1, 436–444. and
1998. Differentiated end-to-end Internet services using a weighted proportionally fair sharing TCP. Computer Communications Review, 28, 53–69. and
2000. Random Walks and Electric Networks. Carus Mathematical Monographs. Washington D.C.: The Mathematical Association of America. and
1925. A proof of Maxwell's law, the principal proposition in the kinetic theory of gases. In , and (eds.), The Life and Works of A. K. Erlang. Copenhagen: Academy of Technical Sciences, 1948, pp. 222–226.
1953. On the stochastic matrices associated with certain queueing processes. Annals of Mathematical Statistics, 24, 355–360.
1960. The Theory ofLinear Economic Models. Chicago, IL: The University of Chicago Press.
1977. A minimum delay routing algorithm using distributed computation. IEEE Transactions on Communications, 25, 73–85.
2004. Big Queues. Berlin: Springer., and
1995. Dynamic alternative routing. In (ed.), Routing in Communications Networks. Englewood Clifs, NJ: Prentice Hall, pp. 13–47., and
2004. A bound on the capacity of backoff and acknowledgement-based protocols. SIAM Journal on Computing, 33, 313–331., , and
2006. Notes for ECE 467: Communication Network Analysis. http://www. ifp.illinois.edu/~hajek/Papers/networkanalysis.html.
1988. Congestion avoidance and control. Computer Communication Review, 18, 314–329.
2010. A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Transactions on Networking, 18, 960–972. and
2012. Stability and delay of distributed scheduling algorithms for networks of conflicting queues. Queueing Systems, 72, 161–187. and
2004. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29, 407–435. and
2009. State space collapse and difusion approximation for a network operating under a fair bandwidth-sharing policy. Annals of Applied Probability, 19, 1719–1780., , and
1991. Loss networks. Annals of Applied Probability, 1, 319–378.
1996. Notes on efective bandwidths. In , and (eds.), Stochastic Networks: Theory and Applications. Oxford: Oxford University Press, pp. 141–168.
2003a. Fairness and stability of end-to-end congestion control. European Journal ofControl, 9, 159–176.
2011. Reversibility and Stochastic Networks. Cambridge: Cambridge University Press.
1987. The number of packets transmitted by collision detect random access schemes. Annals of Probability, 15, 1557–1668. and
2011. Explicit congestion control: charging, fairness and admission management. In , and (eds.), Next-Generation Internet Architectures and Protocols. Cambridge: Cambridge University Press, pp. 257–274. and
2003b. Scalable TCP: improving performance in highspeed wide area networks. Computer Communication Review, 33, 83–91.
1953. Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Annals of Mathematical Statistics, 24, 338–354.
1975. Some problems in mathematical genealogy. In (ed.), Perspectives in Probability and Statistics: Papers in Honour of M.S. Bartlett. London: Applied Probability Trust/Academic Press, pp. 325–345.
1988. Implied cost methodology and software tools for a fully connected network with DAR and trunk reservation. British Telecom Technology Journal, 6, 52–65.
1998. Theory of maximum packing and related channel assignment strategies for cellular radio networks. Mathematical Methods of Operations Research, 48, 1–16., and
1993. Poisson Processes. Oxford: Oxford University Press.
1964. Communication Nets: Stochastic Message Flow and Delay. New York, NY: McGraw Hill.
1976. Queueing Systems, vol II: Computer Applications. NewYork,NY: Wiley.
1991. Distributed scheduling based on due dates and buffer priorities. IEEE Transactions on Automatic Control, 36, 1406–1416. and
2011. Asynchronous CSMA policies in multihop wireless networks with primary interference constraints. IEEE Transactions on Information Theory, 57, 3644–3676., and
2010. Performance Modeling, Loss Networks, and Statistical Multiplexing. San Rafael, CA: Morgan and Claypool.
1993. Markov Chains and Stochastic Stability. London: Springer. and
2010. On the flow-level dynamics of a packet-switched network. Performance Evaluation Review, 38, 83–94. and
2006. Maximizing throughput in wireless networks via gossiping. Performance Evaluation Review, 34, 27–38., and
1950. The bargaining problem. Econometrica, 18, 155–162.
1998. Markov Chains. Cambridge: Cambridge University Press.
2006. Rate of convergence for the ‘square root formula’ in the Internet transmission control protocol. Advances in Applied Probability, 38, 1132–1154.
1995. Modeling handovers in cellular mobile networks with dynamic channel allocation. Operations Research, 43, 33–42. and
2006. Combinatorial Stochastic Processes. Berlin: Springer.
1971. A Theory of Justice. Cambridge, MA: Harvard University Press.
1995. Multiservice Loss Models for Broadband Communication Networks. London: Springer.
2012. Randomized scheduling algorithm for queueing networks. Annals of Applied Probability, 22, 128–171. and
2012. Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. Annals of Applied Probability, 22, 70–127. and
2012. Optimal queue-size scaling in switched networks. Performance Evaluation Review, 40, 17–28., and
2007. Network Optimization and Control. Foundations and Trends in Networking. Hanover, MA: now publishers. and
1999. Charging Communication Networks: From Theory to Practice. Amsterdam: Elsevier.
2004. The Mathematics of Internet Congestion Control. Boston, MA: Birkhausen
1992. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37, 1936–1948. and
2012. Frequency-Domain Analysis and Design of Distributed Control Systems. Singapore: Wiley.
2002. On the stability of networks operating TCP-like congestion control. Proc. 15th Int. Fed. Automatic Control World Congress, Barcelona, Spain, 217–222.
1988. An Introduction to Queueing Networks. Englewood Clifs, NJ: Prentice Hall.
2009. Proportional fairness and its relationship with multi-class queueing networks. Annals of Applied Probability, 19, 2301–2333.
1971. Optimization Under Constraints. New York, NY: Wiley.
1986. Systems in Stochastic Equilibrium. New York, NY: Wiley.
2007. Networks: Optimisation and Evolution. Cambridge: Cambridge University Press.
1999. The output of a switch, or, effective bandwidths for networks. Queue-ing Systems, 32, 383–396.
2011. Design, implementation and evaluation of congestion control for multipath TCP. Proc. 8th USENIX Conference on Networked Systems Design and Implementation, Boston, MA, 99–112., , and
2011. Loss networks. In and (eds.), Queueing Networks: A Fundamental Approach. New York, NY: Springer, pp. 701–728. and