Within the context of flow control problems in data communication networks, we consider
decentralized algorithms which optimize a criterion reflecting the trade-off between the …

In this paper, we derive a time-complexity bound for the gradient projection method for
optimal routing in data networks. This result shows that the gradient projection algorithm of …

This chapter considers the problem of routing communication demands in high speed
networks which support Quality of Service constraints. Routing in the new generation of high …

When multiple systems are interconnected through a high-speed backbone network and
communicate without resource reservation, under certain conditions a severe overload can …

Dr Smith here presents essential mathematical and computational ideas of network
optimisation for senior undergraduate and postgraduate students in mathematics, computer …

The objectives of network management control are outlined, and two categories of control
are defined: network traffic controls and network configuration controls. Network traffic …

Apart from it being a challenge, the most important reason for starting a PhD project was a
large list of topics in the field of Operations Research that interested me, but were beyond …

We describe a procedure for bounding the performance of dynamic routing schemes for loss
or queueing networks. The bound is developed from a network flow synthesis of a collection …

PACKET-SWITCHED network may be thought of as a distributed pool of productive
resources (channels, buffers, and switching processors) whose capacity must be shared …