Vibhor Jain , Evan Lobisser, Ashish Baraskar, Brian J Thibeault, Mark Rodwell
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering...
-
date post
19-Dec-2015 -
Category
Documents
-
view
219 -
download
1
Transcript of Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering...
![Page 1: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/1.jpg)
Ashish GuptaAshish Gupta
Under Guidance ofProf. B.N. JainDepartment of Computer
Science and Engineering
Advanced Networking Laboratory
![Page 2: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/2.jpg)
47.1
47.247.3
IP 47.1.1.1
Dest Out
47.1 1 47.2 2
47.3 3
1
23
Dest Out
47.1 1 47.2 2
47.3 3
1
2
1
2
3
IP 47.1.1.1
IP 47.1.1.1IP 47.1.1.1
Dest Out
47.1 1 47.2 2
47.3 3
![Page 3: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/3.jpg)
Intf In
Label In
Dest Intf Out
3 0.40 47.1 1
Intf In
Label In
Dest Intf Out
Label Out
3 0.50 47.1 1 0.40
47.1
47.247.3
1
2
31
2
1
23
3Intf In
Dest Intf Out
Label Out
3 47.1 1 0.50
IP 47.1.1.1
IP 47.1.1.1
![Page 4: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/4.jpg)
47.1
47.247.3
1
2
3
1
2
1
2
3
3
![Page 5: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/5.jpg)
47.1
47.247.3
1
2
3
1
2
1
2
3
3
BACKUP PATH
![Page 6: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/6.jpg)
Should provide quick recovery after a failure
Optimal Use of Backup Resources
![Page 7: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/7.jpg)
Backup Path
Primary Path
![Page 8: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/8.jpg)
![Page 9: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/9.jpg)
The solutions are fixed No assurance for various QoS
constraints
We need guarantees that in case of failure, we will not lose packets for more than 50 ms
Or even in case of failure, the end to end delay will not
exceed 150 ms
![Page 10: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/10.jpg)
![Page 11: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/11.jpg)
Results in fewer backup paths – conserves resources
Can meet QoS constraints in a “tight” manner
Gives flexibility – How ?
The Main Idea
Look at the path as a sequence of segments and protect each segment separately
![Page 12: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/12.jpg)
How to divide the path into segments such that ?
If any segment fails, specified QoS constraints can be guaranteed
A Segment is a set of nodes which consists of:
1. Segment Switch Router – protects the segment
2. Protected Nodes
Main Focus
![Page 13: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/13.jpg)
Various QoS constraints considered:–Bounded Switch-Over Time–End-to-End Delay–Jitter–Reliability–Combination of above
Algorithms have to use backup resources effectively
![Page 14: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/14.jpg)
Switch over time : The time for which the packets are lost between the failure and recovery
![Page 15: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/15.jpg)
Using Timing Analysis, we derived a limit to the possible segment size
RTT( Ri , Rj ) + Ttest <
![Page 16: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/16.jpg)
Divide the path into minimum number of segments such that the inequality is satisfied for each segment
Intuitive choice: Greedy Algorithm
Problems with Greedy Algorithm
A new Adaptive Algorithm for Bounded Switch over time has been developed
Takes into account the topology and bandwidth reservation in the network
![Page 17: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/17.jpg)
Assures QoS satisfaction
Proved to be optimal
Robust
We have implemented it using the LSP Admission Control Simulator and tested it
Results indicate its efficiency
![Page 18: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/18.jpg)
In this analysis, we need to consider backup paths also.
Max (T + ( T2 – T1 ) ) <
![Page 19: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/19.jpg)
We need to satisfy the inequality for each possible path
• For each segment (found using previous algorithm), find the shortest possible backup path
• Will give the minimum value of end-to-end delay
• Check if inequality is satisfied, otherwise reject the current segment
![Page 20: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/20.jpg)
Jitter – similar to End-to-End delay
Multiple QoS constraints
Bounded Switch Over time
End-to-End Delay
Jitter
Developed an algorithm using
Dynamic Programming Approach
![Page 21: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/21.jpg)
Finding Reliability between two nodes : An NP complete problem
Earlier we were engaged in finding bounds
But turns out, Segment Based Approach allows for simpler analysis !
![Page 22: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/22.jpg)
An O(No. of Links + (No. of Segments)2 ) Algorithm to find exact path reliability !
Algorithm for finding the most reliable backup path
A heuristic Algorithm has been developed for meeting bounds on Reliability for the protection configuration
![Page 23: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/23.jpg)
Probability of Primary path for a particular segment Si to be working
Probability of Backup path for Segment Si to be working
Probability of Si to Sj-1 segments’s
primary path to be working & segment Sj primary path to have an error
![Page 24: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/24.jpg)
A visualization system developed for the Segment based Algorithms: based on POLKA
Closely Integrated with LSP Admission Control Simulator Visualizations are Dynamic not Static
Aids in understanding how the algorithms work Assists in establishing correctness of algorithms and simulations
![Page 25: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/25.jpg)
Topology Used
![Page 26: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/26.jpg)
![Page 27: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/27.jpg)
Aim of the Experiments
To evaluate the resource related advantages of Segment based Approach, while assuring QoS constraints
![Page 28: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/28.jpg)
An LSP Admission Control Simulator has been developed in C++
Simulates multiple networks with different reservation policies and compares results
We implement the Segment Based Algorithm for Bounded Switch over time for providing Protection to LSPs generated
BW Sharing Mechanisms also implemented
![Page 29: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/29.jpg)
Simulation Setup Topology with 50 routers and 82 links
LSPs setup using Djiktra’s Algorithm
BW of each link: 3000 to 10000 units
Delay of each link : 8 to 12 ms
BW requirements of each LSP : 20 to 70 units
LSP requests were generated with different QoS parameters
![Page 30: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/30.jpg)
![Page 31: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/31.jpg)
![Page 32: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/32.jpg)
![Page 33: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/33.jpg)
Today major networking companies are quickly shifting towards MPLS-based networks
Major Players:Cisco , AT&T, Level 3, Hewlett Packard,
UUNet, MCI World Com
“Within an MPLS-enabled network, even packet voice services such as voice over IP will benefit from reduced latency and congestion control”
Ranjeet Sudan, MPLS product manager at Cisco
Efficient Fault Tolerance in such services is a major concern
![Page 34: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/34.jpg)
For providing reliability to such services we now have Fault Tolerance Schemes which:
1. Guarantee satisfaction of various QoS constraints in case of failure
2. Use backup resources in an optimal manner
![Page 35: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/35.jpg)
Mechanisms for Detection and Notification Algorithms for various QoS constraints
Bounded Switch over time End-to-End delay Jitter Combination of above Reliability
Issues relating to backup path – Sharing… Admission Control Simulator developed for above Visualization System
![Page 36: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/36.jpg)
Paper being submitted to
Being held in Mumbai this year
![Page 37: Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.](https://reader035.fdocuments.net/reader035/viewer/2022062416/56649d375503460f94a10294/html5/thumbnails/37.jpg)