Service Profile-Aware Control Plane: Multi-Instance Fixed Point Approximation within Multi-Granularity VPN Loss Networks Perspective Project Concept Project.

Slides:



Advertisements
Similar presentations
Cross-layer Design in Wireless Mesh Networks Hu Wenjie Computer Network and Protocol Testing Laboratory, Dept. of Computer Science & Technology, Tsinghua.
Advertisements

CCAMP WG, IETF 80th, Prague, Czech Republic draft-gonzalezdedios-subwavelength-framework-00 Framework for GMPLS and path computation support of sub-wavelength.
THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
S Licentiate course on Telecommunications Technology (4+1+3 cr.) Course Topic Spring 2000: Routing Algorithms in the DiffServ MPLS Networks Introduction.
Omniran TG 1 Cooperation for OmniRAN P802.1CF Max Riegel, NSN (Chair OmniRAN TG)
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Analytical Modeling and Evaluation of On- Chip Interconnects Using Network Calculus M. BAkhouya, S. Suboh, J. Gaber, T. El-Ghazawi NOCS 2009, May 10-13,
Traffic Engineering With Traditional IP Routing Protocols
Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.
1 Traffic Engineering for ISP Networks Jennifer Rexford IP Network Management and Performance AT&T Labs - Research; Florham Park, NJ
Traffic Engineering in IP Networks Jennifer Rexford Computer Science Department Princeton University; Princeton, NJ
Performance Analysis of Wavelength-Routed Optical Networks with Connection Request Retrials Fei Xue+, S. J. Ben Yoo+, Hiroyuki Yokoyama*, and Yukio Horiuchi*
Review Session Chapter 5 Networking Chapter 6 System Development.
Research & development Traffic Engineering over Ethernet Bridged Networks Benchmarking Carrier Ethernet Technologies Session MII.3 Krakow, Poland - April.
Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),
AGG-NANOG IP Network Traffic Engineering Albert Greenberg Internet and Networking Systems Research Lab AT&T Labs - Research; Florham Park, NJ See.
TICTOC -Topology-Discovery and Clock-Discovery TICTOC BOF IETF70 Stewart Bryant
Abstraction and Control of Transport Networks (ACTN) BoF
1 EL736 Communications Networks II: Design and Algorithms Class11: Multi-Hour and Multi-Layer Network Design 12/05/2007.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
MPLS networking at PSP Co Multi-Protocol Label Switching Presented by: Hamid Sheikhghanbari 1.
Network Planning & Capacity Management Frank Yeong-Sung Lin ( 林永松 ) Department of Information Management National Taiwan University Taipei, Taiwan, R.O.C.
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
By: Gang Zhou Computer Science Department University of Virginia 1 A Game-Theoretic Framework for Congestion Control in General Topology Networks SYS793.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Profiles and Multi-Topology Routing in Highly Heterogeneous Ad Hoc Networks Audun Fosselie Hansen Tarik Cicic Paal Engelstad Audun Fosselie Hansen – Poster,
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
Waveband switching. WBS –In GMPLS networks, underlying network nodes need to support multiple switching granularities –Therefore, ordinary wavelength-switching.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
ECE 4450:427/527 - Computer Networks Spring 2015 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 2: Overview of Computer Network.
A Case Study in Understanding OSPFv2 and BGP4 Interactions Using Efficient Experiment Design David Bauer†, Murat Yuksel‡, Christopher Carothers† and Shivkumar.
Network-Based Optimization Models Charles E. Noon, Ph.D. The University of Tennessee.
1 Traffic Engineering in Multi-Granularity, Heterogeneous, WDM Optical Mesh Networks Through Dynamic Traffic Grooming Keyao Zhu, Hongyue Zhu, and Biswanath.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Examination Committee: Dr. Poompat Saengudomlert (Chairperson) Assoc. Prof. Tapio Erke Dr. R.M.A.P. Rajatheva 1 Telecommunications FoS Asian Institute.
1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
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.
11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.
Tunable QoS-Aware Network Survivability Presenter : Yen Fen Kao Advisor : Yeong Sung Lin 2013 Proceedings IEEE INFOCOM.
Company LOGO Network Management Architecture By Dr. Shadi Masadeh 1.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
MULTI-PROTOCOL LABEL SWITCHING By: By: YASHWANT.V YASHWANT.V ROLL NO:20 ROLL NO:20.
Homenet Routing IETF 83, Paris Acee Lindem, Ericsson.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Tango1 Considering End-to-End QoS Constraints in IP Network Design and Planning M.Ajmone Marsan, M. Garetto, E. Leonardi. M. Mellia, E. Wille Dipartimento.
Wired and Wireless network management 1. outline 2 Wireless applications Wireless LAN Wireless LAN transmission medium WLAN modes WLAN design consideration.
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
Multiprotocol Label Switching (MPLS) Routing algorithms provide support for performance goals – Distributed and dynamic React to congestion Load balance.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Lecture 3 : Network Architectures 1.
TICTOC -Topology-Discovery and Clock-Discovery
Cognitive Network Standardization Activities April, 2008
Chapter 1 Introduction to Networking
Authors: Jiang Xie, Ian F. Akyildiz
Basic Communications Model Standards are needed at all Layers
COMPUTER NETWORKS CS610 Lecture-21 Hammad Khalid Khan.
Constraint-Based Routing
An Equal-Opportunity-Loss MPLS-Based Network Design Model
ECE 4450:427/527 - Computer Networks Spring 2017
Goals Introduce the Windows Server 2003 family of operating systems
Authentication and handoff protocols for wireless mesh networks
DetNet Information Model Consideration
Design & development of impairment-aware routing and wavelength assignment algorithms for Future Internet Mohammad Shoyaib Student ID: Image.
Network Planning & Capacity Management
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Chapter-5 Traffic Engineering.
Network Planning & Capacity Management
Network Planning & Capacity Management
Presentation transcript:

