The document discusses packet handling and routing in future networks. It covers partitioning routing nodes for scalability, using traffic engineering and Diffserv to handle different traffic classes across networks, and using Generalized MPLS (GMPLS) to allow routing layers to interact with optical paths in a two-layer network architecture. GMPLS extends MPLS control planes to multiple switching types and sets up label switched paths (LSPs) between compatible network elements.
2. The Future of Packet Handling From Internet to Infrastructure Legacy Data Internet Internet New Public Network Voice Cap Grow Cap Mobile Public IP Legacy Data Voice Maintain reliability and quality Grow IP to Multi-terabit Cable
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14. Constraint-Based Routing: Service Model Operations Performed by the Ingress LSR 1) Store information from IGP flooding 3) Examine user defined constraints 4) Calculate the physical path for the LSP 5) Represent path as an explicit route 6) Pass ERO to RSVP for signaling 2) Store traffic engineering information Routing Table Extended IGP Traffic Engineering Database (TED) User Constraints Constrained Shortest Path First Explicit Route RSVP Signaling
15. Constraint-Based Routing Example Paris London Stockholm Madrid Rome Geneva Munich label-switched-path madrid_to_stockholm{ to Stockholm; from Madrid; admin-group {include red, green} cspf}
16.
17. Constraint-Based Routing: Service Model Operations Performed by the Ingress LSR 1) Store information from IGP flooding 3) Examine user defined constraints 4) Calculate the physical path for the LSP 5) Represent path as an explicit route 6) Pass ERO to RSVP for signaling 2) Store traffic engineering information Routing Table Extended IGP Traffic Engineering Database (TED) User Constraints Constrained Shortest Path First Explicit Route RSVP Signaling
18.
19.
20.
21. Constraint-Based Routing: CSPF Algorithm Routing Table Extended IGP Traffic Engineering Database (TED) User Constraints Constrained Shortest Path First (CSPF) Explicit Route For LSP = (highest priority) to (lowest priority) Prune links with insufficient bandwidth for CT Prune links that do not contain an included color Prune links that contain an excluded color Calculate shortest path from ingress to egress Select among equal-cost paths Pass explicit route to RSVP END FOR RSVP Signaling
22. Constraint-Based Routing: with DS-TE New York Atlanta Chicago Seattle Los Angeles San Francisco Kansas City Dallas label-switched-path SF_to_NY { to New_York; from San_Francisco; CT EF BW 100 MB; }
