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 8

IP routing

This chapter describes several problems raised by route selection in an Internet Protocol (IP) network. In an IP network, an IP packet with the destination address is transmitted by way of transit node(s) to the destination node. When a node receives an IP packet, it determines the next hop node to which the packet should be transmitted by referring to its routing table made by IP routing protocols. By repeating this process, a packet reaches its destination.

8.1 Routing protocol

IP routing protocols are used to dynamically update routing tables, which indicate the next hop node according to the destinations of incoming packets. A routing protocol requires nodes exchange network information such as links and nodes in the ...

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