We live in an increasingly connected world. Even before the appearance of the now
ubiquitous broadband links and wireless systems, networks have been used to connect …

This paper considers the problem of congestion in message-switched, or packet-switched,
networks, which employ probabilistic routing schemes. A queueing model for the analysis of …

It is shown that a number of fundamental optimal routing and design problems for
communication networks consisting of facilities for transmission, switching, relaying, etc …

Explaining how to apply to mathematical programming to network design and control, Linear
Programming and Algorithms for Communication Networks: A Practical Guide to Network …

Several proposed routing algorithms for store and forward communication networks,
including one currently in operation in the ARPANET route messages along shortest paths …

The research in this subject has now a long history and a large variety of related fields in
science, engineering and operations research, and is still developing fast, especially in its …

Closed queueing networks have been advocated by several authors to be a more desirable
model than open queueing networks (Kleinrock's model) for network design. We compare …

Publisher Summary This chapter discusses several applications of the following network
optimization problems: shortest paths, maximum flows, minimum cost flows, assignment and …

This book provides an introduction to optimization theory and its applications. It is written for
senior undergraduate students and first-year graduate students of telecommunication and …