Service Profile-Aware Control Plane: Multi-Instance Fixed Point Approximation within Multi-Granularity VPN Loss Networks Perspective Project Concept Project Impact/Significance Goals and Objectives All traffic management (TM) schemes of Service-Oriented model provides a reduction in blocking probability compared to the IETF-SR and ITU-SR control plane models. The reduction in blocking probability is 40-80% and 19-78% respectively  Depending on net. topology, Service-Oriented TM scheme Highest reduction in blocking probability in “w/(NE,IM)” TM scheme Reduction of 58-80% of blocking probability depending on the network topology Lowest reduction in blocking probability in “w/o(NE,IM)” Service-Oriented TM scheme Reduction of 19-40% of blocking probability depending on network topology This work introduces a novel concept of service profile-aware control plane model Differs from existing Internet Engineering Task Force (IETF) and International Telecommunications Union (ITU) control plane models in multiple aspects:  Full realization of the multi-granularity network resources  Complete consideration for services’ architectures and their associated service profile feature set Including: service flow connectivity, load partitioning flexibility, and service demand granularity Detailed comparison between the three control plane models were considered from multiple dimensions: Traffic management scheme of each control plane model Component-level interaction between service profile layer, control plane layer and network infrastructure layer Infrastructure realization from both horizontal “network domains” and vertical “resource granularity and network partitions” perspective Multiple service architectures and their related mathematical models were analyzed Based on their service profile parameters Detailed mathematical analysis of the three control plane models demonstrated superiority of the Service Profile-Aware control plane model over IETF and ITU models Define detailed architectures for the service configuration models from the following three perspectives: Service flow connectivity, load partitioning, and service demand granularity Define detailed architectures for the three control plane models from the following three perspectives: Transport network granularity realization, component-level, and operational-level Develop detailed mathematical models for the service configuration models to compute the following performance metrics: Input load on each of the topology links based on the service flow connectivity Link blocking probability based on link’s capacity and applied input load Using Fixed Point Approximation (FPA), define detailed mathematical models for the three control plane models to compute the following parameters: Routing probability for each possible route for a source-destination pair Occupancy probability “Utilization” for each of the transport network granularity levels Network-Wide permissible “non-blocked” load Network-Wide service blocking probability The need to establish network connections in a service profile-aware fashion Variety of candidate wired and wireless client networks Current network infrastructure operation via the control plane is independent of the service profile layer Without considering service profile parameters as input to the control plane layer while establishing network connections The optimization of network connections routed paths will have to take into account a number of service profile parameters and network constraints Electrical Engineering & Computer Science