1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Failure Resilient Routing Simple Failure Recovery with Load Balancing Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Using Network Virtualization Techniques for Scalable Routing Nick Feamster, Georgia Tech Lixin Gao, UMass Amherst Jennifer Rexford, Princeton University.
June 27, 2007 FIND Meeting, From Packet-Switching to Contract- Switching Aparna Gupta Shivkumar Kalyanaraman Rensselaer Polytechnic Institute Troy,
Multihoming and Multi-path Routing
Theory Lunch. 2 Problem Areas Network Virtualization for Experimentation and Architecture –Embedding problems –Economics problems (markets, etc.) Network.
Multihoming and Multi-path Routing
APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Interference.
1 Multi-Channel Wireless Networks: Capacity and Protocols Nitin H. Vaidya University of Illinois at Urbana-Champaign Joint work with Pradeep Kyasanur Chandrakanth.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Scalable Routing In Delay Tolerant Networks
Multipath Routing for Video Delivery over Bandwidth-Limited Networks S.-H. Gary Chan Jiancong Chen Department of Computer Science Hong Kong University.
Video Services over Software-Defined Networks
FIND PI Meeting, November Value Flows and Risk Management Architecture for Future Internet Murat Yuksel University of Nevada.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Logically-Centralized Control COS 597E: Software Defined Networking.
Two-Market Inter-domain Bandwidth Contracting
Utility Optimization for Event-Driven Distributed Infrastructures Cristian Lumezanu University of Maryland, College Park Sumeer BholaMark Astley IBM T.J.
FIND PI Meeting, April Contract-Switching: Value Flows in Inter-Domain Routing Murat Yuksel University of Nevada – Reno Reno, NV Aparna Gupta, Koushik.
Chapter 9 Introduction to MAN and WAN
Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma, Jiang Chen, Yang Richard Yang and Arvind Krishnamurthy Yale University University.
Simultaneous Routing and Resource Allocation in Wireless Networks Mikael Johansson Signals, Sensors and Systems, KTH Joint work with Lin Xiao and Stephen.
A New Paradigm for Inter-Domain Traffic Engineering Adrian Farrel Juniper Networks
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Page 1 iPOP2009, Tokyo, Japan Selecting Domain Paths in Inter-Domain MPLS-TE and GMPLS Adrian Farrel, Old Dog Consulting Daniel King, Old Dog Consulting.
Multihoming and Multi-path Routing CS 7260 Nick Feamster January
Abhigyan, Aditya Mishra, Vikas Kumar, Arun Venkataramani University of Massachusetts Amherst 1.
Bilal Gonen, Murat Yuksel, Sushil Louis University of Nevada, Reno.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
K-step Local Improvement Policy Motivation Inter-domain connectivity in the Internet is currently established on policy- based shortest-path routing. Business.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Yashar Ganjali Computer Systems Laboratory Stanford University February 13, 2003 Optimal Routing in the Internet.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
LCN 2007, Dublin 1 Non-bifurcated Routing in Wireless Multi- hop Mesh Networks by Abdullah-Al Mahmood and Ehab S. Elmallah Department of Computing Science.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Routing. A world without networks and routing  No connection between offices, people and applications  Worldwide chaos because of the lack of centralized.
IEEE Global Internet, April Contract-Switching Paradigm for Internet Value Flows and Risk Management Murat Yuksel University.
Path-Vector Contract Routing Hasan T. Karaoglu, Murat Yuksel University of Nevada, Reno ICC’12 NGNI, Toronto June, 2012.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Network Aware Resource Allocation in Distributed Clouds.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
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.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
COMP 3270 Computer Networks
Introduction to Internet Routing
Presentation transcript:

1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI) Hasan T. Karaoglu, Murat Yukse l (UNR)

Motivation Contract-Switching Architecture Internet Traffic Engineering using Contract-switching Numerical study and Benchmarking Distributed TE Solution Contributions and Future work 2

Attain high-efficiency inter-domain TE Numerous methods for intra-domain TE Inter-domain TE involves many factors ranging from technology to economics and policy Current Inter-domain TE techniques are constrained to outbound traffic load balancing Cooperative inter-domain traffic engineering among neighboring ISPs is necessary

ISP is abstracted as a single node or as a set of nodes (in case of multiple ASes) Node abstraction simplifies inter-domain routing Loss of path selection and flexibility beyond shortest- path routing in terms of AS hops. Sufficient flexibility at the routing level is crucial for TE

Link-state mechanisms to inter-domain routing K. Levchenko, G. M. Voelker, R. Paturi, and S. Savage. Xl: an efficient network routing algorithm. In Proc. SIGCOMM, Pathlet Routing abstracts ISP as virtual nodes Scott Shenker, P. Brighten Godfrey, Igor Ganichev, and Ion Stoica, Pathlet routing. Proc. SIGCOMM, Inter-AS source routing and GMPLS Xiaowei Yang, David Clark, and Arthur Berger, NIRA: A new inter-domain routing architecture. IEEE/ACM Transactions on Networking, 15:775–788, E. Mannie. Generalized mpls architecture, RFC 3945

Contract-Switching Paradigm for Internet value flows and risk management, Yuksel et al ISP is abstracted as a set of contract links Contract link – Advertisable contract between edge nodes (peering points) of an ISP 6 Network Core accessed only by contracts Customers Edge Router Edge Router Edge Router Edge Router Edge Router Edge Router Stations of the provider computing and advertising local prices for edge-to- edge contracts. 30Mbps, 45 min, $9

Each contract link follows a single, fixed intra-AS path End-to-end flows are optimally split along contract links Optimal inter-domain traffic engineering, but simple intra- domain routing 7

- Bandwidth capacity of router-to-router link - Physical links used to construct edge-to-edge link - Total traffic at edge router for destination - Flow on the contract or peering link

Maximum Throughput Routing 9 Capacity constraints Flow-conservation constraints Edge-to-edge flows Throughput

Minimum Delay Routing V xy (f) is a convex-cost with each router-to-router link. Consider M/M/1 delay cost. Minimum Bandwidth Routing 10

Global Optimum (OPT) – Complete Internet topology without abstractions (optimal inter and intra-domain routing) BGP framework – Least ISP hops for inter-domain and OSPF/RIP for intra-domain 11

Random topology Inter-domain and Intra-domain are random BRITE topology BRITE model for inter-domain Rocketfuel Topologies (ABILENE and GEANT) for intra-domain GTITM topology GTITM model for inter-domain Rocketfuel Topologies (ABILENE and GEANT) for intra-domain 12

Average throughput on 50 random topologies 13

Delay on Sample Random topology and Sample BRITE topology 14

Average total bandwidth on 50 BRITE topologies

Derived using the gradient descent approach to penalized objective function Traffic rate variables for each destination at each edge- link Updating of traffic rates requires only local information Gradient projection method for AS j involves projection on, the intra-domain capacity region Gradient projection method for e-edge links requires the congestion along the link and local communication between the end nodes

Generate Internet topologies according to BRITE Size of each AS is 10 routers Obtain ratio of converged cost to optimum cost Both average and maximum ratio is close to 1 Converged cost of the proposed TE solution is close to the optimum 17 Number of ASes Average Maximum

18 Convergence if cost does not vary beyond 0.5% Convergence time seems to increase sub-linearly with number of ASes, and number of destinations

Contract link abstraction provides significant improvement in routing performance over BGP Close to the best achievable performance Link abstraction is good for inter-domain traffic engineering Developed distributed TE solution based on gradient descent and studied its performance numerically 19

Thank You !! Questions ?