Performance Evaluation of ATM Shortcuts in Overlaid IP/ATM Networks Jim Kurose Don Towsley Department of Computer Science Univ. of Massachusetts, Amherst.

Slides:



Advertisements
Similar presentations
Stable Load Control with Load Prediction in Multipath Packet Forwarding IlKyu Park, Youngseok Lee, and Yanghee Choi Proc. 15 th IEEE Int l conf. on Information.
Advertisements

Florin Dinu T. S. Eugene Ng Rice University Inferring a Network Congestion Map with Traffic Overhead 0 zero.
Presentation of Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip by Christian Neeb and Norbert Wehn and Workload Driven Synthesis.
Restoration by Path Concatenation: Fast Recovery of MPLS Paths Anat Bremler-Barr Yehuda Afek Haim Kaplan Tel-Aviv University Edith Cohen Michael Merritt.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Infocom 2003 An Approach to Alleviate Link Overload as Observed on an IP Backbone Tuesday, April 1 st Infocom 2003 Sundar Iyer 1,2, Supratik Bhattacharrya.
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
A Practical Approach to QoS Routing for Wireless Networks Teresa Tung, Zhanfeng Jia, Jean Walrand WiOpt 2005—Riva Del Garda.
Breaking the Single-Path Barrier Brad Smith Jack Baskin SoE Research Review Day 10/20/2011.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
A New Approach for the Construction of ALM Trees using Layered Coding Yohei Okada, Masato Oguro, Jiro Katto Sakae Okubo International Conference on Autonomic.
Jan 13, 2006Lahore University of Management Sciences1 Protection Routing in an MPLS Network using Bandwidth Sharing with Primary Paths Zartash Afzal Uzmi.
Traffic Engineering With Traditional IP Routing Protocols
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Restoration Routing in MPLS Networks Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.
King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by:
ASWP – Ad-hoc Routing with Interference Consideration June 28, 2005.
ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
Path Protection in MPLS Networks Using Segment Based Approach.
Yao Zhao 1, Yan Chen 1, David Bindel 2 Towards Unbiased End-to-End Diagnosis 1.Lab for Internet & Security Tech, Northwestern Univ 2.EECS department, UC.
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
A Peer-to-Peer On-Demand Streaming Service and Its Performance Evaluation Yang Guo, Kyoungwon Suh, Jim Kurose, Don Towsley University of Massachusetts,
1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.
MPLS networking at PSP Co Multi-Protocol Label Switching Presented by: Hamid Sheikhghanbari 1.
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
17 th International Teletraffic Congress Topological design of telecommunication networks Michał Pióro a,b, Alpar Jüttner c, Janos Harmatos c, Áron Szentesi.
Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Challenges and Opportunities Posed by Power Laws in Network Analysis Bruno Ribeiro UMass Amherst MURI REVIEW MEETING Berkeley, 26 th Oct 2011.
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints Yao Zhao, Zhaosheng Zhu, Yan Chen, Northwestern University Dan.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Sep. 1, SIGCOMM '99 Dan Rubenstein1 The Impact of Multicast Layering on Network Fairness Dan Rubenstein Jim Kurose Don Towsley.
Research Unit in Networking - University of Liège A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks Fabian Skivée
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
A Bandwidth Estimation Method for IP Version 6 Networks Marshall Crocker Department of Electrical and Computer Engineering Mississippi State University.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
Symbiotic Routing in Future Data Centers Hussam Abu-Libdeh Paolo Costa Antony Rowstron Greg O’Shea Austin Donnelly MICROSOFT RESEARCH Presented By Deng.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
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.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Relevance of Complex Network Properties Philippe Giabbanelli «Impact of complex network properties on routing in backbone networks» Philippe Giabbanelli,
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
1 Minimum Interference Algorithm for Integrated Topology Control and Routing in Wireless Optical Backbone Networks Fangting Sun Mark Shayman University.
Performance Analysis of Inter-Domain Path Computation Methodologies draft-dasgupta-ccamp-path-comp-analysis-00.txt Sukrit Dasgupta, Jaudelice C. de Oliveira.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
1 Scalability and Accuracy in a Large-Scale Network Emulator Nov. 12, 2003 Byung-Gon Chun.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
Optimal Configuration of OSPF Aggregates
Multi-hop Coflow Routing and Scheduling in Data Centers
Department of Computer Science University of York
How to Select a Good Alternate Path in Large Peer-to-Peer Systems
pathChirp Efficient Available Bandwidth Estimation
pathChirp Efficient Available Bandwidth Estimation
Point-to-Point Network Switching
Presentation transcript:

