Skip to Main Content
Linear Programming and Algorithms for Communication Networks
book

Linear Programming and Algorithms for Communication Networks

by Eiji Oki
August 2012
Intermediate to advanced content levelIntermediate to advanced
208 pages
4h 34m
English
CRC Press
Content preview from Linear Programming and Algorithms for Communication Networks

Chapter 7

Routing and traffic-demand model

Adopting suitable routing can increase the network resource utilization rate and network throughput. Because traffic resources are assigned efficiently, additional traffic can be supported. It also suppresses network congestion and increases robustness in the face of traffic demand fluctuations, most of which are difficult to predict. A traffic demand is defined as the traffic volume that a source node requests to send a destination node. One useful approach to enhancing routing performance is to minimize the maximum link utilization rate, also called the network congestion ratio, of all network links. Minimizing the network congestion ratio leads to an increase in admissible traffic.

This chapter deals ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Algorithms For Dummies

Algorithms For Dummies

John Paul Mueller, Luca Massaron

Publisher Resources

ISBN: 9781466552647