July 2003
Intermediate to advanced
464 pages
12h 40m
English
book
Optical Network Control: Architecture, Protocols, and Standards
by Greg Bernstein, Bala Rajagopalan, Debanjan Saha
Content preview from Optical Network Control: Architecture, Protocols, and Standards
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 Eleven. Route Computation and Path Selection
11.1 INTRODUCTION
11.2 SHORTEST PATH COMPUTATION
11.2.1 The Bellman-Ford Algorithm
11.2.1.1 Bellman-Ford Algorithm Example
11.2.2 Dijkstra's Algorithm
11.2.2.1 Dijkstra's Algorithm Example
11.2.3 A Comparison of Bellman-Ford and Dijkstra Algorithms
11.3 ROUTING WITH SIMPLE CONSTRAINTS
11.3.1 Link Protection Constraints Example
11.3.2 Bandwidth Constraints
11.4 PATH SELECTION FOR DIVERSITY
11.4.1 Link Diverse Routing Algorithms
11.4.1.1 Nonoptimal Disjoint Paths via Pruning
11.4.2 Shortest Link Diverse Paths Algorithm
11.4.2.1 Link Disjoint Path Pair Algorithm
11.5 NETWORK OPTIMIZATION
11.5.1 Batch Processing
11.5.2 Shortest Path: Mathematical Formulation
11.5.3 Multicommodity Flow: Mathematical Formulation ...
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.