Performance Evaluation of ATM Shortcuts in Overlaid IP/ATM Networks Jim Kurose Don Towsley Department of Computer Science Univ. of Massachusetts, Amherst Victor Firoiu Bay Architecture Lab Nortel Networks

2 Outline  The problem: benefit of ATM shortcuts in IP/ATM  Two methods for network performance comparison  Where are ATM shortcuts beneficial?  Conclusion

3 ATM Shortcuts - What Benefit ?  Facts –Internet ubiquitous –ATM infrastructure widely deployed  Forwarding IP traffic with bw. resv. –Hop-by-hop in IP –ATM shortcuts  Potential benefits of ATM shortcuts 1Cut through IP processing 2Shorter path in ATM => fewer resv. 3Richer ATM netw. => Lower blocking pr.  In this study: evaluate (2) and (3) ATM link IP link ATM shortcut IP router ATM switch

4 Comparing Network Performance  Consider two instances of an IP/ATM network:  Define Network Load Ratio R(p): –N 1 : traffic load (  i ) i => flow blocking pr. p 1 –N 2 : traffic load (R  i ) i => flow blocking pr. p 2 –R(p) is such that p 1 =p 2 =p “N 2 performs R times better than N 1 ” N 1 : using IP routing N 2 : using ATM routing 22 11 33 R1R1 R2R2 R3R3

5 Computing Network Load Ratio  Algorithm: P i (  ) given by Fixed Point Method  Complexity: O(L 2 CV 2 FS) L = no. links F = no. Fixed Point iterations (3..100) C = max. no. flows / link S = no. Inversion iterations (10..50) V = no. nodes  Problems –high computational complexity –computes R(p) only for a given p –need R for a range of p values

6 Simplification: Asymptotic Load Ratio  Observe: for p<0.1, R(N i,N j,p)  constant (p)  Define: Asymptotic Load Ratio Tandem NSFBone Star Complete

7 Computing Asymptotic Load Ratio  For networks with all links having same capacity C : –where  i = prob(flow traverses link i)  Similar result conjectured for heterogeneous capacities –verified by simulation  Advantages –low complexity O(LV 2 ), L = no. links, V = no. nodes –gives performance comparison for a range of p values

8 Accuracy of Asymptotic Load Ratio  Simulation: generate random networks (N k ) k  Compute NLR: R(N i,N j,p) for several p, using Fixed Point  Compute ALR: A(N i,N j ) using simple method  Compute relative error :  Computation time –NLR: 104s, for each p –ALR: 0.008s

9 Where are ATM Shortcuts Beneficial?  Simulation –Generate random ATM networks N A = no. nodes,  A = prob(link exists between two nodes) –Generate IP networks: –For each ATM/IP network pair map IP nodes to ATM nodes map IP links to shortest path ATM routes –Compute Asymptotic Load Ratio  Results –ALR highly correlated with: –IP to ATM average depth ratio –IP to ATM diameter ratio –ALR not correlated with: ave. degree ratio, no. nodes ratio

10 Simulation Results

11 Conclusion  Proposed two methods for evaluating benefit of ATM shortcuts –low computational complexity –accurate for a wide range of network load  Evaluated IP/ATM topologies where ATM shortcuts increase network capacity –when average route length is decreased  Methodology useful for network designers –asses opportunity for IP/ATM protocols  Future work –extend results for networks with alternate routing –flows with heterogeneous bandwidth requirements