Flow Control and Routing Techniques for Integrated Voice and Data Networks
Abstract
We consider a model of integrated voice and data networks. In this model the network flow problem is formulated as a convex optimization problem. The objective function comprises two types of cost functions: the congestion cost functions, which limit the average input traffic to values compatible with the network conditions; and the rate limitation cost functions, which ensure that all conversations are fairly treated. A joint flow control and routing algorithm is constructed which determines the routes for each conversation, and effects flow control by setting voice packet lengths and data input rates in a manner that achieves optimal tradeoff between each user's satisfaction and the cost of network congestion. An additional congestion control protocol is specified which could be used in conjunction with the algorithm to make the latter respond more dynamically to network congestion.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1981
- Accession Number
- ADA107140
Entities
People
- Oliver C. Ibe
Organizations
- Massachusetts Institute of Technology