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 1

Optimization problems for communications networks

Communication networks consist of nodes and links. Figure 1.1 shows an example of a network. This network consists of six nodes, node 1 to node 6. An arrow between two nodes is a connection, called a link, of those nodes. The traffic has a direction from the tail to the head of the arrow. For example, the arrow from node 1 to node 2 means that node 1 and node 2 are connected and the traffic flows from node 1 to node 2. The network in which each link has a direction, represented by a corresponding arrow, as shown in Figure 1.1, is called a directed graph. A number on each link indicates its link cost. In the case that the connection is represented by just a line, instead of an arrow, ...

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