May 2016
Intermediate to advanced
420 pages
12h 48m
English
Content preview from Optimization of Computer Networks
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,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Chapter 4Routing Problems
4.1 Introduction
Routing in communication networks is the particular set of rules that decide the path followed by the traffic units from their origin to destination nodes. The two main technological strategies to forward the traffic are flow-based routing and destination-based routing:
- In flow-based routing, network nodes are able to identify the demand
of the arriving traffic and make a different per-demand routing decision. Flow-based routing is characteristic of connection-oriented technologies like MPLS, ATM, frame-relay or SONET/SDH, where a flow completes a connection establishment stage before any data is carried. During this stage, the network decides and signals the flow route and configures the internalrouting tables of the traversed nodes accordingly. After that, the flow data frames are attached enough control information in their headers so that the intermediate nodes can enforce the routing previously defined. - In destination-based routing, the network nodes apply the same routing decision to all the traffic units targeted to the same destination. This happens irrespective of the particular flow or demand the traffic belongs to or, for instance, the particular initial node of the traffic. IP and Ethernet networks are the main representatives of destination-based routing, as IP routers and Ethernet switches make forwarding decisions observing ...
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.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.