We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byHaley Daugherty
Modified over 3 years ago
www.procket.com CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 The 21 st Century Intelligent Network Tony Li, Carl DeSousa
2 CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 Fundamentals Profitability drives the new network New revenues through new applications Video telephony & conferencing Pervasive broadband access HDTV distribution, VOD, gaming FTTP Decreased expenses Capital efficiency Operational efficiency Focus today on network architectures
3 CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 Optical Switching: A Pragmatic Look Optical switching can decrease switching costs New switching layers have associated management costs Demand from full lambda user applications is low Greater need for optical switching in trunking
4 CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 An Example Partial mesh topologies result in transit switching Large traffic aggregates can economically be optically switched at transit points How can we optimally use the lambda topology? Can we provide traffic engineering at the lambda level?
5 CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 Traffic Engineering Commonly used in telephony networks Successful usage in IP networks with MPLS/TE Can we extend this cleanly to the lambda level? Inputs: Node-to-node traffic matrix at the trunk level, time variant Topology, capacity and costs Desired results: (how do we set up switches) Support current offered traffic load Optimal assignments of lambdas to minimize global costs Dynamic recovery to address failures
6 CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 Approaches to dynamic recovery Pre-computation For each possible network failure, compute alternative optimal routing Computationally intensive: scales linearly with number of elements Does not reasonably support multiple failures Dynamic computation Intelligence in the network computes recovery routing Suboptimal computation unless done with global data Slower recovery times Can adapt to multiple failures easily
7 CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 Hybrid computation Combine pre-computation and dynamic computation Pre-compute most significant recovery options for single failures Ignore low-priority recovery Ignore multiple failures Intelligence in the network to dynamically compute remaining cases Centralized computation to recover global optimality for the longer term
8 CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 Benefits and constraints Smooth improvement of efficiency over time Pre-computation provides fast recovery for covered cases Dynamic computation provides coverage for other cases Long term optimization eventually reaches maximal efficiency Effective dynamic computation requires peer model optical network IP layer must know about optical topology and capacity Optical layer must know about traffic priorities Overlay model abstracts optical topology & capacity
1Traffic Engineering © 1999, Cisco Systems, Inc. MPLS Traffic Engineering George Swallow George Swallow
An evolutionary approach to G-MPLS ensuring a smooth migration of legacy networks Ben Martens Alcatel USA.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.
1 Simple provisioning, complex consolidation – An approach to improve the efficiency of provisioning oriented optical networks Tamás Kárász Budapest University.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introducing Network Design Concepts Designing and Supporting Computer Networks.
Use Cases for High Bandwidth Query and Control of Core Networks Greg Bernstein, Grotto Networking Young Lee, Huawei draft-bernstein-alto-large-bandwidth-cases-00.txt.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Introducing Network Design Concepts Designing and Supporting Computer Networks.
Software-defined networking: Change is hard Ratul Mahajan with Chi-Yao Hong, Rohan Gandhi, Xin Jin, Harry Liu, Vijay Gill, Srikanth Kandula, Mohan Nanduri,
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
1 © 2005 Cisco Systems, Inc. All rights reserved. M. Behringer: Pervasive Core Security To Route Or Not To Route? Michael H. Behringer Dirk Schroetter.
All rights reserved © 2006, Alcatel Grid Standardization & ETSI (May 2006) B. Berde, Alcatel R & I.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
© 2001 Caspian Networks, Inc. CONFIDENTIAL AND PROPRIETARY INFORMATION Internet Intelligence and Traffic Growth Lawrence G. Roberts Chairman & CTO Caspian.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.
Traffic Engineering over MPLS
© 2017 SlidePlayer.com Inc. All rights reserved.